default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Jünger
Person information
- affiliation: University of Cologne, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j55]Greta Fischer, Jean Gutt, Michael Jünger:
Algorithmic Symplectic Packing. Exp. Math. 33(2): 175-192 (2024)- [c52]Alexander Dobler, Michael Jünger, Paul J. Jünger, Julian Meffert, Petra Mutzel, Martin Nöllenburg:
Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings. GD 2024: 31:1-31:19 - [c51]Michael Jünger, Paul J. Jünger, Petra Mutzel, Gerhard Reinelt:
PACE Solver Description: Exact Solution of the One-Sided Crossing Minimization Problem by the MPPEG Team. IPEC 2024: 27:1-27:4 - [i7]Alexander Dobler, Michael Jünger, Paul J. Jünger, Julian Meffert, Petra Mutzel, Martin Nöllenburg:
Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings. CoRR abs/2409.02858 (2024) - 2022
- [j54]Martin Grötschel, Michael Jünger, Gerhard Reinelt:
Comments on "An Exact Method for the Minimum Feedback Arc Set Problem". ACM J. Exp. Algorithmics 27: 1.3:1-1.3:4 (2022) - [c50]Jonas Charfreitag
, Michael Jünger, Sven Mallach, Petra Mutzel:
McSparse: Exact Solutions of Sparse Maximum Cut and Sparse Unconstrained Binary Quadratic Optimization Problems. ALENEX 2022: 54-66 - 2021
- [j53]Michael Jünger, Sven Mallach:
Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization. INFORMS J. Comput. 33(4): 1419-1430 (2021) - [j52]Michael Jünger, Elisabeth Lobe, Petra Mutzel, Gerhard Reinelt, Franz Rendl, Giovanni Rinaldi, Tobias Stollenwerk:
Quantum Annealing versus Digital Computing: An Experimental Comparison. ACM J. Exp. Algorithmics 26: 1.9:1-1.9:30 (2021)
2010 – 2019
- 2019
- [j51]Michael Jünger, Petra Mutzel, Christiane Spisla:
A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width. J. Graph Algorithms Appl. 23(3): 499-524 (2019) - [c49]Michael Jünger, Sven Mallach:
Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization. ESA 2019: 63:1-63:13 - [i6]Michael Jünger, Elisabeth Lobe, Petra Mutzel, Gerhard Reinelt, Franz Rendl, Giovanni Rinaldi, Tobias Stollenwerk:
Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs. CoRR abs/1904.11965 (2019) - 2018
- [j50]Michael Jünger, Petra Mutzel, Christiane Spisla:
More Compact Orthogonal Drawings by Allowing Additional Bends †. Inf. 9(7): 153 (2018) - [c48]Michael Jünger, Petra Mutzel, Christiane Spisla:
A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width. GD 2018: 187-199 - [c47]Michael Jünger, Petra Mutzel, Christiane Spisla:
Orthogonal Compaction using Additional Bends. VISIGRAPP (3: IVAPP) 2018: 144-155 - [i5]Michael Jünger, Petra Mutzel, Christiane Spisla:
A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width. CoRR abs/1806.06617 (2018) - 2017
- [i4]Michael Jünger, Petra Mutzel, Christiane Spisla:
Orthogonal Compaction Using Additional Bends. CoRR abs/1706.06514 (2017) - 2016
- [j49]Michael Jünger, Sven Mallach:
An integer programming approach to optimal basic block instruction scheduling for single-issue processors. Discret. Optim. 22: 37-65 (2016) - [j48]Valentina Cacchiani, Michael Jünger, Frauke Liers, Andrea Lodi, Daniel R. Schmidt:
Single-commodity robust network design with finite and Hose demand sets. Math. Program. 157(1): 297-342 (2016) - [c46]Martin Gronemann, Michael Jünger, Frauke Liers, Francesco Mambelli:
Crossing Minimization in Storyline Visualization. GD 2016: 367-381 - [i3]Martin Gronemann, Michael Jünger, Frauke Liers, Francesco Mambelli:
Crossing Minimization in Storyline Visualization. CoRR abs/1608.08027 (2016) - 2015
- [c45]Dustin Feld, Thomas Soddemann, Michael Jünger, Sven Mallach:
Hardware-Aware Automatic Code-Transformation to Support Compilers in Exploiting the Multi-Level Parallel Potential of Modern CPUs. COSMIC@CGO 2015: 2:1-2:10 - 2014
- [j47]Thorsten Bonato, Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi:
Lifting and separation procedures for the cut polytope. Math. Program. 146(1-2): 351-378 (2014) - 2013
- [j46]Martin Gronemann, Carsten Gutwenger, Michael Jünger, Petra Mutzel:
Algorithm Engineering im Graphenzeichnen. Inform. Spektrum 36(2): 162-173 (2013) - [c44]Martin Gronemann, Michael Jünger, Nils M. Kriege, Petra Mutzel:
MolMap - Visualizing Molecule Libraries as Topographic Maps. GRAPP/IVAPP 2013: 515-524 - [c43]Michael Jünger, Sven Mallach:
Solving the simple offset assignment problem as a traveling salesman. M-SCOPES 2013: 31-39 - [c42]Martin Gronemann, Michael Jünger, Nils M. Kriege, Petra Mutzel:
The Landscape Metaphor for Visualization of Molecular Similarities. VISIGRAPP (Selected Papers) 2013: 85-100 - [r2]Christoph Buchheim, Markus Chimani, Carsten Gutwenger, Michael Jünger, Petra Mutzel:
Crossings and Planarization. Handbook of Graph Drawing and Visualization 2013: 43-85 - [r1]Markus Chimani, Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Karsten Klein, Petra Mutzel:
The Open Graph Drawing Framework (OGDF). Handbook of Graph Drawing and Visualization 2013: 543-569 - 2012
- [c41]Martin Gronemann, Michael Jünger:
Drawing Clustered Graphs as Topographic Maps. GD 2012: 426-438 - [c40]Eduardo Álvarez-Miranda, Valentina Cacchiani, Tim Dorneth, Michael Jünger, Frauke Liers, Andrea Lodi, Tiziano Parriani, Daniel R. Schmidt:
Models and Algorithms for Robust Network Design with Several Traffic Scenarios. ISCO 2012: 261-272 - 2011
- [j45]J. Joseph Fowler, Michael Jünger, Stephen G. Kobourov, Michael Schulz:
Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges. Comput. Geom. 44(8): 385-398 (2011) - [j44]Markus Chimani, Philipp Hungerländer, Michael Jünger, Petra Mutzel:
An SDP approach to multi-level crossing minimization. ACM J. Exp. Algorithmics 17(1) (2011) - [c39]Markus Chimani, Philipp Hungerländer, Michael Jünger, Petra Mutzel:
An SDP Approach to Multi-level Crossing Minimization. ALENEX 2011: 116-126 - 2010
- [j43]Michael Jünger, Thomas M. Liebling, Denis Naddef, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey:
Traces of the XII Aussois Workshop on Combinatorial Optimization. Math. Program. 124(1-2): 1-6 (2010) - [c38]Immanuel M. Bomze, Markus Chimani, Michael Jünger, Ivana Ljubic, Petra Mutzel, Bernd Zey:
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut. ISAAC (1) 2010: 427-439 - [e7]Michael Jünger, Thomas M. Liebling, Denis Naddef, George L. Nemhauser, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey:
50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art. Springer 2010, ISBN 978-3-540-68274-5 [contents]
2000 – 2009
- 2009
- [j42]Michael Jünger, Michael Schulz:
Intersection Graphs in Simultaneous Embedding with Fixed Edges. J. Graph Algorithms Appl. 13(2): 205-218 (2009) - 2008
- [j41]Christoph Buchheim, Markus Chimani, Dietmar Ebner, Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher:
A branch-and-cut approach to the crossing number problem. Discret. Optim. 5(2): 373-388 (2008) - [j40]J. Joseph Fowler, Michael Jünger, Stephen G. Kobourov, Michael Schulz:
Characterizing Simultaneous Embedding with Fixed Edges. Electron. Notes Discret. Math. 31: 41-44 (2008) - [c37]Markus Chimani, Michael Jünger, Michael Schulz:
Crossing Minimization meets Simultaneous Drawing. PacificVis 2008: 33-40 - [c36]J. Joseph Fowler, Carsten Gutwenger, Michael Jünger, Petra Mutzel, Michael Schulz:
An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges. GD 2008: 157-168 - [c35]J. Joseph Fowler, Michael Jünger, Stephen G. Kobourov, Michael Schulz:
Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges. WG 2008: 146-158 - 2007
- [j39]Stefan Hachul, Michael Jünger:
Large-Graph Layout Algorithms at Work: An Experimental Study. J. Graph Algorithms Appl. 11(2): 345-369 (2007) - [j38]Michael Jünger, Volker Kaibel:
Foreword: Special issue on IPCO 2005. Math. Program. 110(1): 1-2 (2007) - [c34]Alejandro Estrella-Balderrama, Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz:
Simultaneous Geometric Graph Embeddings. GD 2007: 280-290 - [c33]Markus Behle, Michael Jünger, Frauke Liers:
A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem. WEA 2007: 379-392 - 2006
- [j37]Christoph Buchheim, Michael Jünger, Sebastian Leipert:
Drawing rooted trees in linear time. Softw. Pract. Exp. 36(6): 651-665 (2006) - [c32]Christoph Buchheim, Michael Jünger, Annette Menze, Merijam Percan:
Bimodal Crossing Minimization. COCOON 2006: 497-506 - [c31]Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz:
Simultaneous Graph Embeddings with Fixed Edges. WG 2006: 325-335 - [e6]Michael Jünger, Stephen G. Kobourov, Petra Mutzel:
Graph Drawing, 8.-13. May 2005. Dagstuhl Seminar Proceedings 05191, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - 2005
- [j36]Christoph Buchheim, Michael Jünger:
Linear optimization over permutation groups. Discret. Optim. 2(4): 308-319 (2005) - [c30]Christoph Buchheim, Dietmar Ebner, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher:
Exact Crossing Minimization. GD 2005: 37-48 - [c29]Stefan Hachul, Michael Jünger:
An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs. GD 2005: 235-250 - [e5]Michael Jünger, Volker Kaibel:
Integer Programming and Combinatorial Optimization, 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings. Lecture Notes in Computer Science 3509, Springer 2005, ISBN 3-540-26199-0 [contents] - [i2]Michael Jünger, Stephen G. Kobourov, Petra Mutzel:
05191 Executive Summary - Graph Drawing. Graph Drawing 2005 - [i1]Michael Jünger, Petra Mutzel, Stephen G. Kobourov:
05191 Abstracts Collection - Graph Drawing. Graph Drawing 2005 - 2004
- [j35]Thorsten Akkerman, Christoph Buchheim, Michael Jünger, Daniel Teske:
On the complexity of drawing trees nicely: corrigendum. Acta Informatica 40(8): 603-607 (2004) - [j34]Markus Eiglsperger, Carsten Gutwenger, Michael Kaufmann, Joachim Kupke, Michael Jünger, Sebastian Leipert, Karsten Klein, Petra Mutzel, Martin Siebenhaller:
Automatic layout of UML class diagrams in orthogonal style. Inf. Vis. 3(3): 189-208 (2004) - [j33]Wilhelm Barth, Petra Mutzel, Michael Jünger:
Simple and Efficient Bilayer Cross Counting. J. Graph Algorithms Appl. 8(2): 179-194 (2004) - [c28]Stefan Hachul, Michael Jünger:
Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm. GD 2004: 285-295 - [p5]Petra Mutzel, Michael Jünger:
Graph Drawing: Exact Optimization Helps! The Sharpest Cut 2004: 327-352 - [p4]Michael Jünger, Petra Mutzel:
Introduction. Graph Drawing Software 2004: 1-7 - [p3]Michael Jünger, Petra Mutzel:
Technical Foundations. Graph Drawing Software 2004: 9-53 - [p2]Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher:
AGD - A Library of Algorithms for Graph Drawing. Graph Drawing Software 2004: 149-172 - [p1]Carsten Gutwenger, Michael Jünger, Karsten Klein, Joachim Kupke, Sebastian Leipert, Petra Mutzel:
A Diagramming Software for UML Class Diagrams. Graph Drawing Software 2004: 257-278 - [e4]Michael Jünger, Petra Mutzel:
Graph Drawing Software. Springer 2004, ISBN 978-3-642-62214-4 [contents] - 2003
- [j32]Petra Mutzel, Michael Jünger:
Guest Editors' Foreword. J. Graph Algorithms Appl. 7(4): 307-309 (2003) - [j31]Christoph Buchheim, Michael Jünger:
Detecting symmetries by branch & cut. Math. Program. 98(1-3): 369-384 (2003) - [j30]Matthias Elf, Michael Jünger, Giovanni Rinaldi:
Minimizing breaks by maximizing cuts. Oper. Res. Lett. 31(3): 343-349 (2003) - [c27]Christoph Buchheim, Michael Jünger:
An Integer Programming Approach to Fuzzy Symmetry Detection. GD 2003: 166-177 - [c26]Carsten Gutwenger, Michael Jünger, Karsten Klein, Joachim Kupke, Sebastian Leipert, Petra Mutzel:
A New Approach for Visualizing UML Class Diagrams. SOFTVIS 2003: 179-188 - [c25]Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher:
Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract). WG 2003: 261-272 - [e3]Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi:
Combinatorial Optimization - Eureka, You Shrink!, Papers Dedicated to Jack Edmonds, 5th International Workshop, Aussois, France, March 5-9, 2001, Revised Papers. Lecture Notes in Computer Science 2570, Springer 2003, ISBN 3-540-00580-3 [contents] - 2002
- [j29]Michael Jünger, Sebastian Leipert:
Level Planar Embedding in Linear Time. J. Graph Algorithms Appl. 6(1): 67-113 (2002) - [j28]Michael Jünger, Rüdiger Schultz, Robert Weismantel:
Preface. Math. Methods Oper. Res. 56(1): 1-2 (2002) - [c24]Ernst Althaus, Alexander Bockmayr, Matthias Elf, Michael Jünger, Thomas Kasper, Kurt Mehlhorn:
SCIL - Symbolic Constraints in Integer Linear Programming. ESA 2002: 75-87 - [c23]Wilhelm Barth, Michael Jünger, Petra Mutzel:
Simple and Efficient Bilayer Cross Counting. GD 2002: 130-141 - [c22]Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher:
Advances in C-Planarity Testing of Clustered Graphs. GD 2002: 220-235 - [c21]Christoph Buchheim, Michael Jünger, Sebastian Leipert:
Improving Walker's Algorithm to Run in Linear Time. GD 2002: 344-353 - [e2]Petra Mutzel, Michael Jünger, Sebastian Leipert:
Graph Drawing, 9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers. Lecture Notes in Computer Science 2265, Springer 2002, ISBN 3-540-43309-0 [contents] - 2001
- [j27]Michael Jünger, Volker Kaibel:
The QAP-polytope and the star transformation. Discret. Appl. Math. 111(3): 283-306 (2001) - [j26]Michael Jünger, Volker Kaibel:
Box-inequalities for quadratic assignment polytopes. Math. Program. 91(1): 175-197 (2001) - [c20]Matthias Elf, Carsten Gutwenger, Michael Jünger, Giovanni Rinaldi:
Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS. Computational Combinatorial Optimization 2001: 157-222 - [c19]Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Sebastian Leipert, Petra Mutzel:
Graph Drawing Algorithm Engineering with AGD. Software Visualization 2001: 307-323 - [c18]Christoph Buchheim, Michael Jünger:
Detecting Symmetries by Branch & Cut. GD 2001: 178-188 - [c17]Carsten Gutwenger, Michael Jünger, Karsten Klein, Joachim Kupke, Sebastian Leipert, Petra Mutzel:
Caesar Automatic Layout of UML Class Diagrams. GD 2001: 461-462 - [c16]Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Sebastian Leipert, Petra Mutzel, René Weiskircher:
AGD: A Library of Algorithms for Graph Drawing. GD 2001: 473-474 - [e1]Michael Jünger, Denis Naddef:
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School, Schloß Dagstuhl, Germany, 15-19 May 2000]. Lecture Notes in Computer Science 2241, Springer 2001, ISBN 3-540-42877-1 [contents] - 2000
- [j25]Michael Jünger, Giovanni Rinaldi, Stefan Thienel:
Practical Performance of Efficient Minimum Cut Algorithms. Algorithmica 26(1): 172-195 (2000) - [j24]Norbert Ascheuer, Michael Jünger, Gerhard Reinelt:
A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints. Comput. Optim. Appl. 17(1): 61-84 (2000) - [j23]Michael Jünger, Volker Kaibel:
On the SQAP-Polytope. SIAM J. Optim. 11(2): 444-463 (2000) - [j22]Michael Jünger, Stefan Thienel:
The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization. Softw. Pract. Exp. 30(11): 1325-1352 (2000) - [c15]Christoph Buchheim, Michael Jünger, Sebastian Leipert:
A Fast Layout Algorithm for k-Level Graphs. GD 2000: 229-240
1990 – 1999
- 1999
- [c14]Michael Jünger, Sebastian Leipert:
Level Planar Embedding in Linear Time. GD 1999: 72-81 - [c13]Franz-Josef Brandenburg, Michael Jünger, Joe Marks, Petra Mutzel, Falk Schreiber:
Graph-Drawing Contest Report. GD 1999: 400-409 - 1998
- [j21]Michael Jünger, Petra Mutzel, Thomas Odenthal, Mark Scharbrodt:
The thickness of a minor-excluded class of graphs. Discret. Math. 182(1-3): 169-176 (1998) - [j20]Michael Jünger, Stefan Thienel:
Introduction to ABACUS - a branch-and-cut system. Oper. Res. Lett. 22(2-3): 83-95 (1998) - [j19]Michael Jünger, Sebastian Leipert, Petra Mutzel:
A note on computing a maximal planar subgraph using PQ-trees. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 17(7): 609-612 (1998) - [c12]Michael Jünger, Sebastian Leipert, Petra Mutzel:
Level Planarity Testing in Linear Time. GD 1998: 224-237 - [c11]Petra Mutzel, Carsten Gutwenger, Ralf Brockenauer, Sergej Fialko, Gunnar W. Klau, Michael Krüger, Thomas Ziegler, Stefan Näher, David Alberts, Dirk Ambras, Gunter Koch, Michael Jünger, Christoph Buchheim, Sebastian Leipert:
A Library of Algorithms for Graph Drawing. GD 1998: 456-457 - 1997
- [j18]Caterina De Simone, Michael Jünger:
On the Two-connected Planar Spanning Subgraph Polytope. Discret. Appl. Math. 80(2-3): 223-229 (1997) - [j17]Franz-Josef Brandenburg, Michael Jünger, Petra Mutzel:
Algorithmen zum automatischen Zeichnen von Graphen. Inform. Spektrum 20(4): 199-207 (1997) - [j16]Thomas Christof, Michael Jünger, John D. Kececioglu, Petra Mutzel, Gerhard Reinelt:
A Branch-and-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes. J. Comput. Biol. 4(4): 433-447 (1997) - [j15]Michael Jünger, Petra Mutzel:
2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms. J. Graph Algorithms Appl. 1(1): 1-25 (1997) - [c10]Michael Jünger, Eva K. Lee, Petra Mutzel, Thomas Odenthal:
A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem. GD 1997: 13-24 - [c9]Michael Jünger, Sebastian Leipert, Petra Mutzel:
Pitfalls of Using PQ-Trees in Automatic Graph Drawing. GD 1997: 193-204 - [c8]Franz-Josef Brandenburg, Michael Jünger, Petra Mutzel, Thomas Lengauer:
Algorithmen zum automatischen Zeichnen von Graphen im Rahmen des DFG-Schwerpunkts Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen. GI Jahrestagung 1997: 58-67 - [c7]Thomas Christof, Michael Jünger, John D. Kececioglu, Petra Mutzel, Gerhard Reinelt:
A branch-and-cut approach to physical mapping with end-probes. RECOMB 1997: 84-92 - [c6]Michael Jünger, Giovanni Rinaldi, Stefan Thienel:
Practical Performance of Efficient Minimum Cut Algorithms. WAE 1997: 42-53 - 1996
- [j14]Michael Jünger, Petra Mutzel:
Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools. Algorithmica 16(1): 33-59 (1996) - 1995
- [j13]Michael Jünger, William R. Pulleyblank:
New Primal and Dual Matching Heuristics. Algorithmica 13(4): 357-386 (1995) - [c5]Michael Jünger, Petra Mutzel:
Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization. GD 1995: 337-348 - 1994
- [j12]Michael Jünger, Stefan Thienel, Gerhard Reinelt:
Provably good solutions for the traveling salesman problem. Math. Methods Oper. Res. 40(2): 183-217 (1994) - [j11]Michael Jünger, Alexander Martin, Gerhard Reinelt, Robert Weismantel:
Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits. Math. Program. 63: 257-279 (1994) - [c4]Michael Jünger, Petra Mutzel:
The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems. GD 1994: 119-130 - 1993
- [c3]Michael Jünger, Gerhard Reinelt, Stefan Thienel:
Practical problem solving with cutting plane algorithms in combinatorialoptimization. Combinatorial Optimization 1993: 111-152 - [c2]Michael Jünger, Petra Mutzel:
Solving the maximum weight planar subgraph. IPCO 1993: 479-492 - 1991
- [j10]Michael Jünger, Gerhard Reinelt, Doris Zepf:
Computing correct Delaunay triangulations. Computing 47(1): 43-49 (1991) - [j9]Martin Grötschel, Michael Jünger, Gerhard Reinelt:
Optimal control of plotting and drilling machines: A case study. ZOR Methods Model. Oper. Res. 35(1): 61-84 (1991) - [j8]Thomas Christof, Michael Jünger, Gerhard Reinelt:
A complete description of the traveling salesman polytope on 8 nodes. Oper. Res. Lett. 10(9): 497-500 (1991) - 1990
- [c1]Karl Heinz Borgwardt, Norbert Gaffke, Michael Jünger, Gerhard Reinelt:
Computing the Convex Hull in the Euclidean Plane in Linear Expected Time. Applied Geometry And Discrete Mathematics 1990: 91-108
1980 – 1989
- 1989
- [j7]Francisco Barahona, Michael Jünger, Gerhard Reinelt:
Experiments in quadratic 0-1 programming. Math. Program. 44(1-3): 127-137 (1989) - 1988
- [j6]Francisco Barahona, Martin Grötschel, Michael Jünger, Gerhard Reinelt:
An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design. Oper. Res. 36(3): 493-513 (1988) - 1987
- [j5]Reinhardt Euler, Michael Jünger, Gerhard Reinelt:
Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra. Math. Oper. Res. 12(3): 451-462 (1987) - 1985
- [b1]Michael Jünger:
Polyhedral combinatorics and the acyclic subdigraph problem. University of Augsburg, Germany, Heldermann 1985, ISBN 978-3-88538-207-2, pp. 1-128 - [j4]Michael Jünger, Gerhard Reinelt, William R. Pulleyblank:
On partitioning the edges of graphs into connected subgraphs. J. Graph Theory 9(4): 539-549 (1985) - [j3]Martin Grötschel, Michael Jünger, Gerhard Reinelt:
On the acyclic subgraph polytope. Math. Program. 33(1): 28-42 (1985) - [j2]Martin Grötschel, Michael Jünger, Gerhard Reinelt:
Facets of the linear ordering polytope. Math. Program. 33(1): 43-60 (1985) - 1984
- [j1]Martin Grötschel, Michael Jünger, Gerhard Reinelt:
A Cutting Plane Algorithm for the Linear Ordering Problem. Oper. Res. 32(6): 1195-1220 (1984)
Coauthor Index
[c52] [c51] [i7] [c50] [j52] [j51] [i6] [j50] [c48] [c47] [i5] [i4] [j46] [c44] [c42] [r2] [r1] [j44] [c39] [c38] [j41] [c36] [e6] [c30] [i2] [i1] [j34] [j33] [p5] [p4] [p3] [p2] [p1] [e4] [j32] [c26] [c25] [c23] [c22] [e2] [c19] [c17] [c16] [c13] [j21] [j19] [c12] [c11] [j17] [j16] [j15] [c10] [c9] [c8] [c7] [j14] [c5] [c4] [c2]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-08 02:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
