Scheduling trams in the morning U Blasum, MR Bussieck, W Hochstättler, C Moll, HH Scheel, T Winter Mathematical Methods of Operations Research 49 (1), 137-148, 1999 | 113 | 1999 |

On the complexity of testing membership in the core of min-cost spanning tree games U Faigle, W Kern, SP Fekete, W Hochstättler International Journal of Game Theory 26 (3), 361-366, 1997 | 107 | 1997 |

Application of the branch and cut method to the vehicle routing problem U Blasum, W Hochstättler Zentrum für Angewandte Informatik Köln Technical Report zpr2000-386, 2000 | 87 | 2000 |

The simulated trading heuristic for solving vehicle routing problems A Bachem, W Hochstättler, M Malich Discrete Applied Mathematics 65 (1-3), 47-72, 1996 | 85 | 1996 |

On approximately fair cost allocation in Euclidean TSP games U Faigle, SP Fekete, W Hochstättler, W Kern Operations-Research-Spektrum 20 (1), 29-37, 1998 | 59 | 1998 |

Complexity results on a paint shop problem T Epping, W Hochstättler, P Oertel Discrete Applied Mathematics 136 (2-3), 217-226, 2004 | 58 | 2004 |

The nucleon of cooperative games and an algorithm for matching games U Faigle, W Kern, SP Fekete, W Hochstättler Mathematical Programming 83 (1), 195-211, 1998 | 56 | 1998 |

Generalized colourings (matrix partitions) of cographs T Feder, P Hell, W Hochstättler Graph theory in Paris, 149-167, 2006 | 48 | 2006 |

Online matching on a line B Fuchs, W Hochstättler, W Kern Theoretical Computer Science 332 (1-3), 251-264, 2005 | 47 | 2005 |

Note on the game chromatic index of trees PL Erdös, U Faigle, W Hochstättler, W Kern Theoretical Computer Science 313 (3), 371-376, 2004 | 41 | 2004 |

Generating convex polyominoes at random W Hochstättler, M Loebl, C Moll Discrete Mathematics 153 (1-3), 165-176, 1996 | 40 | 1996 |

Simulated trading: A new approach for solving vehicle routing problems A Bachem, W Hochstättler, M Malich Mathematisches Institut der Universität zu Köln, Germany, Report 92, 1992 | 38 | 1992 |

Complexity results on restricted instances of a paint shop problem for words P Bonsma, T Epping, W Hochstättler Discrete Applied Mathematics 154 (9), 1335-1343, 2006 | 35 | 2006 |

Perfect digraphs SD Andres, W Hochstättler Journal of Graph Theory 79 (1), 21-29, 2015 | 31 | 2015 |

Semicircle law for a matrix ensemble with dependent entries W Hochstättler, W Kirsch, S Warzel Journal of Theoretical Probability 29 (3), 1047-1068, 2016 | 27 | 2016 |

The complexity of an inverse shortest paths problem SP Fekete, W Hochstättler, S Kromberg, C Moll Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the …, 1998 | 22 | 1998 |

Using network-flow techniques to solve an optimization problem from surface-physics U Blasum, W Hochstättler, C Moll, H Rieger Journal of Physics A: Mathematical and General 29 (18), L459, 1996 | 20 | 1996 |

Hamiltonicity in graphs with fewP 4's W Hochstättler, G Tinhofer Computing 54 (3), 213-225, 1995 | 20 | 1995 |

Antisymmetric flows in matroids W Hochstättler, J Nešetřil European Journal of Combinatorics 27 (7), 1129-1134, 2006 | 18 | 2006 |

A flow theory for the dichromatic number W Hochstättler European Journal of Combinatorics 66, 160-167, 2017 | 17 | 2017 |