![]() | ![]() |
2008 | ||
---|---|---|
2 | EE | Gerhard Reinelt, Dirk Oliver Theis, Klaus Michael Wenger: Computing finest mincut partitions of a graph and application to routing problems. Discrete Applied Mathematics 156(3): 385-396 (2008) |
2002 | ||
1 | EE | Klaus Michael Wenger: A New Approach to Cactus Construction Applied to TSP Support Graphs. IPCO 2002: 109-126 |
1 | Gerhard Reinelt | [2] |
2 | Dirk Oliver Theis | [2] |