Journal of Experimental Algorithmics (JEA)
Approximation algorithms for minimum-cost k-vertex connected subgraphs
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Independence Free Graphs and Vertex Connectivity Augmentation
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Edge Covers of Setpairs and the Iterative Rounding Method
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Near Optimal Algorithm for Vertex Connectivity Augmentation
ISAAC '00 Proceedings of the 11th International Conference 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
Dilworth's Theorem and Its Application for Path Systems of a Cycle - Implementation and Analysis
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
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
Restricted t-matchings in bipartite graphs
Discrete Applied Mathematics - Submodularity
Adding and Reversing Arcs in Semicomplete Digraphs
Combinatorics, Probability and Computing
Approximation algorithm for k-node connected subgraphs via critical graphs
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
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
Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
Journal of Computer and System Sciences - Special issue on FOCS 2001
On shredders and vertex connectivity augmentation
Journal of Discrete Algorithms
Primal-dual approach for directed vertex connectivity augmentation and generalizations
ACM Transactions on Algorithms (TALG)
An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Network design for vertex connectivity
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Tight approximation algorithm for connectivity augmentation problems
Journal of Computer and System Sciences
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
An almost O(log k)-approximation for k-connected subgraphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Inapproximability of survivable networks
Theoretical Computer Science
A Weighted kt, t-Free t-Factor Algorithm for Bipartite Graphs
Mathematics of Operations Research
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)
Note: Local edge-connectivity augmentation in hypergraphs is NP-complete
Discrete Applied Mathematics
A weighted Kt, t-free t-factor algorithm for bipartite graphs
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
Jump number of two-directional orthogonal ray graphs
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Testing Eulerianity and connectivity in directed sparse graphs
Theoretical Computer Science
Tight approximation algorithm for connectivity augmentation problems
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
An algorithm for (n-3)-connectivity augmentation problem: Jump system approach
Journal of Combinatorial Theory Series B
Restricted b-matchings in degree-bounded graphs
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Approximating subset k-connectivity problems
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
An algorithm to increase the node-connectivity of a digraph by one
Discrete Optimization
Approximating minimum-cost connectivity problems via uncrossable bifamilies
ACM Transactions on Algorithms (TALG)
Approximating subset k-connectivity problems
Journal of Discrete Algorithms
A novel data structure for biconnectivity, triconnectivity, and k-tree augmentation
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
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 |