Graph connectivity and its augmentation: applications of MA orderings
Discrete Applied Mathematics
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Using expander graphs to find vertex connectivity
Journal of the ACM (JACM)
On shredders and vertex connectivity augmentation
Journal of Discrete Algorithms
Half integral packing, Erdős-Posá-property and graph minors
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
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
Optimal edge deletions for signed graph balancing
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Separator-based data reduction for signed graph balancing
Journal of Combinatorial Optimization
Decomposition, approximation, and coloring of odd-minor-free graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Testing 2-vertex connectivity and computing pairs of vertex-disjoint s-t paths in digraphs
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
The Balanced Decomposition Number and Vertex Connectivity
SIAM Journal on Discrete Mathematics
Practical partitioning-based methods for the steiner problem
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Distributed local 2-connectivity test of graphs and applications
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
An overview of algorithms for network survivability
ISRN Communications and Networking
Dynamic programming for graphs on surfaces
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |