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