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
Efficient splitting off algorithms for graphs
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
Perfect arborescence packing in preflow mincut graphs
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Computing edge-connectivity augmentation function in Õ(nm) time
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A new approximation algorithm for the planar augmentation problem
Proceedings of the ninth 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
A primal-dual schema based approximation algorithm for the element connectivity problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Strengthening integrality gaps for capacitated network design and covering problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Directed network design with orientation constraints
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A primal-dual schema based approximation algorithm for the element connectivity problem
Journal of Algorithms
Increasing digraph arc-connectivity by arc addition, reversal and complement
Discrete Applied Mathematics
Edge-Splitting Problems with Demands
Proceedings of the 7th 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
Polyhedral Structure of Submodular and Posi-modular Systems
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Simultaneous Augmentation of Two Graphs to an l-Edge-Connected Graph and a Biconnected Graph
ISAAC '00 Proceedings of the 11th International Conference 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
On the Minimum Local-Vertex-Connectivity Augmentation in Graphs
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
Security Problems for Statistical Databases with General Cell Suppressions
SSDBM '97 Proceedings of the Ninth International Conference on Scientific and Statistical Database Management
Algorithms for Restoration Planning in a Telecommunications Network
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
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
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Pushdown-reduce: an algorithm for connectivity augmentation and poset covering problems
Discrete Applied Mathematics
On the minimum local-vertex-connectivity augmentation in graphs
Discrete Applied Mathematics
Approximating connectivity augmentation problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Primal-dual approach for directed vertex connectivity augmentation and generalizations
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
On shredders and vertex connectivity augmentation
Journal of Discrete Algorithms
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
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
Reliability as an interdomain service
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Note: Covering symmetric semi-monotone functions
Discrete Applied Mathematics
Fast edge splitting and Edmonds' arborescence construction for unweighted graphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Edge-splittings preserving local edge-connectivity of graphs
Discrete Applied Mathematics
Primal-dual approach for directed vertex connectivity augmentation and generalizations
ACM Transactions on Algorithms (TALG)
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks
IEEE/ACM Transactions on Networking (TON)
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
Inapproximability of Survivable Networks
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Inapproximability of survivable networks
Theoretical Computer Science
Vertex fusion under distance constraints
European Journal of Combinatorics
A Graph Reduction Step Preserving Element-Connectivity and Applications
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Approximating Node-Connectivity Augmentation Problems
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Approximating connectivity augmentation problems
ACM Transactions on Algorithms (TALG)
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
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
Testing Eulerianity and connectivity in directed sparse graphs
Theoretical Computer Science
Degree Bounded Network Design with Metric Costs
SIAM Journal on Computing
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
Edge-Connectivity augmentation and network matrices
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Network design with edge-connectivity and degree constraints
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Efficient edge splitting-off algorithms maintaining all-pairs edge-connectivities
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
An algorithm to increase the node-connectivity of a digraph by one
Discrete Optimization
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
Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks
Journal of Combinatorial Optimization
Hi-index | 0.00 |