On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Packing Cycles and Cuts in Undirected Graphs
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
An excluded minor characterization of seymour graphs
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
| Hi-index | 0.00 |