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