100 results on '"Balasundaram, Balabhaskar"'
Search Results
2. First passage time interdiction in Markov chains
3. Graph signatures: Identification and optimization
4. A Bayesian framework for functional calibration of expensive computational models through non-isometric matching
5. Detecting a most closeness-central clique in complex networks
6. On the chance-constrained minimum spanning k-core problem
7. Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts
8. Correction to: Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts
9. On the 2-Club Polytope of Graphs
10. On Fault-Tolerant Low-Diameter Clusters in Graphs
11. Detecting large risk-averse 2-clubs in graphs with random edge failures
12. Graph Theoretic Clique Relaxations and Applications
13. Interdicting Low-Diameter Cohesive Subgroups in Large-Scale Social Networks
14. A Specialty Steel Bar Company Uses Analytics to Determine Available-to-Promise Dates
15. The minimum spanning k-core problem with bounded CVaR under probabilistic edge failures
16. Graph Domination, Coloring and Cliques in Telecommunications
17. Significant Winter Weather Events and Associated Socioeconomic Impacts (Federal Aid Expenditures) across Oklahoma : 2000–10
18. Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
19. An exact algorithm for the maximum probabilistic clique problem
20. A branch-and-bound approach for maximum quasi-cliques
21. Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
22. On characterization of maximal independent sets via quadratic optimization
23. Variable objective search
24. Topology design for on-demand dual-path routing in wireless networks
25. Graph signatures: Identification and optimization
26. Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
27. On a Polynomial Fractional Formulation for Independence Number of a Graph
28. Novel Approaches for Analyzing Biological Networks
29. A Bayesian framework for functional calibration of expensive computational models through non-isometric matching
30. An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph
31. RECOVERY ACT - Robust Optimization for Connectivity and Flows in Dynamic Complex Networks
32. A Bayesian framework for functional calibration of expensive computational models through non-isometric matching.
33. SNP variable selection by generalized graph domination
34. On the chance-constrained minimum spanning k-core problem
35. SNP Variable Selection by Generalized Graph Domination
36. Approaches for finding cohesive subgroups in large‐scale social networks via maximum k ‐plex detection
37. Detecting large risk-averse 2-clubs in graphs with random edge failures
38. The Minimum Spanningk-Core Problem with Bounded CVaR Under Probabilistic Edge Failures
39. Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts
40. Graph Domination, Coloring and Cliques in Telecommunications
41. A Specialty Steel Bar Company Uses Analytics to Determine Available-to-Promise Dates
42. A branch-and-bound approach for maximum quasi-cliques
43. Topology design for on-demand dual-path routing in wireless networks
44. Variable objective search
45. On characterization of maximal independent sets via quadratic optimization
46. Gradient-Type Methods
47. Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
48. Cohesive subgroup model for graph-based text mining
49. Network Clustering
50. Constructing test functions for global optimization using continuous formulations of graph problems
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.