A New Approach to Cactus Construction Applied to TSP Support Graphs
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
On the Number of Minimum Cuts in a Graph
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract)
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
A fast algorithm for computing steiner edge connectivity
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Characterizing the flow equivalent trees of a network
Discrete Applied Mathematics
A linear algorithm for the Hamiltonian completion number of the line graph of a cactus
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Network failure detection and graph connectivity
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
How to draw the minimum cuts of a planar graph
Computational Geometry: Theory and Applications
Complexity of the directed spanning cactus problem
Discrete Applied Mathematics
Maximally Violated Mod-p Cuts for the Capacitated Vehicle-Routing Problem
INFORMS Journal on Computing
Computing finest mincut partitions of a graph and application to routing problems
Discrete Applied Mathematics
Efficient Algorithms for the k Smallest Cuts Enumeration
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Phylogenetic graph models beyond trees
Discrete Applied Mathematics
Complexity of the directed spanning cactus problem
Discrete Applied Mathematics
Discrete Applied Mathematics
Generating partitions of a graph into a fixed number of minimum weight cuts
Discrete Optimization
Spanning cactus of a graph: Existence, extension, optimization, and approximation
Discrete Applied Mathematics
An overview of algorithms for network survivability
ISRN Communications and Networking
| Hi-index | 0.00 |