Thomas Christof

According to our database, Thomas Christof authored at least 7 papers between 1991 and 2001.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2001

Decomposition and Parallelization Techniques for Enumerating the Facets of Combinatorial Polytopes.

Thomas Christof, Gerhard Reinelt

Int. J. Comput. Geom. Appl., 2001

Algorithmic Aspects of Using Small Instance Relaxations in Parallel Branch-and-Cut.

Thomas Christof, Gerhard Reinelt

Algorithmica, 2001

1999

Computing physical maps of chromosomes with nonoverlapping probes by branch-and-cut.

Thomas Christof, John D. Kececioglu

Proceedings of the Third Annual International Conference on Research in Computational Molecular Biology, 1999

1998

Consecutive Ones and a Betweenness Problem in Computational Biology.

Thomas Christof, Marcus Oswald, Gerhard Reinelt

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

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

A branch-and-cut approach to physical mapping with end-probes.

Thomas Christof, Michael Jünger, John D. Kececioglu, Petra Mutzel, Gerhard Reinelt

Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, 1997

1991

A complete description of the traveling salesman polytope on 8 nodes.

Thomas Christof, Michael Jünger, Gerhard Reinelt

Oper. Res. Lett., 1991