A New Approach to Cactus Construction Applied to TSP Support Graphs. - Klaus Michael Wenger (IPCO, 2002)

Maximally Violated Mod-p Cuts for the Capacitated Vehicle-Routing Problem. - Gerhard Reinelt; Klaus Michael Wenger (INFORMS J. Comput., 2006)

Computing finest mincut partitions of a graph and application to routing problems. - Gerhard Reinelt; Dirk Oliver Theis; Klaus Michael Wenger (Discret. Appl. Math., 2008)

Generating partitions of a graph into a fixed number of minimum weight cuts. - Gerhard Reinelt; Klaus Michael Wenger (Discret. Optim., 2010)

Computing compatible tours for the symmetric traveling salesman problem. - Matteo Fortini; Adam N. Letchford; Andrea Lodi 001; Klaus Michael Wenger (Math. Program. Comput., 2011)