Maintaining the 3-edge-connected components of a graph on-line
SIAM Journal on Computing
Augmenting undirected connectivity in RNC and in randomized Õ(n3) time
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The connectivity carcass of a vertex subset in a graph and its incremental maintenance
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A representation for crossing set families with applications to submodular flow problems
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
The 3-Edge-Components and a Structural Description of All 3-Edge-Cuts in a Graph
WG '92 Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science
Incremental Maintenance of the 5-Edge-Connectivity Classes of a Graph
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract)
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Planarity of the 2-Level Cactus Model
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
How to draw the minimum cuts of a planar graph
Computational Geometry: Theory and Applications
Approximating connectivity augmentation problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Phylogenetic graph models beyond trees
Discrete Applied Mathematics
| Hi-index | 0.00 |