| 2026 | ALENEX | A Customized SAT-based Solver for Graph Coloring. | Timo Brand, Daniel Faber, Stephan Held, Petra Mutzel |
| 2026 | ESA | Bicriteria Polygon Aggregation with Arbitrary Shapes. | Lotte Blank, David Eppstein, Jan-Henrik Haunert, Herman J. Haverkort, Benedikt Kolbe, Philip Mayer, Petra Mutzel, Alexander Naumann, Jonas Sauer |
| 2026 | ESA | Strong ILP Formulations for the p-Regions Problem. | Daniel Faber, Jan-Henrik Haunert, Petra Mutzel |
| 2026 | ESA | Optimality-Preserving Data Reduction for Maximum k-Cut. | Michael Kaibel, Petra Mutzel |
| 2025 | ALENEX | A Simpler Approach for Monotone Parametric Minimum Cut: Finding the Breakpoints in Order. | Arne Beines, Michael Kaibel, Philip Mayer, Petra Mutzel, Jonas Sauer |
| 2024 | GD | Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings. | Alexander Dobler, Michael Jnger, Paul J. Jnger, Julian Meffert, Petra Mutzel, Martin Nllenburg |
| 2024 | SAT | SAT Encoding of Partial Ordering Models for Graph Coloring Problems. | Daniel Faber, Adalat Jabrayilov, Petra Mutzel |
| 2023 | KDD | A Higher-Order Temporal H-Index for Evolving Networks. | Lutz Oettershagen, Nils M. Kriege, Petra Mutzel |
| 2023 | SDM | A Temporal Graphlet Kernel For Classifying Dissemination in Evolving Networks. | Lutz Oettershagen, Nils M. Kriege, Claude Jordan, Petra Mutzel |
| 2023 | SDM | An Index For Temporal Closeness Computation in Evolving Graphs. | Lutz Oettershagen, Petra Mutzel |
| 2022 | ALENEX | McSparse: Exact Solutions of Sparse Maximum Cut and Sparse Unconstrained Binary Quadratic Optimization Problems. | Jonas Charfreitag, Michael Jnger, Sven Mallach, Petra Mutzel |
| 2022 | ICDM | TGLib: An Open-Source Library for Temporal Graph Analysis. | Lutz Oettershagen, Petra Mutzel |
| 2022 | WWW | Temporal Walk Centrality: Ranking Nodes in Evolving Networks. | Lutz Oettershagen, Petra Mutzel, Nils M. Kriege |
| 2020 | ALENEX | Shrinking Trees not Blossoms: A Recursive Maximum Matching Approach. | Andre Droschinsky, Petra Mutzel, Erik Thordsen |
| 2020 | ICDM | Efficient Top-k Temporal Closeness Calculation in Temporal Networks. | Lutz Oettershagen, Petra Mutzel |
| 2020 | SDM | Temporal Graph Kernels for Classifying Dissemination Processes. | Lutz Oettershagen, Nils M. Kriege, Christopher Morris, Petra Mutzel |
| 2019 | ALENEX | A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints. | Adalat Jabrayilov, Petra Mutzel |
| 2019 | STACS | Algorithmic Data Science (Invited Talk). | Petra Mutzel |
| 2019 | SISAP | Protein Complex Similarity Based on Weisfeiler-Lehman Labeling. | Bianca K. Stcker, Till Schfer, Petra Mutzel, Johannes Kster, Nils M. Kriege, Sven Rahmann |
| 2019 | TAMC | On the Enumeration of Bicriteria Temporal Paths. | Petra Mutzel, Lutz Oettershagen |
| 2018 | GD | A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width. | Michael Jnger, Petra Mutzel, Christiane Spisla |
| 2018 | IWOCA | A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs. | Christine Dahn, Nils M. Kriege, Petra Mutzel |
| 2018 | IWOCA | The Crossing Number of Seq-Shellable Drawings of Complete Graphs. | Petra Mutzel, Lutz Oettershagen |
| 2018 | LATIN | New Integer Linear Programming Models for the Vertex Coloring Problem. | Adalat Jabrayilov, Petra Mutzel |
| 2018 | MFCS | Largest Weight Common Subtree Embeddings with Distance Penalties. | Andre Droschinsky, Nils M. Kriege, Petra Mutzel |
| 2018 | SDM | Recognizing Cuneiform Signs Using Graph Based Methods. | Nils M. Kriege, Matthias Fey, Denis Fisseler, Petra Mutzel, Frank Weichert |
| 2017 | ADMA | StruClus: Scalable Structural Graph Set Clustering with Representative Sampling. | Till Schfer, Petra Mutzel |
| 2017 | ICDM | Glocalized Weisfeiler-Lehman Graph Kernels: Global-Local Feature Maps of Graphs. | Christopher Morris, Kristian Kersting, Petra Mutzel |
| 2017 | ISAAC | Crossing Number for Graphs with Bounded~Pathwidth. | Therese Biedl, Markus Chimani, Martin Derka, Petra Mutzel |
| 2017 | SOFSEM | Finding Largest Common Substructures of Molecules in Quadratic Time. | Andre Droschinsky, Nils M. Kriege, Petra Mutzel |
| 2017 | WALCOM | Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem. | Fritz Bkler, Petra Mutzel |
| 2016 | GD | Compact Layered Drawings of General Directed Graphs. | Adalat Jabrayilov, Sven Mallach, Petra Mutzel, Ulf Regg, Reinhard von Hanxleden |
| 2016 | ICDM | Faster Kernels for Graphs with Continuous Attributes via Hashing. | Christopher Morris, Nils M. Kriege, Kristian Kersting, Petra Mutzel |
| 2016 | ISAAC | A Sidetrack-Based Algorithm for Finding the k Shortest Simple Paths in a Directed Graph. | Denis Kurz, Petra Mutzel |
| 2016 | MFCS | Faster Algorithms for the Maximum Common Subtree Isomorphism Problem. | Andre Droschinsky, Nils M. Kriege, Petra Mutzel |
| 2015 | ESA | Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems. | Fritz Bkler, Petra Mutzel |
| 2014 | ALENEX | Practical Experience with Hanani-Tutte for Testing c-Planarity. | Carsten Gutwenger, Petra Mutzel, Marcus Schaefer |
| 2014 | DIAGRAMS | Examining the Compactness of Automatically Generated Layouts for Practical Diagrams. | Carsten Gutwenger, Ulf Regg, Miro Spnemann, Reinhard von Hanxleden, Petra Mutzel |
| 2014 | GD | Drawing Partially Embedded and Simultaneously Planar Graphs. | Timothy M. Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer |
| 2014 | ICDM | Explicit Versus Implicit Graph Feature Maps: A Computational Phase Transition for Walk Kernels. | Nils M. Kriege, Marion Neumann, Kristian Kersting, Petra Mutzel |
| 2014 | ISAAC | Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay. | Andre Droschinsky, Bernhard Heinemann, Nils M. Kriege, Petra Mutzel |
| 2014 | IWOCA | On Maximum Common Subgraph Problems in Series-Parallel Graphs. | Nils M. Kriege, Florian Kurpicz, Petra Mutzel |
| 2014 | MFCS | Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs. | Nils M. Kriege, Petra Mutzel |
| 2014 | WALCOM | SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search. | Nils M. Kriege, Petra Mutzel, Till Schfer |
| 2013 | CPAIOR | The Rooted Maximum Node-Weight Connected Subgraph Problem. | Eduardo lvarez-Miranda, Ivana Ljubic, Petra Mutzel |
| 2012 | ICML | Subgraph Matching Kernels for Attributed Graphs. | Nils M. Kriege, Petra Mutzel |
| 2011 | ALENEX | An SDP Approach to Multi-level Crossing Minimization. | Markus Chimani, Philipp Hungerlnder, Michael Jnger, Petra Mutzel |
| 2011 | ICDE | CT-index: Fingerprint-based graph indexing combining cycles and trees. | Karsten Klein, Nils M. Kriege, Petra Mutzel |
| 2011 | IWOCA | Improved Steiner Tree Algorithms for Bounded Treewidth. | Markus Chimani, Petra Mutzel, Bernd Zey |
| 2010 | GD | An Experimental Evaluation of Multilevel Layout Methods. | Gereon Bartel, Carsten Gutwenger, Karsten Klein, Petra Mutzel |
| 2010 | GD | Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints. | Markus Chimani, Carsten Gutwenger, Petra Mutzel, Miro Spnemann, Hoi-Ming Wong |
| 2010 | ISAAC | Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut. | Immanuel M. Bomze, Markus Chimani, Michael Jnger, Ivana Ljubic, Petra Mutzel, Bernd Zey |
| 2009 | COCOON | On the Hardness and Approximability of Planar Biconnectivity Augmentation. | Carsten Gutwenger, Petra Mutzel, Bernd Zey |
| 2009 | GD | On Open Problems in Biological Network Visualization. | Mario Albrecht, Andreas Kerren, Karsten Klein, Oliver Kohlbacher, Petra Mutzel, Wolfgang Paul, Falk Schreiber, Michael Wybrow |
| 2009 | GD | Upward Planarization Layout. | Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong |
| 2009 | GD | Scaffold Hunter - Interactive Exploration of Chemical Space. | Karsten Klein, Nils M. Kriege, Petra Mutzel, Herbert Waldmann, Stefan Wetzel |
| 2009 | GD | Port Constraints in Hierarchical Layout of Data Flow Diagrams. | Miro Spnemann, Hauke Fuhrmann, Reinhard von Hanxleden, Petra Mutzel |
| 2009 | IWOCA | Planar Biconnectivity Augmentation with Fixed Embedding. | Carsten Gutwenger, Petra Mutzel, Bernd Zey |
| 2009 | SODA | Inserting a vertex into a planar graph. | Markus Chimani, Carsten Gutwenger, Petra Mutzel, Christian Wolf |
| 2008 | ALENEX | Obtaining Optimal k-Cardinality Trees Fast. | Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel |
| 2008 | COCOA | Strong Formulations for 2-Node-Connected Steiner Network Problems. | Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel |
| 2008 | ESA | A New Approach to Exact Crossing Minimization. | Markus Chimani, Petra Mutzel, Immanuel M. Bomze |
| 2008 | GD | Computing Maximum C-Planar Subgraphs. | Markus Chimani, Carsten Gutwenger, Mathias Jansen, Karsten Klein, Petra Mutzel |
| 2008 | GD | Approximating the Crossing Number of Apex Graphs. | Markus Chimani, Petr Hlinen, Petra Mutzel |
| 2008 | GD | An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges. | J. Joseph Fowler, Carsten Gutwenger, Michael Jnger, Petra Mutzel, Michael Schulz |
| 2007 | COCOON | Colored Simultaneous Geometric Embeddings. | 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 |
| 2007 | ESA | A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks. | Markus Chimani, Maria Kandyba, Petra Mutzel |
| 2007 | GD | Efficient Extraction of Multiple Kuratowski Subdivisions. | Markus Chimani, Petra Mutzel, Jens M. Schmidt |
| 2006 | GD | A New Approximation Algorithm for Bend Minimization in the Kandinsky Model. | Wilhelm Barth, Petra Mutzel, Canan Yildiz |
| 2006 | GD | Planarity Testing and Optimal Edge Insertion with Embedding Constraints. | Carsten Gutwenger, Karsten Klein, Petra Mutzel |
| 2005 | ALENEX | Solving the Prize-Collecting Steiner Tree Problem to Optimality. | Ivana Ljubic, Ren Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti |
| 2005 | GD | Exact Crossing Minimization. | Christoph Buchheim, Dietmar Ebner, Michael Jnger, Gunnar W. Klau, Petra Mutzel, Ren Weiskircher |
| 2005 | SOFSEM | Recent Advances in Graph Drawing. | Petra Mutzel |
| 2004 | GECCO | Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem. | Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra Mutzel, Philipp Neuner, Ulrich Pferschy, Gnther R. Raidl, Ren Weiskircher |
| 2003 | ESA | The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract. | Gunnar W. Klau, Ivana Ljubic, Petra Mutzel, Ulrich Pferschy, Ren Weiskircher |
| 2003 | GD | Selected Open Problems in Graph Drawing. | Franz-Josef Brandenburg, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel |
| 2003 | GD | An Experimental Study of Crossing Minimization Heuristics. | Carsten Gutwenger, Petra Mutzel |
| 2003 | GD | Graph Embedding with Minimum Depth and Maximum External Face. | Carsten Gutwenger, Petra Mutzel |
| 2003 | ICALP | The SPQR-Tree Data Structure in Graph Drawing. | Petra Mutzel |
| 2003 | WG | Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract). | Carsten Gutwenger, Michael Jnger, Sebastian Leipert, Petra Mutzel, Merijam Percan, Ren Weiskircher |
| 2002 | COCOON | Bend Minimization in Orthogonal Drawings Using Integer Programming. | Petra Mutzel, Ren Weiskircher |
| 2002 | GD | Simple and Efficient Bilayer Cross Counting. | Wilhelm Barth, Michael Jnger, Petra Mutzel |
| 2002 | GD | Advances in C-Planarity Testing of Clustered Graphs. | Carsten Gutwenger, Michael Jnger, Sebastian Leipert, Petra Mutzel, Merijam Percan, Ren Weiskircher |
| 2001 | GD | Caesar Automatic Layout of UML Class Diagrams. | Carsten Gutwenger, Michael Jnger, Karsten Klein, Joachim Kupke, Sebastian Leipert, Petra Mutzel |
| 2001 | GD | AGD: A Library of Algorithms for Graph Drawing. | Carsten Gutwenger, Michael Jnger, Gunnar W. Klau, Sebastian Leipert, Petra Mutzel, Ren Weiskircher |
| 2001 | SODA | Inserting an edge into a planar graph. | Carsten Gutwenger, Petra Mutzel, Ren Weiskircher |
| 2000 | COCOON | Optimal Labelling of Point Features in the Slider Model. | Gunnar W. Klau, Petra Mutzel |
| 2000 | COCOON | Computing Optimal Embeddings for Planar Graphs. | Petra Mutzel, Ren Weiskircher |
| 2000 | GD | A Linear Time Implementation of SPQR-Trees. | Carsten Gutwenger, Petra Mutzel |
| 2000 | GD | An Experimental Comparison of Orthogonal Compaction Algorithms (Extended Abstract). | Gunnar W. Klau, Karsten Klein, Petra Mutzel |
| 1999 | GD | Graph-Drawing Contest Report. | Franz-Josef Brandenburg, Michael Jnger, Joe Marks, Petra Mutzel, Falk Schreiber |
| 1999 | GD | Combining Graph Labeling and Compaction. | Gunnar W. Klau, Petra Mutzel |
| 1999 | GD | The Constrained Crossing Minimization Problem. | Petra Mutzel, Thomas Ziegler |
| 1999 | GI | Optimieren ber alle kombinatorischen Einbettungen eines planaren Graphen. | Petra Mutzel, Ren Weiskircher |
| 1999 | IPCO | Optimal Compaction of Orthogonal Grid Drawings. | Gunnar W. Klau, Petra Mutzel |
| 1999 | IPCO | Optimizing over All Combinatorial Embeddings of a Planar Graph. | Petra Mutzel, Ren Weiskircher |
| 1998 | GD | Graph-Drawing Contest Report. | Peter Eades, Joe Marks, Petra Mutzel, Stephen C. North |
| 1998 | GD | Planar Polyline Drawings with Good Angular Resolution. | Carsten Gutwenger, Petra Mutzel |
| 1998 | GD | Level Planarity Testing in Linear Time. | Michael Jnger, Sebastian Leipert, Petra Mutzel |
| 1998 | GD | A Library of Algorithms for Graph Drawing. | Petra Mutzel, Carsten Gutwenger, Ralf Brockenauer, Sergej Fialko, Gunnar W. Klau, Michael Krger, Thomas Ziegler, Stefan Nher, David Alberts, Dirk Ambras, Gunter Koch, Michael Jnger, Christoph Buchheim, Sebastian Leipert |
| 1998 | ISAAC | Two-Layer Planarization in Graph Drawing. | Petra Mutzel, Ren Weiskircher |
| 1998 | SODA | A New Approximation Algorithm for the Planar Augmentation Problem. | Sergej Fialko, Petra Mutzel |
| 1998 | WG | Drawing Planar Partitions II: HH-Drawings. | Therese Biedl, Michael Kaufmann, Petra Mutzel |
| 1997 | GD | ArchE: A Graph Drawing System for Archaeology. | Christoph Hundack, Petra Mutzel, Igor Pouchkarev, Stefan Thome |
| 1997 | GD | Pitfalls of Using PQ-Trees in Automatic Graph Drawing. | Michael Jnger, Sebastian Leipert, Petra Mutzel |
| 1997 | GD | A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem. | Michael Jnger, Eva K. Lee, Petra Mutzel, Thomas Odenthal |
| 1997 | GI | Algorithmen zum automatischen Zeichnen von Graphen im Rahmen des DFG-Schwerpunkts Effiziente Algorithmen fr diskrete Probleme und ihre Anwendungen. | Franz-Josef Brandenburg, Michael Jnger, Petra Mutzel, Thomas Lengauer |
| 1997 | RECOMB | A branch-and-cut approach to physical mapping with end-probes. | Thomas Christof, Michael Jnger, John D. Kececioglu, Petra Mutzel, Gerhard Reinelt |
| 1997 | RECOMB | A branch-and-cut algorithm for multiple sequence alignment. | Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kurt Mehlhorn, John D. Kececioglu |
| 1996 | GD | An Alternative Method to Crossing Minimization on Hierarchical Graphs. | Petra Mutzel |
| 1995 | ESA | A Polyhedral Approach to Planar Augmentation and Related Problems. | Petra Mutzel |
| 1995 | GD | Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization. | Michael Jnger, Petra Mutzel |
| 1994 | GD | The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems. | Michael Jnger, Petra Mutzel |
| 1993 | IPCO | Solving the maximum weight planar subgraph. | Michael Jnger, Petra Mutzel |