Solving the maximum weight planar subgraph. - Michael Jünger; Petra Mutzel (IPCO, 1993)

Book reviews. - M. Schäffter; Karsten Weihe; Petra Mutzel; Salah E. Elmaghraby (ZOR Methods Model. Oper. Res., 1993)

The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems. - Michael Jünger; Petra Mutzel (GD, 1994)

A Polyhedral Approach to Planar Augmentation and Related Problems. - Petra Mutzel (ESA, 1995)

Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization. - Michael Jünger; Petra Mutzel (GD, 1995)

Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools. - Michael Jünger; Petra Mutzel (Algorithmica, 1996)

On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm. - Kurt Mehlhorn; Petra Mutzel (Algorithmica, 1996)

ArchE: A Graph Drawing System for Archaeology. - Christoph Hundack; Petra Mutzel; Igor Pouchkarev; Stefan Thome (GD, 1997)

Pitfalls of Using PQ-Trees in Automatic Graph Drawing. - Michael Jünger; Sebastian Leipert; Petra Mutzel (GD, 1997)

A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem. - Michael Jünger; Eva K. Lee; Petra Mutzel; Thomas Odenthal (GD, 1997)

Algorithmen zum automatischen Zeichnen von Graphen im Rahmen des DFG-Schwerpunkts Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen. - Franz-Josef Brandenburg; Michael Jünger; Petra Mutzel; Thomas Lengauer (GI Jahrestagung, 1997)

A branch-and-cut approach to physical mapping with end-probes. - Thomas Christof; Michael Jünger; John D. Kececioglu; Petra Mutzel; Gerhard Reinelt (RECOMB, 1997)

A branch-and-cut algorithm for multiple sequence alignment. - Knut Reinert; Hans-Peter Lenhof; Petra Mutzel; Kurt Mehlhorn; John D. Kececioglu (RECOMB, 1997)

AGD-Library: A Library of Algorithms for Graph Drawing. - David Alberts; Carsten Gutwenger; Petra Mutzel; Stefan Näher (WAE, 1997)

Algorithmen zum automatischen Zeichnen von Graphen. - Franz-Josef Brandenburg; Michael Jünger; Petra Mutzel (Inform. Spektrum, 1997)

A Branch-and-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes. - Thomas Christof; Michael Jünger; John D. Kececioglu; Petra Mutzel; Gerhard Reinelt (J. Comput. Biol., 1997)

2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms. - Michael Jünger; Petra Mutzel (J. Graph Algorithms Appl., 1997)

Graph-Drawing Contest Report. - Peter Eades; Joe Marks; Petra Mutzel; Stephen C. North (GD, 1998)

Planar Polyline Drawings with Good Angular Resolution. - Carsten Gutwenger; Petra Mutzel (GD, 1998)

Level Planarity Testing in Linear Time. - Michael Jünger; Sebastian Leipert; Petra Mutzel (GD, 1998)

A Library of Algorithms for Graph Drawing. - Petra Mutzel; Carsten Gutwenger; Ralf Brockenauer; Sergej Fialko; Gunnar W. Klau; Michael Krüger; Thomas Ziegler 002; Stefan Näher; David Alberts; Dirk Ambras; Gunter Koch; Michael Jünger; et al. (GD, 1998)

Two-Layer Planarization in Graph Drawing. - Petra Mutzel; René Weiskircher (ISAAC, 1998)

A New Approximation Algorithm for the Planar Augmentation Problem. - Sergej Fialko; Petra Mutzel (SODA, 1998)

Drawing Planar Partitions II: HH-Drawings. - Therese Biedl; Michael Kaufmann 001; Petra Mutzel (WG, 1998)

The thickness of a minor-excluded class of graphs. - Michael Jünger; Petra Mutzel; Thomas Odenthal; Mark Scharbrodt (Discret. Math., 1998)

The Thickness of Graphs: A Survey. - Petra Mutzel; Thomas Odenthal; Mark Scharbrodt (Graphs Comb., 1998)

A note on computing a maximal planar subgraph using PQ-trees. - Michael Jünger; Sebastian Leipert; Petra Mutzel (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1998)

Graph Drawing Algorithms. - Peter Eades; Petra Mutzel (Algorithms and Theory of Computation Handbook, 1999)

Graph-Drawing Contest Report. - Franz-Josef Brandenburg; Michael Jünger; Joe Marks; Petra Mutzel; Falk Schreiber (GD, 1999)

Combining Graph Labeling and Compaction. - Gunnar W. Klau; Petra Mutzel (GD, 1999)

The Constrained Crossing Minimization Problem. - Petra Mutzel; Thomas Ziegler 002 (GD, 1999)

Optimieren über alle kombinatorischen Einbettungen eines planaren Graphen. - Petra Mutzel; René Weiskircher (GI Jahrestagung, 1999)

Optimal Compaction of Orthogonal Grid Drawings. - Gunnar W. Klau; Petra Mutzel (IPCO, 1999)

Optimizing over All Combinatorial Embeddings of a Planar Graph. - Petra Mutzel; René Weiskircher (IPCO, 1999)

Guest Editors' Introduction. - Giuseppe Di Battista; Petra Mutzel (J. Graph Algorithms Appl., 1999)

Optimal Labelling of Point Features in the Slider Model. - Gunnar W. Klau; Petra Mutzel (COCOON, 2000)

Computing Optimal Embeddings for Planar Graphs. - Petra Mutzel; René Weiskircher (COCOON, 2000)

A Linear Time Implementation of SPQR-Trees. - Carsten Gutwenger; Petra Mutzel (GD, 2000)

An Experimental Comparison of Orthogonal Compaction Algorithms (Extended Abstract). - Gunnar W. Klau; Karsten Klein 001; Petra Mutzel (GD, 2000)

A polyhedral approach to sequence alignment problems. - John D. Kececioglu; Hans-Peter Lenhof; Kurt Mehlhorn; Petra Mutzel; Knut Reinert; Martin Vingron (Discret. Appl. Math., 2000)

Graph Drawing Algorithm Engineering with AGD. - Carsten Gutwenger; Michael Jünger; Gunnar W. Klau; Sebastian Leipert; Petra Mutzel (Software Visualization, 2001)

Graphs in Software Visualization - Introduction. - Petra Mutzel; Peter Eades (Software Visualization, 2001)

Caesar Automatic Layout of UML Class Diagrams. - Carsten Gutwenger; Michael Jünger; Karsten Klein 001; Joachim Kupke 001; Sebastian Leipert; Petra Mutzel (GD, 2001)

AGD: A Library of Algorithms for Graph Drawing. - Carsten Gutwenger; Michael Jünger; Gunnar W. Klau; Sebastian Leipert; Petra Mutzel; René Weiskircher (GD, 2001)

An Alternative Method to Crossing Minimization on Hierarchical Graphs. - Petra Mutzel (SIAM J. Optim., 2001)

Bend Minimization in Orthogonal Drawings Using Integer Programming. - Petra Mutzel; René Weiskircher (COCOON, 2002)

Advances in C-Planarity Testing of Clustered Graphs. - Carsten Gutwenger; Michael Jünger; Sebastian Leipert; Petra Mutzel; Merijam Percan; René Weiskircher (GD, 2002)

The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract. - Gunnar W. Klau; Ivana Ljubic; Petra Mutzel; Ulrich Pferschy; René Weiskircher (ESA, 2003)

Selected Open Problems in Graph Drawing. - Franz-Josef Brandenburg; David Eppstein; Michael T. Goodrich; Stephen G. Kobourov; Giuseppe Liotta; Petra Mutzel (GD, 2003)

An Experimental Study of Crossing Minimization Heuristics. - Carsten Gutwenger; Petra Mutzel (GD, 2003)

Graph Embedding with Minimum Depth and Maximum External Face. - Carsten Gutwenger; Petra Mutzel (GD, 2003)

The SPQR-Tree Data Structure in Graph Drawing. - Petra Mutzel (ICALP, 2003)

A New Approach for Visualizing UML Class Diagrams. - Carsten Gutwenger; Michael Jünger; Karsten Klein 001; Joachim Kupke 001; Sebastian Leipert; Petra Mutzel (SOFTVIS, 2003)

Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract). - Carsten Gutwenger; Michael Jünger; Sebastian Leipert; Petra Mutzel; Merijam Percan; René Weiskircher (WG, 2003)

Guest Editors' Foreword. - Petra Mutzel; Michael Jünger (J. Graph Algorithms Appl., 2003)

Optimal labeling of point features in rectangular labeling models. - Gunnar W. Klau; Petra Mutzel (Math. Program., 2003)

Graph Drawing: Exact Optimization Helps! - Petra Mutzel; Michael Jünger (The Sharpest Cut, 2004)

A Diagramming Software for UML Class Diagrams. - Carsten Gutwenger; Michael Jünger; Karsten Klein 001; Joachim Kupke 001; Sebastian Leipert; Petra Mutzel (Graph Drawing Software, 2004)

AGD - A Library of Algorithms for Graph Drawing. - Michael Jünger; Gunnar W. Klau; Petra Mutzel; René Weiskircher (Graph Drawing Software, 2004)

Introduction. - Michael Jünger; Petra Mutzel (Graph Drawing Software, 2004)

Technical Foundations. - Michael Jünger; Petra Mutzel (Graph Drawing Software, 2004)

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; Günther R. Raidl; René Weiskircher (GECCO (1), 2004)

Automatic layout of UML class diagrams in orthogonal style. - Markus Eiglsperger; Carsten Gutwenger; Michael Kaufmann 001; Joachim Kupke 001; Michael Jünger; Sebastian Leipert; Karsten Klein 001; Petra Mutzel; Martin Siebenhaller (Inf. Vis., 2004)

Simple and Efficient Bilayer Cross Counting. - Wilhelm Barth; Petra Mutzel; Michael Jünger (J. Graph Algorithms Appl., 2004)

Solving the Prize-Collecting Steiner Tree Problem to Optimality. - Ivana Ljubic; René Weiskircher; Ulrich Pferschy; Gunnar W. Klau; Petra Mutzel; Matteo Fischetti (ALENEX/ANALCO, 2005)

A Graph-Theoretic Approach to Steganography. - Stefan Hetzl; Petra Mutzel (Communications and Multimedia Security, 2005)

05191 Executive Summary - Graph Drawing. - Michael Jünger; Stephen G. Kobourov; Petra Mutzel (Graph Drawing, 2005)

05191 Abstracts Collection - Graph Drawing. - Michael Jünger; Petra Mutzel; Stephen G. Kobourov (Graph Drawing, 2005)

Exact Crossing Minimization. - Christoph Buchheim; Dietmar Ebner; Michael Jünger; Gunnar W. Klau; Petra Mutzel; René Weiskircher (GD, 2005)

Recent Advances in Graph Drawing. - Petra Mutzel (SOFSEM, 2005)

Inserting an Edge into a Planar Graph. - Carsten Gutwenger; Petra Mutzel; René Weiskircher (Algorithmica, 2005)

A New Approximation Algorithm for Bend Minimization in the Kandinsky Model. - Wilhelm Barth; Petra Mutzel; Canan Yildiz (GD, 2006)

A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks. - Daniel Wagner; Günther R. Raidl; Ulrich Pferschy; Petra Mutzel; Peter Bachhiesl (OR, 2006)

An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem. - Ivana Ljubic; René Weiskircher; Ulrich Pferschy; Gunnar W. Klau; Petra Mutzel; Matteo Fischetti (Math. Program., 2006)

Bend Minimization in Planar Orthogonal Drawings Using Integer Programming. - Petra Mutzel; René Weiskircher (SIAM J. Optim., 2006)

Colored Simultaneous Geometric Embeddings. - Ulrik Brandes; Cesim Erten; J. Joseph Fowler; Fabrizio Frati; Markus Geyer; Carsten Gutwenger; Seok-Hee Hong 001; Michael Kaufmann 001; Stephen G. Kobourov; Giuseppe Liotta; Petra Mutzel; Antonios Symvonis (COCOON, 2007)

A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks. - Markus Chimani; Maria Kandyba; Petra Mutzel (ESA, 2007)

Efficient Extraction of Multiple Kuratowski Subdivisions. - Markus Chimani; Petra Mutzel; Jens M. Schmidt (GD, 2007)

On the Minimum Cut of Planarizations. - Markus Chimani; Carsten Gutwenger; Petra Mutzel (Electron. Notes Discret. Math., 2007)

Obtaining Optimal k-Cardinality Trees Fast. - Markus Chimani; Maria Kandyba; Ivana Ljubic; Petra Mutzel (ALENEX, 2008)

Strong Formulations for 2-Node-Connected Steiner Network Problems. - Markus Chimani; Maria Kandyba; Ivana Ljubic; Petra Mutzel (COCOA, 2008)

08191 Abstracts Collection - Graph Drawing with Applications to Bioinformatics and Social Sciences. - Stephen P. Borgatti; Stephen G. Kobourov; Oliver Kohlbacher; Petra Mutzel (Graph Drawing with Applications to Bioinformatics and Social Sciences, 2008)

08191 Executive Summary - Graph Drawing with Applications to Bioinformatics and Social Sciences. - Stephen P. Borgatti; Stephen G. Kobourov; Oliver Kohlbacher; Petra Mutzel (Graph Drawing with Applications to Bioinformatics and Social Sciences, 2008)

A New Approach to Exact Crossing Minimization. - Markus Chimani; Petra Mutzel; Immanuel M. Bomze (ESA, 2008)

Computing Maximum C-Planar Subgraphs. - Markus Chimani; Carsten Gutwenger; Mathias Jansen; Karsten Klein 001; Petra Mutzel (GD, 2008)

Approximating the Crossing Number of Apex Graphs. - Markus Chimani; Petr Hlinený; Petra Mutzel (GD, 2008)

An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges. - J. Joseph Fowler; Carsten Gutwenger; Michael Jünger; Petra Mutzel; Michael Schulz 001 (GD, 2008)

A branch-and-cut approach to the crossing number problem. - Christoph Buchheim; Markus Chimani; Dietmar Ebner; Carsten Gutwenger; Michael Jünger; Gunnar W. Klau; Petra Mutzel; René Weiskircher (Discret. Optim., 2008)

Recent Advances in Exact Crossing Minimization (Extended Abstract). - Petra Mutzel (Electron. Notes Discret. Math., 2008)

Planarity Testing and Optimal Edge Insertion with Embedding Constraints. - Carsten Gutwenger; Karsten Klein 001; Petra Mutzel (J. Graph Algorithms Appl., 2008)

Integrative Visual Analysis of the Effects of Alternative Splicing on Protein Domain Interaction Networks. - Dorothea Emig; Melissa S. Cline; Karsten Klein 001; Anne Kunert; Petra Mutzel; Thomas Lengauer; Mario Albrecht (J. Integr. Bioinform., 2008)

The Crossing Number of Graphs: Theory and Computation. - Petra Mutzel (Efficient Algorithms, 2009)

On the Hardness and Approximability of Planar Biconnectivity Augmentation. - Carsten Gutwenger; Petra Mutzel; Bernd Zey (COCOON, 2009)

On Open Problems in Biological Network Visualization. - Mario Albrecht; Andreas Kerren; Karsten Klein 001; Oliver Kohlbacher; Petra Mutzel; Wolfgang Paul 001; Falk Schreiber; Michael Wybrow (GD, 2009)

Scaffold Hunter - Interactive Exploration of Chemical Space. - Karsten Klein 001; Nils M. Kriege; Petra Mutzel; Herbert Waldmann; Stefan Wetzel (GD, 2009)

Port Constraints in Hierarchical Layout of Data Flow Diagrams. - Miro Spönemann; Hauke Fuhrmann; Reinhard von Hanxleden; Petra Mutzel (GD, 2009)

Planar Biconnectivity Augmentation with Fixed Embedding. - Carsten Gutwenger; Petra Mutzel; Bernd Zey (IWOCA, 2009)

Inserting a vertex into a planar graph. - Markus Chimani; Carsten Gutwenger; Petra Mutzel; Christian Wolf 004 (SODA, 2009)

Retention time alignment algorithms for LC/MS data must consider non-linear shifts. - Katharina Podwojski; Arno Fritsch; Daniel C. Chamrad; Wolfgang Paul 001; Barbara Sitek; Kai Stühler; Petra Mutzel; Christian Stephan; Helmut E. Meyer; Wolfgang Urfer; Katja Ickstadt; Jörg Rahnenführer (Bioinform., 2009)

Experiments on exact crossing minimization using column generation. - Markus Chimani; Carsten Gutwenger; Petra Mutzel (ACM J. Exp. Algorithmics, 2009)

Obtaining optimal k-cardinality trees fast. - Markus Chimani; Maria Kandyba; Ivana Ljubic; Petra Mutzel (ACM J. Exp. Algorithmics, 2009)

Optimization in Leveled Graphs. - Petra Mutzel (Encyclopedia of Optimization, 2009)

10261 Abstracts Collection - Algorithm Engineering. - Giuseppe F. Italiano; David S. Johnson 001; Petra Mutzel; Peter Sanders 001 (Algorithm Engineering, 2010)

10261 Executive Summary - Algorithm Engineering. - Giuseppe F. Italiano; David S. Johnson 001; Petra Mutzel; Peter Sanders 001 (Algorithm Engineering, 2010)

An Experimental Evaluation of Multilevel Layout Methods. - Gereon Bartel; Carsten Gutwenger; Karsten Klein 001; Petra Mutzel (GD, 2010)

Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints. - Markus Chimani; Carsten Gutwenger; Petra Mutzel; Miro Spönemann; Hoi-Ming Wong (GD, 2010)

Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut. - Immanuel M. Bomze; Markus Chimani; Michael Jünger; Ivana Ljubic; Petra Mutzel; Bernd Zey (ISAAC (1), 2010)

Layer-free upward crossing minimization. - Markus Chimani; Carsten Gutwenger; Petra Mutzel; Hoi-Ming Wong (ACM J. Exp. Algorithmics, 2010)

Orientation-based models for {0, 1, 2}-survivable network design: theory and practice. - Markus Chimani; Maria Kandyba; Ivana Ljubic; Petra Mutzel (Math. Program., 2010)

CT-index: Fingerprint-based graph indexing combining cycles and trees. - Karsten Klein 001; Nils M. Kriege; Petra Mutzel (ICDE, 2011)

Colored Simultaneous Geometric Embeddings and Universal Pointsets. - Ulrik Brandes; Cesim Erten; Alejandro Estrella-Balderrama; J. Joseph Fowler; Fabrizio Frati; Markus Geyer; Carsten Gutwenger; Seok-Hee Hong 001; Michael Kaufmann 001; Stephen G. Kobourov; Giuseppe Liotta; Petra Mutzel; et al. (Algorithmica, 2011)

Graph Drawing with Algorithm Engineering Methods (Dagstuhl Seminar 11191). - Camil Demetrescu; Michael Kaufmann 001; Stephen G. Kobourov; Petra Mutzel (Dagstuhl Reports, 2011)

An SDP approach to multi-level crossing minimization. - Markus Chimani; Philipp Hungerländer; Michael Jünger; Petra Mutzel (ACM J. Exp. Algorithmics, 2011)

Upward Planarization Layout. - Markus Chimani; Carsten Gutwenger; Petra Mutzel; Hoi-Ming Wong (J. Graph Algorithms Appl., 2011)

Scaffold Hunter - Visual Analysis of Chemical Compound Databases. - Karsten Klein 001; Nils M. Kriege; Petra Mutzel (GRAPP/IVAPP, 2012)

Subgraph Matching Kernels for Attributed Graphs. - Nils M. Kriege; Petra Mutzel (ICML, 2012)

Parameterized Algorithms for Stochastic Steiner Tree Problems. - Denis Kurz; Petra Mutzel; Bernd Zey (MEMICS, 2012)

Scaffold Hunter: Facilitating Drug Discovery by Visual Analysis of Chemical Space. - Karsten Klein 001; Nils M. Kriege; Petra Mutzel (VISIGRAPP (Selected Papers), 2012)

Vertex insertion approximates the crossing number of apex graphs. - Markus Chimani; Petr Hlinený; Petra Mutzel (Eur. J. Comb., 2012)

Improved Steiner tree algorithms for bounded treewidth. - Markus Chimani; Petra Mutzel; Bernd Zey (J. Discrete Algorithms, 2012)

The Rooted Maximum Node-Weight Connected Subgraph Problem. - Eduardo Álvarez-Miranda; Ivana Ljubic; Petra Mutzel (CPAIOR, 2013)

MolMap - Visualizing Molecule Libraries as Topographic Maps. - Martin Gronemann; Michael Jünger; Nils M. Kriege; Petra Mutzel (GRAPP/IVAPP, 2013)

The Landscape Metaphor for Visualization of Molecular Similarities. - Martin Gronemann; Michael Jünger; Nils M. Kriege; Petra Mutzel (VISIGRAPP (Selected Papers), 2013)

Stochastic Survivable Network Design Problems. - Ivana Ljubic; Petra Mutzel; Bernd Zey (Electron. Notes Discret. Math., 2013)

Algorithm Engineering im Graphenzeichnen. - Martin Gronemann; Carsten Gutwenger; Michael Jünger; Petra Mutzel (Inform. Spektrum, 2013)

Crossings and Planarization. - Christoph Buchheim; Markus Chimani; Carsten Gutwenger; Michael Jünger; Petra Mutzel (Handbook of Graph Drawing and Visualization, 2013)

The Open Graph Drawing Framework (OGDF). - Markus Chimani; Carsten Gutwenger; Michael Jünger; Gunnar W. Klau; Karsten Klein 001; Petra Mutzel (Handbook of Graph Drawing and Visualization, 2013)

Practical Experience with Hanani-Tutte for Testing c-Planarity. - Carsten Gutwenger; Petra Mutzel; Marcus Schaefer 001 (ALENEX, 2014)

Examining the Compactness of Automatically Generated Layouts for Practical Diagrams. - Carsten Gutwenger; Ulf Rüegg; Miro Spönemann; Reinhard von Hanxleden; Petra Mutzel (ED/GViP@Diagrams, 2014)

Explicit Versus Implicit Graph Feature Maps: A Computational Phase Transition for Walk Kernels. - Nils M. Kriege; Marion Neumann; Kristian Kersting; Petra Mutzel (ICDM, 2014)

Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay. - Andre Droschinsky; Bernhard Heinemann; Nils M. Kriege; Petra Mutzel (ISAAC, 2014)

Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs. - Nils M. Kriege; Petra Mutzel (MFCS (2), 2014)

SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search. - Nils M. Kriege; Petra Mutzel; Till Schäfer (WALCOM, 2014)

Scaffold hunter: visual analysis of biological activity data. - Karsten Klein 001; Oliver Koch; Nils M. Kriege; Petra Mutzel; Till Schäfer (J. Cheminformatics, 2014)

Introduction to Special Issue ALENEX'12. - David A. Bader; Petra Mutzel (ACM J. Exp. Algorithmics, 2014)

Practical SAHN Clustering for Very Large Data Sets and Expensive Distance Metrics. - Nils M. Kriege; Petra Mutzel; Till Schäfer (J. Graph Algorithms Appl., 2014)

Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems. - Fritz Bökler; Petra Mutzel (ESA, 2015)

Drawing Partially Embedded and Simultaneously Planar Graphs. - Timothy M. Chan; Fabrizio Frati; Carsten Gutwenger; Anna Lubiw; Petra Mutzel; Marcus Schaefer 001 (J. Graph Algorithms Appl., 2015)

Compact Layered Drawings of General Directed Graphs. - Adalat Jabrayilov; Sven Mallach; Petra Mutzel; Ulf Rüegg; Reinhard von Hanxleden (GD, 2016)

Faster Kernels for Graphs with Continuous Attributes via Hashing. - Christopher Morris 001; Nils M. Kriege; Kristian Kersting; Petra Mutzel (ICDM, 2016)

A Sidetrack-Based Algorithm for Finding the k Shortest Simple Paths in a Directed Graph. - Denis Kurz; Petra Mutzel (ISAAC, 2016)

Faster Algorithms for the Maximum Common Subtree Isomorphism Problem. - Andre Droschinsky; Nils M. Kriege; Petra Mutzel (MFCS, 2016)

Output-sensitive Complexity of Multiobjective Combinatorial Optimization. - Fritz Bökler; Matthias Ehrgott; Christopher Morris 001; Petra Mutzel (CoRR, 2016)

StruClus: Structural Clustering of Large-Scale Graph Databases. - Till Schäfer; Petra Mutzel (CoRR, 2016)

StruClus: Scalable Structural Graph Set Clustering with Representative Sampling. - Till Schäfer; Petra Mutzel (ADMA, 2017)

Glocalized Weisfeiler-Lehman Graph Kernels: Global-Local Feature Maps of Graphs. - Christopher Morris 001; Kristian Kersting; Petra Mutzel (ICDM, 2017)

Finding Largest Common Substructures of Molecules in Quadratic Time. - Andre Droschinsky; Nils M. Kriege; Petra Mutzel (SOFSEM, 2017)

Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem. - Fritz Bökler; Petra Mutzel (WALCOM, 2017)

Global Weisfeiler-Lehman Graph Kernels. - Christopher Morris 001; Kristian Kersting; Petra Mutzel (CoRR, 2017)

A Unifying View of Explicit and Implicit Feature Maps for Structured Data: Systematic Studies of Graph Kernels. - Nils M. Kriege; Marion Neumann; Christopher Morris 001; Kristian Kersting; Petra Mutzel (CoRR, 2017)

Matheuristics for optimizing the network in German wagonload traffic. - Julia Sender; Thomas Siwczyk; Petra Mutzel; Uwe Clausen (EURO J. Comput. Optim., 2017)

Stochastic survivable network design problems: Theory and practice. - Ivana Ljubic; Petra Mutzel; Bernd Zey (Eur. J. Oper. Res., 2017)

Scaffold Hunter: a comprehensive visual analytics framework for drug discovery. - Till Schäfer; Nils M. Kriege; Lina Humbeck; Karsten Klein 001; Oliver Koch; Petra Mutzel (J. Cheminformatics, 2017)

The Crossing Number of Semi-Pair-Shellable Drawings of Complete Graphs. - Petra Mutzel; Lutz Oettershagen (CCCG, 2018)

Orthogonal Compaction using Additional Bends. - Michael Jünger; Petra Mutzel; Christiane Spisla (VISIGRAPP (3: IVAPP), 2018)

A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs. - Christine Dahn; Nils M. Kriege; Petra Mutzel (IWOCA, 2018)

The Crossing Number of Seq-Shellable Drawings of Complete Graphs. - Petra Mutzel; Lutz Oettershagen (IWOCA, 2018)

New Integer Linear Programming Models for the Vertex Coloring Problem. - Adalat Jabrayilov; Petra Mutzel (LATIN, 2018)

Largest Weight Common Subtree Embeddings with Distance Penalties. - Andre Droschinsky; Nils M. Kriege; Petra Mutzel (MFCS, 2018)

Recognizing Cuneiform Signs Using Graph Based Methods. - Nils M. Kriege; Matthias Fey; Denis Fisseler; Petra Mutzel; Frank Weichert (COST@SDM, 2018)

The Crossing Number of Single-Pair-Seq-Shellable Drawings of Complete Graphs. - Petra Mutzel; Lutz Oettershagen (CoRR, 2018)

On maximum common subgraph problems in series-parallel graphs. - Nils M. Kriege; Florian Kurpicz; Petra Mutzel (Eur. J. Comb., 2018)

More Compact Orthogonal Drawings by Allowing Additional Bends †. - Michael Jünger; Petra Mutzel; Christiane Spisla (Inf., 2018)

A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs. - Nils M. Kriege; Andre Droschinsky; Petra Mutzel (J. Graph Algorithms Appl., 2018)

Bishellable drawings of Kn. - Bernardo M. Ábrego; Oswin Aichholzer; Silvia Fernández-Merchant; Dan McQuillan; Bojan Mohar; Petra Mutzel; Pedro Ramos 001; R. Bruce Richter; Birgit Vogtenhuber (SIAM J. Discret. Math., 2018)

A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints. - Adalat Jabrayilov; Petra Mutzel (ALENEX, 2019)

Protein Complex Similarity Based on Weisfeiler-Lehman Labeling. - Bianca K. Stöcker; Till Schäfer; Petra Mutzel; Johannes Köster; Nils M. Kriege; Sven Rahmann (SISAP, 2019)

Algorithmic Data Science (Invited Talk). - Petra Mutzel (STACS, 2019)

On the Enumeration of Bicriteria Temporal Paths. - Petra Mutzel; Lutz Oettershagen (TAMC, 2019)

Towards a practical k-dimensional Weisfeiler-Leman algorithm. - Christopher Morris 001; Petra Mutzel (CoRR, 2019)

Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs. - Michael Jünger; Elisabeth Lobe; Petra Mutzel; Gerhard Reinelt; Franz Rendl; Giovanni Rinaldi; Tobias Stollenwerk (CoRR, 2019)

A unifying view of explicit and implicit feature maps of graph kernels. - Nils M. Kriege; Marion Neumann; Christopher Morris 001; Kristian Kersting; Petra Mutzel (Data Min. Knowl. Discov., 2019)

A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width. - Michael Jünger; Petra Mutzel; Christiane Spisla (J. Graph Algorithms Appl., 2019)

10 Reasons to Get Interested in Graph Drawing. - Carla Binucci; Ulrik Brandes; Tim Dwyer; Martin Gronemann; Reinhard von Hanxleden; Marc J. van Kreveld; Petra Mutzel; Marcus Schaefer 001; Falk Schreiber; Bettina Speckmann (Computing and Software Science, 2019)

Shrinking Trees not Blossoms: A Recursive Maximum Matching Approach. - Andre Droschinsky; Petra Mutzel; Erik Thordsen (ALENEX, 2020)

Efficient Top-k Temporal Closeness Calculation in Temporal Networks. - Lutz Oettershagen; Petra Mutzel (ICDM, 2020)

Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings. - Christopher Morris 001; Gaurav Rattan; Petra Mutzel (NeurIPS, 2020)

Temporal Graph Kernels for Classifying Dissemination Processes. - Lutz Oettershagen; Nils M. Kriege; Christopher Morris 001; Petra Mutzel (SDM, 2020)

Crossing Number for Graphs with Bounded Pathwidth. - Therese Biedl; Markus Chimani; Martin Derka; Petra Mutzel (Algorithmica, 2020)

Classifying Dissemination Processes in Temporal Graphs. - Lutz Oettershagen; Nils M. Kriege; Christopher Morris 001; Petra Mutzel (Big Data, 2020)

SCOT: Rethinking the classification of secondary structure elements. - Tobias Brinkjost; Christiane Ehrt; Oliver Koch; Petra Mutzel (Bioinform., 2020)

TUDataset: A collection of benchmark datasets for learning with graphs. - Christopher Morris 001; Nils M. Kriege; Franka Bause; Kristian Kersting; Petra Mutzel; Marion Neumann (CoRR, 2020)

Spatio-Temporal Top-k Similarity Search for Trajectories in Graphs. - Anne Driemel; Petra Mutzel; Lutz Oettershagen (CoRR, 2020)

Maximum Cut Parameterized by Crossing Number. - Markus Chimani; Christine Dahn; Martina Juhnke-Kubitzke; Nils M. Kriege; Petra Mutzel; Alexander Nover (J. Graph Algorithms Appl., 2020)

Point feature label placement for multi-page maps on small-screen devices. - Sven Gedicke; Adalat Jabrayilov; Benjamin Niedermann; Petra Mutzel; Jan-Henrik Haunert (Comput. Graph., 2021)

An Index for Single Source All Destinations Distance Queries in Temporal Graphs. - Lutz Oettershagen; Petra Mutzel (CoRR, 2021)

Quantum Annealing versus Digital Computing: An Experimental Comparison. - Michael Jünger; Elisabeth Lobe; Petra Mutzel; Gerhard Reinelt; Franz Rendl; Giovanni Rinaldi; Tobias Stollenwerk (ACM J. Exp. Algorithmics, 2021)

Fixed-parameter algorithms for the weighted Max-Cut problem on embedded 1-planar graphs. - Christine Dahn; Nils M. Kriege; Petra Mutzel; Julian Schilling (Theor. Comput. Sci., 2021)

Protein Complex Similarity. - Bianca K. Stöcker; Till Schäfer; Petra Mutzel; Johannes Köster; Nils M. Kriege; Sven Rahmann (Mach. Learn. under Resour. Constraints Vol. 3 (3), 2022)

Graph-Based Methods for Rational Drug Design. - Andre Droschinsky; Lina Humbeck; Oliver Koch; Nils M. Kriege; Petra Mutzel; Till Schäfer (Algorithms for Big Data, 2022)

McSparse: Exact Solutions of Sparse Maximum Cut and Sparse Unconstrained Binary Quadratic Optimization Problems. - Jonas Charfreitag; Michael Jünger; Sven Mallach; Petra Mutzel (ALENEX, 2022)

TGLib: An Open-Source Library for Temporal Graph Analysis. - Lutz Oettershagen; Petra Mutzel (ICDM (Workshops), 2022)

Vehicle Routing with Heterogeneous Time Windows. - Petra Mutzel; Tim Niemann; Lukas Schürmann; Sebastian Stiller; Andreas M. Tillmann (OR, 2022)

Temporal Walk Centrality: Ranking Nodes in Evolving Networks. - Lutz Oettershagen; Petra Mutzel; Nils M. Kriege (WWW, 2022)

Strengthened Partial-Ordering Based ILP Models for the Vertex Coloring Problem. - Adalat Jabrayilov; Petra Mutzel (CoRR, 2022)

Minimum-error triangulations for sea surface reconstruction. - Anna Arutyunova; Anne Driemel; Jan-Henrik Haunert; Herman J. Haverkort; Jürgen Kusche; Elmar Langetepe; Philip Mayer; Petra Mutzel; Heiko Röglin (J. Comput. Geom., 2022)

Computing top-k temporal closeness in temporal networks. - Lutz Oettershagen; Petra Mutzel (Knowl. Inf. Syst., 2022)

Integer Programming for the Maximum Cut Problem: A Refined Model and Implications for Branching. - Jonas Charfreitag; Sven Mallach; Petra Mutzel (ACDA, 2023)

A Reduced Cost-based Model Strengthening Method. - Lukas Schürmann; Petra Mutzel (ACDA, 2023)

A Higher-Order Temporal H-Index for Evolving Networks. - Lutz Oettershagen; Nils M. Kriege; Petra Mutzel (KDD, 2023)

A Temporal Graphlet Kernel For Classifying Dissemination in Evolving Networks. - Lutz Oettershagen; Nils M. Kriege; Claude Jordan; Petra Mutzel (SDM, 2023)

An Index For Temporal Closeness Computation in Evolving Graphs. - Lutz Oettershagen; Petra Mutzel (SDM, 2023)

Clustering Building Footprint Polygons Based on Graph Similarity Measures. - Sophie Duong; Peter Rottmann; Jan-Henrik Haunert; Petra Mutzel (UrbanAI@SIGSPATIAL, 2023)

Guest Editors' forewords. - Md. Saidur Rahman 001; Petra Mutzel; S. Slamin 001 (J. Graph Algorithms Appl., 2023)

Special issue on selected papers from the 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022). - Md. Saidur Rahman 001; Petra Mutzel; Slamin (Theor. Comput. Sci., 2023)

Special Issue Dedicated to 16th International Conference and Workshops on Algorithms and Computation, WALCOM 2022. - Md. Saidur Rahman 001; Petra Mutzel; Slamin (Algorithmica, 2023)

Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings. - Alexander Dobler; Michael Jünger; Paul J. Jünger; Julian Meffert; Petra Mutzel; Martin Nöllenburg (GD, 2024)

PACE Solver Description: Exact Solution of the One-Sided Crossing Minimization Problem by the MPPEG Team. - Michael Jünger; Paul J. Jünger; Petra Mutzel; Gerhard Reinelt (IPEC, 2024)

SAT Encoding of Partial Ordering Models for Graph Coloring Problems. - Daniel Faber; Adalat Jabrayilov; Petra Mutzel (SAT, 2024)

Separator Based Data Reduction for the Maximum Cut Problem. - Jonas Charfreitag; Christine Dahn; Michael Kaibel; Philip Mayer; Petra Mutzel; Lukas Schürmann (SEA, 2024)

Engineering A* Search for the Flip Distance of Plane Triangulations. - Philip Mayer; Petra Mutzel (SEA, 2024)

Delay-resistant robust vehicle routing with heterogeneous time windows. - Lukas Metz; Petra Mutzel; Tim Niemann; Lukas Schürmann; Sebastian Stiller; Andreas M. Tillmann (Comput. Oper. Res., 2024)

A Simpler Approach for Monotone Parametric Minimum Cut: Finding the Breakpoints in Order. - Arne Beines; Michael Kaibel; Philip Mayer; Petra Mutzel; Jonas Sauer (CoRR, 2024)

A Simpler Approach for Monotone Parametric Minimum Cut: Finding the Breakpoints in Order. - Arne Beines; Michael Kaibel; Philip Mayer; Petra Mutzel; Jonas Sauer (Zenodo, 2024)

Polygon Aggregration Instances for Monotone Parametric Minimum Cut. - Peter Rottmann; Jan-Henrik Haunert; Philip Mayer; Petra Mutzel; Jonas Sauer (Zenodo, 2024)

PACE2024. - Michael Jünger; Paul J. Jünger; Petra Mutzel; Gerhard Reinelt (DROPS Artifacts, 2024)

A Customized SAT-based Solver for Graph Coloring. - Timo Brand; Daniel Faber; Stephan Held; Petra Mutzel (CoRR, 2025)

Weisfeiler and Leman Follow the Arrow of Time: Expressive Power of Message Passing in Temporal Event Graphs. - Franziska Heeg; Jonas Sauer; Petra Mutzel; Ingo Scholtes (CoRR, 2025)

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 (CoRR, 2025)