Biconnectivity approximations and graph carvings
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Biconnectivity approximations and graph carvings
Journal of the ACM (JACM)
Augmenting undirected connectivity in RNC and in randomized Õ(n3) time
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Deterministic Õ(nm) time edge-splitting in undirected graphs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Property testing in bounded degree graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Computing edge-connectivity augmentation function in Õ(nm) time
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Optimal augmentation to make a graph k-edge-connected and triconnected
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Edge-connectivity augmentation with partition constraints
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Augmenting undirected edge connectivity in Õ(n2) time
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Locating sources to meet flow demands in undirected networks
Journal of Algorithms
Combined Connectivity Augmentation and Orientation Problems
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Independence Free Graphs and Vertex Connectivity Augmentation
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
A Near Optimal Algorithm for Vertex Connectivity Augmentation
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
The (sigma+1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Graph connectivity and its augmentation: applications of MA orderings
Discrete Applied Mathematics
Pushdown-reduce: an algorithm for connectivity augmentation and poset covering problems
Discrete Applied Mathematics
Combined connectivity augmentation and orientation problems
Discrete Applied Mathematics - Submodularity
A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs
Journal of Heuristics
Covering symmetric supermodular functions by uniform hypergraphs
Journal of Combinatorial Theory Series B
Approximating connectivity augmentation problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Independence free graphs and vertex connectivity augmentation
Journal of Combinatorial Theory Series B
Minimum cost subpartitions in graphs
Information Processing Letters
Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Augmenting the connectivity of geometric graphs
Computational Geometry: Theory and Applications
Tight approximation algorithm for connectivity augmentation problems
Journal of Computer and System Sciences
Minimizing a monotone concave function with laminar covering constraints
Discrete Applied Mathematics
On triconnected and cubic plane graphs on given point sets
Computational Geometry: Theory and Applications
Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Note: Local edge-connectivity augmentation in hypergraphs is NP-complete
Discrete Applied Mathematics
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
A new approach to splitting-off
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Augmenting undirected node-connectivity by one
Proceedings of the forty-second ACM symposium on Theory of computing
Augmenting edge-connectivity between vertex subsets
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Partition constrained covering of a symmetric crossing supermodular function by a graph
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Bounded length, 2-edge augmentation of geometric planar graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Testing Eulerianity and connectivity in directed sparse graphs
Theoretical Computer Science
Suggesting ghost edges for a smaller world
Proceedings of the 20th ACM international conference on Information and knowledge management
Connectivity augmentation in planar straight line graphs
European Journal of Combinatorics
Minimizing a monotone concave function with laminar covering constraints
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Tight approximation algorithm for connectivity augmentation problems
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Augmenting the edge-connectivity of a spider tree
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Edge-Connectivity augmentation and network matrices
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Augmenting forests to meet odd diameter requirements
Discrete Optimization
An algorithm for source location in directed graphs
Operations Research Letters
A novel data structure for biconnectivity, triconnectivity, and k-tree augmentation
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
An overview of algorithms for network survivability
ISRN Communications and Networking
Fixed-Parameter algorithms for minimum cost edge-connectivity augmentation
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |