Michael Jünger
Michael Jünger
Verified email at informatik.uni-koeln.de
Title
Cited by
Cited by
Year
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
4931988
The traveling salesman problem
M Jünger, G Reinelt, G Rinaldi
Handbooks in operations research and management science 7, 225-330, 1995
4321995
A cutting plane algorithm for the linear ordering problem
M Grötschel, M Jünger, G Reinelt
Operations research 32 (6), 1195-1220, 1984
4261984
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
3852009
Drawing large graphs with a potential-field-based multilevel algorithm
S Hachul, M Jünger
International Symposium on Graph Drawing, 285-295, 2004
3142004
2-layer straightline crossing minimization: Performance of exact and heuristic algorithms
M Jünger, P Mutzel
Graph Algorithms And Applications I, 3-27, 2002
2782002
Graph drawing software
M Jünger, P Mutzel
Springer Science & Business Media, 2012
2542012
Experiments in quadratic 0–1 programming
F Barahona, M Jünger, G Reinelt
Mathematical Programming 44 (1), 127-137, 1989
2421989
Facets of the linear ordering polytope
M Grötschel, M Jünger, G Reinelt
Mathematical programming 33 (1), 43-60, 1985
2201985
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
1741995
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
1582000
An experimental comparison of fast algorithms for drawing general large graphs
S Hachul, M Jünger
International Symposium on Graph Drawing, 235-250, 2005
1482005
On the acyclic subgraph polytope
M Grötschel, M Jünger, G Reinelt
Mathematical Programming 33 (1), 28-42, 1985
1441985
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
1372013
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
1372000
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
1371996
Maximum planar subgraphs and nice embeddings: Practical layout tools
M Jünger, P Mutzel
Algorithmica 16 (1), 33-59, 1996
1251996
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
1062003
Level planarity testing in linear time
M Jünger, S Leipert, P Mutzel
International Symposium on Graph Drawing, 224-237, 1998
981998
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 50 (47-68), 6, 2004
972004
The system can't perform the operation now. Try again later.
Articles 1–20