A complete description of the traveling salesman polytope on 8 nodes. - Thomas Christof; Michael Jünger; Gerhard Reinelt (Oper. Res. Lett., 1991)

A branch-and-cut approach to physical mapping with end-probes. - Thomas Christof; Michael Jünger; John D. Kececioglu; Petra Mutzel; Gerhard Reinelt (RECOMB, 1997)

A Branch-and-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes. - Thomas Christof; Michael Jünger; John D. Kececioglu; Petra Mutzel; Gerhard Reinelt (J. Comput. Biol., 1997)

Consecutive Ones and a Betweenness Problem in Computational Biology. - Thomas Christof; Marcus Oswald; Gerhard Reinelt (IPCO, 1998)

Computing physical maps of chromosomes with nonoverlapping probes by branch-and-cut. - Thomas Christof; John D. Kececioglu (RECOMB, 1999)

Algorithmic Aspects of Using Small Instance Relaxations in Parallel Branch-and-Cut. - Thomas Christof; Gerhard Reinelt (Algorithmica, 2001)

Decomposition and Parallelization Techniques for Enumerating the Facets of Combinatorial Polytopes. - Thomas Christof; Gerhard Reinelt (Int. J. Comput. Geom. Appl., 2001)