25 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. Interdicting Low-Diameter Cohesive Subgroups in Large-Scale Social Networks
14. The minimum spanning k-core problem with bounded CVaR under probabilistic edge failures
15. Graph signatures: Identification and optimization
16. A Bayesian framework for functional calibration of expensive computational models through non-isometric matching
17. An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph
18. SNP variable selection by generalized graph domination
19. On the chance-constrained minimum spanning k-core problem
20. A Bayesian framework for functional calibration of expensive computational models through non-isometric matching.
21. SNP Variable Selection by Generalized Graph Domination
22. Approaches for finding cohesive subgroups in large‐scale social networks via maximum k ‐plex detection
23. Detecting large risk-averse 2-clubs in graphs with random edge failures
24. The Minimum Spanningk-Core Problem with Bounded CVaR Under Probabilistic Edge Failures
25. Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.