2009 | ||
---|---|---|
91 | Carsten Gutwenger, Petra Mutzel, Bernd Zey: On the Hardness and Approximability of Planar Biconnectivity Augmentation. COCOON 2009: 249-257 | |
90 | Petra Mutzel: The Crossing Number of Graphs: Theory and Computation. Efficient Algorithms 2009: 305-317 | |
89 | Carsten Gutwenger, Petra Mutzel, Bernd Zey: Planar Biconnectivity Augmentation with Fixed Embedding. IWOCA 2009: 289-300 | |
88 | Markus Chimani, Carsten Gutwenger, Petra Mutzel, Christian Wolf: Inserting a vertex into a planar graph. SODA 2009: 375-383 | |
87 | Petra Mutzel: Optimization in Leveled Graphs. Encyclopedia of Optimization 2009: 2813-2820 | |
86 | Katharina Podwojski, Arno Fritsch, Daniel C. Chamrad, Wolfgang Paul, Barbara Sitek, Kai Stühler, Petra Mutzel, Christian Stephan, Helmut E. Meyer, Wolfgang Urfer, Katja Ickstadt, Jörg Rahnenführer: Retention time alignment algorithms for LC/MS data must consider non-linear shifts. Bioinformatics 25(6): 758-764 (2009) | |
2008 | ||
85 | Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel: Obtaining Optimal k-Cardinality Trees Fast. ALENEX 2008: 27-36 | |
84 | Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel: Strong Formulations for 2-Node-Connected Steiner Network Problems. COCOA 2008: 190-200 | |
83 | Markus Chimani, Petra Mutzel, Immanuel M. Bomze: A New Approach to Exact Crossing Minimization. ESA 2008: 284-296 | |
82 | Markus Chimani, Carsten Gutwenger, Mathias Jansen, Karsten Klein, Petra Mutzel: Computing Maximum C-Planar Subgraphs. Graph Drawing 2008: 114-120 | |
81 | 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. Graph Drawing 2008: 157-168 | |
80 | Markus Chimani, Petr Hlinený, Petra Mutzel: Approximating the Crossing Number of Apex Graphs. Graph Drawing 2008: 432-434 | |
79 | Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong: Layer-Free Upward Crossing Minimization. WEA 2008: 55-68 | |
78 | 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. Discrete Optimization 5(2): 373-388 (2008) | |
77 | Petra Mutzel: Recent Advances in Exact Crossing Minimization (Extended Abstract). Electronic Notes in Discrete Mathematics 31: 33-36 (2008) | |
76 | Carsten Gutwenger, Karsten Klein, Petra Mutzel: Planarity Testing and Optimal Edge Insertion with Embedding Constraints. J. Graph Algorithms Appl. 12(1): 73-95 (2008) | |
75 | Dorothea Emig, Melissa S. Cline, Karsten Klein, Anne Kunert, Petra Mutzel, Thomas Lengauer, Mario Albrecht: Integrative Visual Analysis of the Effects of Alternative Splicing on Protein Domain Interaction Networks. J. Integrative Bioinformatics 5(2): (2008) | |
2007 | ||
74 | Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis: Colored Simultaneous Geometric Embeddings. COCOON 2007: 254-263 | |
73 | Markus Chimani, Maria Kandyba, Petra Mutzel: A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks. ESA 2007: 681-692 | |
72 | Markus Chimani, Petra Mutzel, Jens M. Schmidt: Efficient Extraction of Multiple Kuratowski Subdivisions. Graph Drawing 2007: 159-170 | |
71 | Markus Chimani, Carsten Gutwenger, Petra Mutzel: On the Minimum Cut of Planarizations. Electronic Notes in Discrete Mathematics 28: 177-184 (2007) | |
2006 | ||
70 | Michael Jünger, Stephen G. Kobourov, Petra Mutzel: Graph Drawing, 8.-13. May 2005 Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 | |
69 | Carsten Gutwenger, Karsten Klein, Petra Mutzel: Planarity Testing and Optimal Edge Insertion with Embedding Constraints. Graph Drawing 2006: 126-137 | |
68 | Wilhelm Barth, Petra Mutzel, Canan Yildiz: A New Approximation Algorithm for Bend Minimization in the Kandinsky Model. Graph Drawing 2006: 343-354 | |
67 | Daniel Wagner, Günther R. Raidl, Ulrich Pferschy, Petra Mutzel, Peter Bachhiesl: A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks. OR 2006: 197-202 | |
66 | Markus Chimani, Carsten Gutwenger, Petra Mutzel: Experiments on Exact Crossing Minimization Using Column Generation. WEA 2006: 303-315 | |
65 | Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti: An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem. Math. Program. 105(2-3): 427-449 (2006) | |
2005 | ||
64 | Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti: Solving the Prize-Collecting Steiner Tree Problem to Optimality. ALENEX/ANALCO 2005: 68-76 | |
63 | Stefan Hetzl, Petra Mutzel: A Graph-Theoretic Approach to Steganography. Communications and Multimedia Security 2005: 119-128 | |
62 | Michael Jünger, Petra Mutzel, Stephen G. Kobourov: 05191 Abstracts Collection - Graph Drawing. Graph Drawing 2005 | |
61 | Michael Jünger, Stephen G. Kobourov, Petra Mutzel: 05191 Executive Summary - Graph Drawing. Graph Drawing 2005 | |
60 | Christoph Buchheim, Dietmar Ebner, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher: Exact Crossing Minimization. Graph Drawing 2005: 37-48 | |
59 | Petra Mutzel: Recent Advances in Graph Drawing. SOFSEM 2005: 41 | |
58 | Carsten Gutwenger, Petra Mutzel, René Weiskircher: Inserting an Edge into a Planar Graph. Algorithmica 41(4): 289-308 (2005) | |
2004 | ||
57 | Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra Mutzel, Philipp Neuner, Ulrich Pferschy, Günther R. Raidl, René Weiskircher: Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem. GECCO (1) 2004: 1304-1315 | |
56 | 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. Information Visualization 3(3): 189-208 (2004) | |
55 | Wilhelm Barth, Petra Mutzel, Michael Jünger: Simple and Efficient Bilayer Cross Counting. J. Graph Algorithms Appl. 8(2): 179-194 (2004) | |
2003 | ||
54 | Gunnar W. Klau, Ivana Ljubic, Petra Mutzel, Ulrich Pferschy, René Weiskircher: The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract. ESA 2003: 691-702 | |
53 | Carsten Gutwenger, Petra Mutzel: An Experimental Study of Crossing Minimization Heuristics. Graph Drawing 2003: 13-24 | |
52 | Carsten Gutwenger, Petra Mutzel: Graph Embedding with Minimum Depth and Maximum External Face. Graph Drawing 2003: 259-272 | |
51 | Franz-Josef Brandenburg, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel: Selected Open Problems in Graph Drawing. Graph Drawing 2003: 515-539 | |
50 | Petra Mutzel: The SPQR-Tree Data Structure in Graph Drawing. ICALP 2003: 34-46 | |
49 | 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, 217-218 | |
48 | Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher: Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract). WG 2003: 261-272 | |
47 | Petra Mutzel, Michael Jünger: Guest Editors' Foreword. J. Graph Algorithms Appl. 7(4): 307-309 (2003) | |
2002 | ||
46 | Petra Mutzel, Michael Jünger, Sebastian Leipert: Graph Drawing, 9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers Springer 2002 | |
45 | Petra Mutzel, René Weiskircher: Bend Minimization in Orthogonal Drawings Using Integer Programming. COCOON 2002: 484-493 | |
44 | Wilhelm Barth, Michael Jünger, Petra Mutzel: Simple and Efficient Bilayer Cross Counting. Graph Drawing 2002: 130-141 | |
43 | Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher: Advances in C-Planarity Testing of Clustered Graphs. Graph Drawing 2002: 220-235 | |
2001 | ||
42 | Carsten Gutwenger, Michael Jünger, Karsten Klein, Joachim Kupke, Sebastian Leipert, Petra Mutzel: Caesar Automatic Layout of UML Class Diagrams. Graph Drawing 2001: 461-462 | |
41 | Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Sebastian Leipert, Petra Mutzel, René Weiskircher: AGD: A Library of Algorithms for Graph Drawing. Graph Drawing 2001: 473-474 | |
40 | Carsten Gutwenger, Petra Mutzel, René Weiskircher: Inserting an edge into a planar graph. SODA 2001: 246-255 | |
39 | Petra Mutzel, Peter Eades: Graphs in Software Visualization - Introduction. Software Visualization 2001: 285-294 | |
38 | Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Sebastian Leipert, Petra Mutzel: Graph Drawing Algorithm Engineering with AGD. Software Visualization 2001: 307-323 | |
2000 | ||
37 | Gunnar W. Klau, Petra Mutzel: Optimal Labelling of Point Features in the Slider Model. COCOON 2000: 340-350 | |
36 | Petra Mutzel, René Weiskircher: Computing Optimal Embeddings for Planar Graphs. COCOON 2000: 95-104 | |
35 | Gunnar W. Klau, Karsten Klein, Petra Mutzel: An Experimental Comparison of Orthogonal Compaction Algorithms (Extended Abstract). Graph Drawing 2000: 37-51 | |
34 | Carsten Gutwenger, Petra Mutzel: A Linear Time Implementation of SPQR-Trees. Graph Drawing 2000: 77-90 | |
33 | John D. Kececioglu, Hans-Peter Lenhof, Kurt Mehlhorn, Petra Mutzel, Knut Reinert, Martin Vingron: A polyhedral approach to sequence alignment problems. Discrete Applied Mathematics 104(1-3): 143-186 (2000) | |
1999 | ||
32 | Petra Mutzel, René Weiskircher: Optimieren über alle kombinatorischen Einbettungen eines planaren Graphen. GI Jahrestagung 1999: 199-206 | |
31 | Petra Mutzel, Thomas Ziegler: The Constrained Crossing Minimization Problem. Graph Drawing 1999: 175-185 | |
30 | Gunnar W. Klau, Petra Mutzel: Combining Graph Labeling and Compaction. Graph Drawing 1999: 27-37 | |
29 | Franz-Josef Brandenburg, Michael Jünger, Joe Marks, Petra Mutzel, Falk Schreiber: Graph-Drawing Contest Report. Graph Drawing 1999: 400-409 | |
28 | Gunnar W. Klau, Petra Mutzel: Optimal Compaction of Orthogonal Grid Drawings. IPCO 1999: 304-319 | |
27 | Petra Mutzel, René Weiskircher: Optimizing over All Combinatorial Embeddings of a Planar Graph. IPCO 1999: 361-376 | |
26 | Giuseppe Di Battista, Petra Mutzel: Guest Editors' Introduction. J. Graph Algorithms Appl. 3(4): 1-2 (1999) | |
1998 | ||
25 | Carsten Gutwenger, Petra Mutzel: Planar Polyline Drawings with Good Angular Resolution. Graph Drawing 1998: 167-182 | |
24 | Michael Jünger, Sebastian Leipert, Petra Mutzel: Level Planarity Testing in Linear Time. Graph Drawing 1998: 224-237 | |
23 | Peter Eades, Joe Marks, Petra Mutzel, Stephen C. North: Graph-Drawing Contest Report. Graph Drawing 1998: 423-435 | |
22 | 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. Graph Drawing 1998: 456-457 | |
21 | Petra Mutzel, René Weiskircher: Two-Layer Planarization in Graph Drawing. ISAAC 1998: 69-78 | |
20 | Sergej Fialko, Petra Mutzel: A New Approximation Algorithm for the Planar Augmentation Problem. SODA 1998: 260-269 | |
19 | Therese C. Biedl, Michael Kaufmann, Petra Mutzel: Drawing Planar Partitions II: HH-Drawings. WG 1998: 124-136 | |
18 | Michael Jünger, Petra Mutzel, Thomas Odenthal, Mark Scharbrodt: The thickness of a minor-excluded class of graphs. Discrete Mathematics 182(1-3): 169-176 (1998) | |
17 | Michael Jünger, Sebastian Leipert, Petra Mutzel: A note on computing a maximal planar subgraph using PQ-trees. IEEE Trans. on CAD of Integrated Circuits and Systems 17(7): 609-612 (1998) | |
1997 | ||
16 | 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 | |
15 | Michael Jünger, Eva K. Lee, Petra Mutzel, Thomas Odenthal: A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem. Graph Drawing 1997: 13-24 | |
14 | Michael Jünger, Sebastian Leipert, Petra Mutzel: Pitfalls of Using PQ-Trees in Automatic Graph Drawing. Graph Drawing 1997: 193-204 | |
13 | Christoph Hundack, Petra Mutzel, Igor Pouchkarev, Stefan Thome: ArchE: A Graph Drawing System for Archaeology. Graph Drawing 1997: 297-302 | |
12 | Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kurt Mehlhorn, John D. Kececioglu: A branch-and-cut algorithm for multiple sequence alignment. RECOMB 1997: 241-250 | |
11 | 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 | |
10 | Franz-Josef Brandenburg, Michael Jünger, Petra Mutzel: Algorithmen zum automatischen Zeichnen von Graphen. Informatik Spektrum 20(4): 199-207 (1997) | |
9 | Michael Jünger, Petra Mutzel: 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms. J. Graph Algorithms Appl. 1: (1997) | |
8 | 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. Journal of Computational Biology 4(4): 433-448 (1997) | |
1996 | ||
7 | Petra Mutzel: An Alternative Method to Crossing Minimization on Hierarchical Graphs. Graph Drawing 1996: 318-333 | |
6 | Michael Jünger, Petra Mutzel: Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools. Algorithmica 16(1): 33-59 (1996) | |
5 | Kurt Mehlhorn, Petra Mutzel: On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm. Algorithmica 16(2): 233-242 (1996) | |
1995 | ||
4 | Petra Mutzel: A Polyhedral Approach to Planar Augmentation and Related Problems. ESA 1995: 494-507 | |
3 | Michael Jünger, Petra Mutzel: Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization. Graph Drawing 1995: 337-348 | |
1994 | ||
2 | Michael Jünger, Petra Mutzel: The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems. Graph Drawing 1994: 119-130 | |
1993 | ||
1 | Michael Jünger, Petra Mutzel: Solving the maximum weight planar subgraph. IPCO 1993: 479-492 |