An application of combinatorial optimization to statistical physics and circuit layout design F Barahona, M Grötschel, M Jünger, G Reinelt Operations Research 36 (3), 493-513, 1988 | 546 | 1988 |

The traveling salesman problem M Jünger, G Reinelt, G Rinaldi Handbooks in operations research and management science 7, 225-330, 1995 | 529 | 1995 |

A cutting plane algorithm for the linear ordering problem M Grötschel, M Jünger, G Reinelt Operations research 32 (6), 1195-1220, 1984 | 454 | 1984 |

50 Years of integer programming 1958-2008: From the early years to the state-of-the-art M Jünger, TM Liebling, D Naddef, GL Nemhauser, WR Pulleyblank, ... Springer Science & Business Media, 2009 | 373 | 2009 |

Drawing large graphs with a potential-field-based multilevel algorithm S Hachul, M Jünger International Symposium on Graph Drawing, 285-295, 2004 | 329 | 2004 |

2-layer straightline crossing minimization: Performance of exact and heuristic algorithms M Jünger, P Mutzel Graph Algorithms And Applications I, 3-27, 2002 | 291 | 2002 |

Graph drawing software M Jünger, P Mutzel Springer Science & Business Media, 2012 | 271 | 2012 |

Experiments in quadratic 0–1 programming F Barahona, M Jünger, G Reinelt Mathematical programming 44 (1), 127-137, 1989 | 256 | 1989 |

Facets of the linear ordering polytope M Grötschel, M Jünger, G Reinelt Mathematical programming 33 (1), 43-60, 1985 | 232 | 1985 |

Exact ground states of Ising spin glasses: New experimental results with a branch-and-cut algorithm C De Simone, M Diehl, M Jünger, P Mutzel, G Reinelt, G Rinaldi Journal of Statistical Physics 80 (1), 487-496, 1995 | 195 | 1995 |

A branch & cut algorithm for the asymmetric traveling salesman problem with precedence constraints N Ascheuer, M Jünger, G Reinelt Computational Optimization and Applications 17 (1), 61-84, 2000 | 172 | 2000 |

The Open Graph Drawing Framework (OGDF). M Chimani, C Gutwenger, M Jünger, GW Klau, K Klein, P Mutzel Handbook of graph drawing and visualization 2011, 543-569, 2013 | 162 | 2013 |

Cutting Plane Algorithms M Jünger, G Reinelt, S Thienel Combinatorial Optimization: Papers from the DIMACS Special Year 20, 111, 1995 | 160 | 1995 |

On the acyclic subgraph polytope M Grötschel, M Jünger, G Reinelt Mathematical Programming 33 (1), 28-42, 1985 | 158 | 1985 |

An experimental comparison of fast algorithms for drawing general large graphs S Hachul, M Jünger International Symposium on Graph Drawing, 235-250, 2005 | 145 | 2005 |

The ABACUS system for branch‐and‐cut‐and‐price algorithms in integer programming and combinatorial optimization M Jünger, S Thienel Software: Practice and Experience 30 (11), 1325-1352, 2000 | 142 | 2000 |

The critical exponents of the two-dimensional Ising spin glass revisited: exact ground-state calculations and Monte Carlo simulations H Rieger, L Santen, U Blasum, M Diehl, M Jünger, G Rinaldi Journal of Physics A: Mathematical and General 29 (14), 3939, 1996 | 142 | 1996 |

Maximum planar subgraphs and nice embeddings: Practical layout tools M Jünger, P Mutzel Algorithmica 16 (1), 33-59, 1996 | 128 | 1996 |

A new approach for visualizing UML class diagrams C Gutwenger, M Jünger, K Klein, J Kupke, S Leipert, P Mutzel Proceedings of the 2003 ACM symposium on Software visualization, 179-188, 2003 | 118 | 2003 |

Computing exact ground states of hard Ising spin glass problems by branch‐and‐cut F Liers, M Jünger, G Reinelt, G Rinaldi New optimization algorithms in physics, 47-69, 2004 | 105 | 2004 |