now at University of Bonn: Computational Analytics at Bonn University

Chair of Algorithm Engineering
Department of Computer Science
Technische Universität Dortmund

Room:	R. 231 in OH14
Phone:	+49 231 755 7700 or 7701 (secretary)
Fax:	+49 231 755 7740
E-Mail:	petra.mutzelcs.tu-dortmund.de
Consultation hours:	SS 2019: Mi 12:00 - 13:00 Uhr

Bitte vereinbaren Sie bei Bedarf sowie in der vorlesungsfreien Zeit einen Termin via Email.

• Algorithm Engineering, in particular graph algorithms and data structures
• Computational Analytics
• Algorithmic Data Analysis, Graph Mining
• Combinatorial Optimization (polynomial time and ILP-based)
• Network Design and Optimization
• Graph and Network Visualization
• Analysis of chemical structures and biological networks
• Application areas: network analysis, cheminformatics (drug design), information visualization, network design and optimization (e.g. Steiner tree, shortest path), computational biology, statistical physics, …

• ``Algorithmic Data Analysis´´, Symposium on Theoretical Aspects of Computer Science, STACS 2019, Berlin, March 13-19, 2019

• 19th Symposium on Experimental Algorithms 2020 (SEA 2020)]], Catania (Italy), June 2020
• Algorithm Engineering & Experiments 2020 (ALENEX 2020), Salt Lake City (USA), January 2020
• 13th International Conference and Workshops on Algorithms and Computatio (WALCOM 2019), Guwahati, India, February 2019
• 29th International Symposium on Algorithms and Computation (ISAAC 2018), Jiaoxi, Yilan County, Taiwan, December 2018
• 26nd International Symposium on Graph Drawing and Network Visualization 2018 (GD 2018), Barcelona, September 2018
• 26th European Symposium on Algorithms (ESA 2018), Helsinki, August 2018
• 44th International Workshop on Graph-Theoretic Concepts in Computer Science 2018 (WG 2018), Lübbenau, June 2018
• 28th International Workshop on Combinatorial Algorithms (IWOCA 2017), Newcastle (Australia), July 2017
• 16th Symposium on Experimental Algorithms 2017 (SEA 2017), London, June 2017
• Eleventh International Conference and Workshops on Algorithms and Computatio (WALCOM 2017), Hsinchu, Taiwan, March 2017
• 27th International Workshop on Combinatorial Algorithms (IWOCA 2016), Helsinki, August 2016
• 15th Symposium on Experimental Algorithms 2016 (SEA 2016), St. Petersburg, June 2016
• Algorithm Engineering & Experiments 2015 (ALENEX 2015), San Diego (USA), January 2015
• Ninth International Workshop on Algorithms and Computatio (WALCOM 2015), 2015
• 13th Symposium on Experimental Algorithms 2014 (SEA 2014), Copenhagen, June/July 2014
• 22nd International Symposium on Graph Drawing 2014(GD 2014), Würzburg, September 2014
• 6th IEEE Pacific Visualization Symposium 2013 (PacificVis'13), Sydney (Australia), February 2013
• 37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012), Bratislava (Slovakia), August 2012
• 11th International Symposium on Experimental Algorithms 2012 (SEA 2012), Bordeaux (France), June 2012
• Algorithm Engineering & Experiments 2012 (ALENEX 2012), Kyoto (Japan), January 2012 (PC co-chair with David Bader)
• ACM-SIAM Symposium on Discrete Algorithms 2012 (SODA 2012), Kyoto (Japan), January 2012
• Workshop on Algorithms and Computation 2012 (WALCOM 2012), BUET, February 2012
• Frontiers of Algorithmics Workshop 2011 (FAW 2011), Jinhua (China), May 2011
• Symposium on Graph Drawing 2010 (GD 2010), Konstanz, September 2010
• 18th European Symposium on Algorithms (ESA 2010), University of Liverpool (UK), September 2010
• 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2010), University of Liverpool (UK), September 2010
• Workshop on Algorithms and Computation 2010 (WALCOM 2010), Dhaka, February 2010

My research group is currently funded by the DFG (SFB, GRK, SPP and Sachbeihilfe) and others. An overview of our current projects can be found at Projects.

• Member of the Supervisory Board of the Helmholtz Center for Information Security (CISPA) in Saarbrücken
• Member of the 2018 and 2015 Beale-Orchard Hays Prize Committee for Excellence in Computational Mathematical Programming by the Mathematical Optimization Society
• Elected Member of the “DFG-Senatsauschuss” and the “DFG-Bewilligungsausschuss” for Collaborative Research Centres (SFB), since January 2013
• Elected “DFG-Fachkollegiatin” for the area of Theoretical Computer Science, 2008-2012
• Member of the board of the GIBU: “Beirat der Universitätsprofessor/inn/en in der Gesellschaft für Informatik” (Professors in the Computer Science Society), 2008-2012
• Research Prize “Technische Kommunikation 2000” by the Alcatel SEL Stiftung für Kommunikationsforschung (20.000 EUR)
• Member of the Innovationsbeirat of the German Ministry of Education and Research (2001-2005)
• Delegate of the Curatorium of the Austrian Academy of Sciences (2002)
• Reviewer in the EU-panel “Engineering and Computer Sciences” for the European Young Investigator Award (EURYI) of the ESF (2005-2007)
• External peer reviewer for the evaluation of the Computer Science Department of the University of Limerick (Ireland), 2002-2003
• Editor of the Journal of Graph Algorithms and Applications (JGAA) since 2005, the Graph Drawing E-print Archive since 2006, Mathematical Programming Computation since 2010, and EURO Journal on Computational Optimization since 2012, ACM Journal on Experimental Algorithmics since 2013, and several guest editorials

• Successful completion of various research projects funded by the German Science Foundation (DFG), the German Ministry of Science, the Federal Ministry of Economics and Technology, the European Union, and the caesar Foundation; current active projects: see projects
• Member of the board of the DFG Research Training Group RTG 1855: Discrete Optimization of Technical Systems under Uncertainty
• Co-Initiator of the DFG-funded priority program (DFG-Schwerpunktprogramm) SPP 1307 Algorithm Engineering jointly with Peter Sanders, Kurt Mehlhorn, Rolf Möhring, Burkard Monien, and Dorothea Wagner)
• Program committee member in various international conferences, including ACM-SIAM Symposium on Discrete Algorithms (SODA), Algorithm Engineering & Experiments (ALENEX), European Symposium of Algorithms (ESA), International Symposium on Experimental Algorithms (SEA), Conference on Integer Programming and Combinatorial Optimization (IPCO), ACM Symposium of Software Visualization
• Steering committee member of ALENEX (2012-2017) and the Algorithms and Computation Workshops (since 2007)
• Organizer of various scientific seminars and Workshops in Oberwolfach and in Schloß Dagstuhl (e.g. on Algorithm Engineering, Graph Drawing)
• Reviewer for 29 Journals including JACM, Algorithmica, Discrete Applied Mathematics, IEEE Transactions on Systems, Man, and Cybernetics, Mathematical Programming, NETWORKS, SIAM Journal on Computing
• Inventor (in MPG) of the software system AGD: Algorithms for Graph Drawing (distributed by a spin-off of the Max-Planck-Society) and co-developer of the open source software packages OGDF (Open Graph Drawing Framework) and Scaffold Hunter (Chemical Software)
• Successfully completed the supervision of 14 Ph.D. students since 2001
• Elected member of the Computer Science Faculty (since 2005), the Promotionsausschuss Informatik (since 2006), Fakultätskommission für Haushalt und Struktur (since 2012), the Gleichstellungskommission of the CS Faculty (since 2011), the Senat of the TU Dortmund (2012-2014, deputy 2014-2018, since July 1, 2018) and the SK Fin: Senatskommission für Finanzen of the TU Dortmund (2014-2016).

• The current and past lectures and courses can be found at Lectures.
• If you are interested in writing a diploma/Master's/Bachelor's thesis, please contact me directly via email. Please note that it is mandatory that you have heard lectures in the area of algorithms. E.g., for a Bachelor thesis, the knowledge of the Vorlesung Effiziente Algorithmen is necessary. For a Master thesis, you should have heard at least Algorithmen und Datenstrukturen. Also the lecture Graphenalgorithmen or the Seminar Algorithm Engineering would be advantageous.

Also see Google Scholar (h-index >= 42) and DBLP or io-port.net. My ORCID code is 0000-0001-7621-971X.

• A unifying view of explicit and implicit feature maps of graph kernels
  Nils M. Kriege, Marion Neumann, Christopher Morris, Kristian Kersting, and Petra Mutzel
  Data Mining and Knowledge Discovery, 2019, to appear

• 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, and Tobias Stollenwerk
  CoRR abs/1904-11965, 2019

• A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width
  Michael Jünger, Petra Mutzel and Christine Spisla
  Journal of Graph Algorithms and Applications 23 (3), 499-524, 2019

• Algorithmic Data Science (Invited Talk)
  Petra Mutzel
  36th International Symposium on Theoretical Aspects of Computer Science, (STACS) 2019, Eds. R. Niedermeier and C. Paul, LIPIcs vol. 126, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 3:1–3:15, 2019

• Towards a practical k-dimensional Weisfeiler-Leman algorithm
  Christopher Morris, Petra Mutzel
  CoRR abs/1904.01543, 2019

• Maximum Cut Parameterized by Crossing Number
  Markus Chimani, Christine Dahn, Martina Juhnke-Kubitzke, Nils M. Kriege, Petra Mutzel, Alexander Nover
  CoRR abs-1904-11965, 2019

• Bishellable drawings of Kn
  Bernardo M. Abrego, Oswin Aichholzer, Silvia Fernandez-Merchant, Dan McQuillan, Bojan Mohar, Petra Mutzel, Pedro Ramos, R. Bruce Richter, and Birgit Vogtenhuber
  SIAM Journal on Discrete Mathematics, vol. 32, no. 4, 482–2492, 2018 (preprint see CoRR abs/1510.00549)

• A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs
  Nils M. Kriege, Andre Droschinsky, Petra Mutzel, Journal of Graph Algorithms and Applications
  vol. 22, no. 4, 607-616, 2018

• On the Enumeration of Bicriteria Temporal Paths
  Lutz Oettershagen and Petra Mutzel
  Theory and Applications of Models of Computation (TAMC 2019), LNCS 11436, Springer, 518-535, 2019, also see CoRR abs/1812.02507

• A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints
  Adalat Jabrayilov and Petra Mutzel
  In: Proceedings of Algorithm Engineering & Experiments (ALENEX 2019), SIAM, 2019, 107-116 (also see CoRR abs/1806.10697)

• Fixed-Parameter Algorithms for the Weighted Max-Cut Problem on Embedded 1-Planar Graphs
  Christine Dahn, Nils M. Kriege, Petra Mutzel, Julian Schilling
  CoRR abs/1805.06780 (and submitted to Journal)

• A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width (Extended Abstracts)
  Michael Jünger, Petra Mutzel and Christine Spisla
  Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Lecture Notes in Computer Science 11282, Springer, 187-199, 2018

• More Compact Orthogonal Drawings by Allowing Additional Bends
  Michael Jünger, Petra Mutzel and Christine Spisla
  Information 2018, 9 (7), art-no. 153, MDPI, doi:10.3390/info9010001

• Largest Weight Common Subtree Embeddings with Distance Penalties (Preprint arXiv:1805.00821)
  Andre Droschinsky, Nils M. Kriege, Petra Mutzel
  43rd International Symposium on Mathematical Foundations of Computer Science (MFCS) 2018, LIPIcs, vol. 117, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 54:1-54:15, 2018

• The Crossing Number of Single-Pair-Seq-Shellable Drawings of Complete Graphs
  Petra Mutzel, Lutz Oettershagen
  Proceedings of the 30th Canadian Conference on Computational Geometry (CCCG), 11-17, 2018, also see CoRR abs/1805.06780

• A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs
  Nils M. Kriege, Andre Droschinsky, Petra Mutzel, 2017, CoRR abs/1805.10754

• Recognizing Cuneiform Signs Using Graph Based Methods (Preprint arXiv:1802.05908)
  Nils M. Kriege, Matthias Fey, Denis Fisseler, Petra Mutzel, Frank Weichert
  International Workshop on Cost-Sensitive Learning (COST), SIAM International Conference on Data Mining (SDM) 2018, Proceedings of Machine Learning Research (PMLR), vol. 88, 31-44, 2018

• CHIPMUNK: A virtual synthesizable small molecule library for medicinal chemistry exploitable for protein-protein interaction modulators
  Lina Humbeck, Sebastian Weigang, Till Schäfer, Petra Mutzel, and Oliver Koch,
  ChemMedChem 6/2018, vol- 13, issue 6, Very Important Paper, 532-539, 2018, doi:10.1002/cmdc.201700689; we also got the cover feature for this article

• The Crossing Number of Seq-Shellable Drawings of Complete Graphs
  Petra Mutzel, Lutz Oettershagen
  International Workshop on Combinatorial Algorithms 2018, IWOCA 2018, Lecture Notes in Computer Science 10979, 273-284 (also see CoRR abs/1803.10983)

• A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs
  Christine Dahn, Nils M. Kriege, Petra Mutzel
  29th International Workshop on Combinatorial Algorithms 2018, IWOCA 2018, Lecture Notes in Computer Science 10979, 141-152 (also see CoRR abs/1803.07515)

• New Integer Linear Programming Models for the Vertex Coloring Problem
  Adalat Jabrayilov and Petra Mutzel
  13th Latin American Theoretical INformatics Symposium (LATIN 2018), LNCS 10807, Springer, 640-652, 2018

• Orthogonal Compaction Using Additional Bends
  M. Jünger, P. Mutzel and C. Spisla
  Proc. of the 13th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISIGRAPP) 2018, vol. 3: IVAPP, SciTePress, 144-155, 2018

• On Maximum Common Subgraph Problems in Series-Parallel Graphs
  Nils Kriege, Florian Kurpicz, Petra Mutzel
  European Journal of Combinatorics, vol. 68, Elsevier, 79-95, 2018

• Glocalized Weisfeiler-Lehman Graph Kernels: Global-Local Feature Maps of Graphs
  Christopher Morris, Kristian Kersting, and Petra Mutzel
  IEEE International Conference on Data Mining (ICDM 2017), New Orleans, LA, USA, pp. 327–336, IEEE Computer Society, 2017.

• Crossing Number for Graphs with Bounded Pathwidth
  Therese Biedl, Markus Chimani, Martin Derka and Petra Mutzel
  28th International Symposium on Algorithms and Computation (ISAAC 2017), eds. Y. Okamoto and T. Tokuyama, Leibniz International Proceedings in Informatics (LIPIcs), volume 92, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 13:1–13:13, 2017.

• Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem
  Fritz Boekler and Petra Mutzel
  11th International Conference and Workshop on Algorithms and Computation (WALCOM), LNCS 10167, Springer, 190-203, 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, Kristian Kersting, and Petra Mutzel
  CoRR abs/1703.00676, 2017

• Orthogonal Compaction Using Additional Bends
  Michael Jünger, Petra Mutzel and Christiane Spisla,
  CoRR abs/1706.06514, 2017, test instances available here

• Scaffold Hunter: a comprehensive visual analytics framework for drug discovery
  Till Schäfer, Nils Kriege, Lina Humbeck, Karsten Klein, Oliver Koch, Petra Mutzel
  Journal of Cheminformatics, vol. 9:28, no. 1, 28:1-28:18, 2017

• Output-sensitive Complexity of Multiobjective Combinatorial Optimization
  Fritz Bökler, Matthias Ehrgott, Christopher Morris, Petra Mutzel
  Journal of Multi-Criteria Decision Analysis, volume 24, no. 1-2, 25-36, 2017 (and CoRR abs/1610.07204, 2016)

• Finding Largest Common Substructures of Molecules in Quadratic Time
  Andre Droschinsky, Nils Kriege and Petra Mutzel
  43rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM-FOCS 1017), LNCS 10139, Springer, 309-321, 2017

• Stochastic Survivable Network Design Problems: Theory and practice
  Ivana Ljubic, Petra Mutzel, and Bernd Zey
  European Journal of Operational Research (EJOR), volume 256, issue 2, pp. 333-348, 2017.

• Faster Kernels for Graphs with Continuous Attributes via Hashing
  Christopher Morris, Nils M. Kriege, Kristian Kersting, and Petra Mutzel
  IEEE 16th International Conference on Data Mining (ICDM 2016), Barcelona, Spain, pp. 1095-1100, 2016.

• A Sidetrack-Based Algorithm for Finding the k Shortest Simple Paths in a Directed Graph
  Denis Kurz and Petra Mutzel
  The 27th International Symposium on Algorithms and Computation (ISAAC 2016), LIPIcs, vol. 64, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 49:1-49:13, 2016, also see CoRR abs/1601.02867

• StruClus: Structural Clustering of Large-Scale Graph Databases
  Till Schaefer and Petra Mutzel
  CoRR abs/1609.09000, 2016

• Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem
  Fritz Boekler and Petra Mutzel
  CoRR abs/1604.08147, 2016

• Matheuristics for optimizing the network in German wagonload traffic
  Julia Sender, Thomas Siwczyk, Petra Mutzel, Uwe Clausen
  EURO Journal on Computational Optimization, 1-26, 2016

• Compact Layered Drawings of General Directed Graphs
  Adalat Jabrayilov, Sven Mallach, Petra Mutzel, Ulf Rüegg and Reinhard von Hanxleden
  Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016), LNCS 9801, Springer, 209-221, 2016

• Faster Algorithms for the Maximum Common Subtree Isomorphism Problem
  Andre Droschinsky, Nils Kriege and Petra Mutzel
  41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), LIPIcs vol. 58, 33:1–33:14, 2016, also see CoRR abs/1602.07210

• Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems
  Fritz Boekler, Petra Mutzel
  23rd Annual European Symposium on Algorithms (ESA 2015), LNCS 9294, pp. 288-299, Springer, 2015

• Drawing Partially Embedded and Simultaneously Planar Graphs
  Timothy Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel and Marcus Schaefer
  Journal on Graph Algorithms and Applications (JGAA), vol. 19, no. 2, pp. 681-706, 2015

• Bishellable drawings of Kn
  Bernardo M. Abrego, Oswin Aichholzer, Silvia Fernandez-Merchant, Dan McQuillan, Bojan Mohar, Petra Mutzel, Pedro Ramos, R. Bruce Richter, and Birgit Vogtenhuber
  CoRR http://arxiv.org/abs/1510.00549, 2015

• Explicit Versus Implicit Graph Feature Maps: A Computational Phase Transition for Walk Kernels
  Nils Kriege, Marion Neumann, Kristian Kersting, Petra Mutzel
  2014 IEEE International Conference on Data Mining (ICDM 2014), 881-886

• Scaffold hunter: visual analysis of biological activity data
  Karsten Klein, Oliver Koch, Nils Kriege, Petra Mutzel, Till Schäfer
  J. Cheminformatics 6(S-1): 33 (2014)

• Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay
  Andre Droschinsky, Bernhard Heinemann, Nils Kriege and Petra Mutzel
  Proceedings of the 25th International Symposium on Algorithms and Computation (ISAAC 2014), LNCS 8889, Springer, 81-93

• Practical SAHN Clustering for Very Large Data Sets and Expensive Distance Metrics
  Nils Kriege, Petra Mutzel, Till Schäfer
  Journal of Graph Algorithms and Applications (JGAA), vol. 18 (4), 2014, 577-602

• Drawing Partially Embedded and Simultaneously Planar Graphs
  Timothy Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel and Marcus Schaefer
  Proceedings of the 22nd International Symposium on Graph Drawing (GD 2014), LNCS 8871, Springer, 25-39

• On Maximum Common Subgraph Problems in Series-Parallel Graphs
  Nils Kriege, Florian Kurpicz, Petra Mutzel
  Proceedings of the 25th International Workshop on Combinatorial Algorithms (IWOCA 2014), Minnesota (USA), LNCS 8986, Springer, 200-212, 2014

• Examining the Compactness of Automatically Generated Layouts for Practical Diagrams
  Carsten Gutwenger, Reinhard von Hanxleden, Petra Mutzel, Ulf Rüegg and Miro Spönemann
  Proceedings of Graph Visualization in Practice (GraphViP 2014), CEUR, 42-52

• Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs
  Nils Kriege und Petra Mutzel
  International Symposium on Mathematical Foundations of Computer Science (MFCS) 2014, 505-516.

• SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search
  Nils Kriege, Petra Mutzel, Till Schäfer
  Proceedings of the Eighth International Workshop on Algorithms and Computation (WALCOM 2014), LNCS 8344, Springer, 2014, pp. 90-101.

• Practical Experience with Hanani-Tutte for Testing c-Planarity
  Carsten Gutwenger, Petra Mutzel, and Marcus Schäfer
  In: Proceedings of Algorithm Engineering & Experiments (ALENEX 2014), Portland, SIAM, 2014, 86-97.

• Crossings and Planarization
  Christoph Buchheim, Markus Chimani, Carsten Gutwenger, Michael Jünger and Petra Mutzel
  Bookchapter in: R. Tamassia (ed.), Graph Drawing and Visualization, CRC Press, 2014, pp. 43-85.

• The Open Graph Drawing Framework (OGDF)
  Markus Chimani, Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Karsten Klein and Petra Mutzel
  Bookchapter in: R. Tamassia (ed.), Graph Drawing and Visualization, CRC Press, 2014, 543-569.

• The Maximum Weight Connected Subgraph Problem
  Eduardo Alvarez-Miranda, Ivana Ljubic, Petra Mutzel
  Bookchapter in: M. Jünger and G. Reinelt, Facets of Combinatorial Optimization, Springer, 2013, pp. 245-270.

• Visual Analysis of Biological Activity Data with Scaffold Hunter
  Karsten Klein, Oliver Koch, Nils Kriege, Petra Mutzel, Till Schäfer
  Molecular Informatics, vol. 32, issue 11-12, Wiley, 2013, 964-975.

• The Rooted Maximum Node-Weight Connected Subgraph Problem
  Eduardo Alvarez-Miranda, Ivana Ljubic, Petra Mutzel
  10th Intern. Conf. on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2013), pp. 300-315

• Stochastic Survivable Network Design Problems
  Ivana Ljubic, Petra Mutzel, and Bernd Zey
  International Network Optimization Conference (INOC), Electronic Notes in Discrete Mathematics (ENDM), 2013, pp. 245-252

• Algorithm Engineering im Graphenzeichnen
  Martin Gronemann, Carsten Gutwenger, Michael Jünger, and Petra Mutzel
  Hauptbeitrag in Informatik Spektrum, vol. 36, no. 2, Springer, 2013, pp. 162-173

• MolMap - Visualizing Molecule Libraries as Topographic Maps
  Martin Gronemann, Michael Jünger, Nils Kriege, Petra Mutzel
  in: International Conference on Information Visualization Theory and Applications (IVAPP, best paper award), 2013, pp. 515-524

• Parameterized Algorithms for Stochastic Steiner Tree Problems
  Denis Kurz, Petra Mutzel, Bernd Zey
  Mathematical and Engineering Methods in Computer Science (MEMICS 2012), Revised Selected Papers, LNCS 7721, 2013, pp. 143-154

• Proceedings of the 14th Meeting on Algorithm Engineering {\&} Experiments, ALENEX 2012
  David Bader, Petra Mutzel (Eds.)
  ALENEX 2012, The Westin Miyako, Kyoto, SIAM Omnipress, 2012

• The Stochastic Steiner Tree Problem on Partial k-Trees
  Fritz Bökler, Petra Mutzel and Bernd Zey
  Proc. Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS) 2012, NOVPRESS Brno, October 2012

• Subgraph Matching Kernels for Attributed Graphs
  Nils Kriege and Petra Mutzel
  29th International Conference on Machine Learning (ICML), Edinburgh, Scotland, International Machine Learning Society, 2012

• Improved Steiner Tree Algorithms for Bounded Treewidth
  Markus Chimani, Petra Mutzel, and Bernd Zey
  Journal of Discrete Algorithms, vol. 16, 2012, pp. 67-78

• Scaffold Hunter - Visual Analysis of Chemical Compound Databases
  Karsten Klein, Nils Kriege, and Petra Mutzel
  in: International Conference on Information Visualization Theory and Applications (IVAPP, best paper award) 2012, pp. 626-635

• Vertex insertion approximates the crossing number of apex graphs
  Markus Chimani, Petr Hlineny and Petra Mutzel
  in: European Journal of Combinatorics, vol. 33 (3), 2012, pp. 326-335.

• An SDP Approach to Multi-level Crossing Minimization
  Markus Chimani, Philipp Hungerlaender, Michael Juenger, and Petra Mutzel
  ACM Journal of Experimental Algorithmics, vol. 17, no. 1, 2011

• An SDP Approach to Multi-level Crossing Minimization
  Markus Chimani, Philipp Hungerlaender, Michael Juenger, and Petra Mutzel
  ALENEX 2011, SIAM, 116-126

• Improved Steiner Tree Algorithms for Bounded Treewidth
  Markus Chimani, Petra Mutzel, and Bernd Zey
  International Workshop on Combinatorial Algorithms (IWOCA 2011)
  Lecture Notes in Computer Science 7056, Springer-Verlag, 2011, pp. 374-386.

• CT-Index: Fingerprint-based Graph Indexing Combining Cycles and Trees
  Karsten Klein, Nils Kriege, and Petra Mutzel
  Proc. 27th IEEE International Conference on Data Engineering (ICDE 2011), IEEE Computing Society, 1115-1126

• 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, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, and Antonios Symvonis
  Algorithmica 60 (3), 2011, 569-592

• Graph Drawing with Algorithm Engineering Methods (Dagstuhl Seminar 11191)
  Camil Demetrescu, Michael Kaufmann, Stephen G. Kobourov, Petra Mutzel
  Dagstuhl Reports 1 (5), 2011, 47-60

• Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
  Immanuel Bomze, Markus Chimani, Michael Jünger, Ivana Ljubic, Petra Mutzel, and Bernd Zey
  Proc. 21st Int. Symp. on Algorithms and Computation (ISAAC 2010),
  Lecture Notes in Computer Science 6506, Springer-Verlag, 2010, 427-439

• Upward Planarization Layout
  Markus Chimani , Carsten Gutwenger, Petra Mutzel, and Hoi-Ming Wong
  Journal of Graph Algorithms and Applications (JGAA) 15 (1), 2011, 127–155

• An Experimental Evaluation of Multilevel Layout Methods
  Bartel, G., Gutwenger, C., Klein, K., and Mutzel, P.
  in: Brandes, U. (ed.), Graph Drawing 2010
  Lecture Notes in Computer Science 6502, Springer-Verlag, 2010, 80-91

• Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints
  Chimani, M., Gutwenger, C., Mutzel, P., Spoenemann, M., and Wong, H.-M.
  in: Brandes, U. (ed.), Graph Drawing 2010
  Lecture Notes in Computer Science 6502, Springer-Verlag, 2010, 141-152

• Layer-Free Upward Crossing Minimization
  Markus Chimani , Carsten Gutwenger, Petra Mutzel, and Hoi-Ming Wong
  ACM Journal of Experimental Algorithmics 15, Article No. 2.2, 2010

• Oriented-based models for {0,1,2}-survivable network design: theory and practice
  Markus Chimani, Maria Kandyba, Ivana Ljubic, and Petra Mutzel
  Mathematical Programming, vol. 124, no. 1-2, 2010, 413-439

• Interactive Exploration of Chemical Space with Scaffold Hunter
  Wetzel, S., Klein, K., Renner, S. Rauh, D., Oprea, T.I., Mutzel, P. and Waldmann, H.
  Nature Chemical Biology 5, 2009, 581-583

• Graph Drawing Algorithms
  Peter Eades, Carsten Gutwenger, Seok-Hee Hong, and Petra Mutzel
  Chapter 6 in: M. Attallah and M. Blanton (eds.), Algorithms and Theory of Computation Handbook, Volume 2: Special Topics and Techniques, 2nd edition, CRC Press, 2009

• Optimization in Levelled Graphs
  Petra Mutzel
  Part 15 in: Pardalos, P.M. und Floudas, C.A. (eds.), Encyclopedia of Optimization, Second Edition, Springer US, 2009, 2813-2820

• Obtaining Optimal k-Cardinality Trees Fast
  Markus Chimani, Maria Kandyba, Ivana Ljubic, and Petra Mutzel
  ACM Journal of Experimental Algorithmics (JEA), vol. 14 (2), 2009, 5.1-5.23

• Inserting a Vertex into a Planar Graph
  Markus Chimani, Carsten Gutwenger, Petra Mutzel, and Christian Wolf
  In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms, (SODA '2009), New York
  ACM Press, 2009, 375-383

• Experiments on Exact Crossing Minimization using Column Generation
  Markus Chimani, Carsten Gutwenger, and Petra Mutzel
  ACM Journal of Experimental Algorithmics (JEA), vol. 14 (4), 2009, 4.1-4.18

• On the Hardness and Approximability of Planar Biconnectivity Augmentation
  Carsten Gutwenger, Petra Mutzel, and Bernd Zey
  In: H. Q. Ngo (ed.), 15th Annual International Computing and Combinatorics Conference, COCOON 2009
  Lecture Notes in Computer Science 5609, Springer-Verlag, 2009, 249-257

• On open problems in biological network visualization
  Albrecht, M., Kerren, A., Klein, K., Kohlbacher, O., Mutzel, P., Paul, W., Schreiber, F., and Wybrow, M.
  in: Eppstein, D. und Gansner, E. (eds.), Graph Drawing 2009
  Lecture Notes in Computer Science, Springer-Verlag, to appear 2010

• Port constraints in hierarchical layout of data flow diagrams
  Spoenemann, M., Fuhrmann, H., Mutzel, P., and von Hanxleden, R., M.
  in: Eppstein, D. und Gansner, E. (eds.), Graph Drawing 2009
  Lecture Notes in Computer Science, Springer-Verlag, to appear 2010

• Upward planarization layout
  Chimani, M., Gutwenger, C., Mutzel, P., and Wong, H.-M.
  in: Eppstein, D. und Gansner, E. (eds.), Graph Drawing 2009
  Lecture Notes in Computer Science, Springer-Verlag, to appear 2010

• Retention Time Alignment Algorithms for LC/MS Data must consider Nonlinear Shifts
  Podwojski, K., Fritsch, A., Chamrad, D.C., Paul, W., Sitek, B., Stuhler, K., Stephan, C., Meyer, H.E. Urfer, W., Ickstadt, K., Rahnenführer, J.
  Bioinformatics 25, 2009, 758-764

• Planar Biconnectivity Augmentation With Fixed Embedding
  Carsten Gutwenger, Petra Mutzel, and Bernd Zey
  In: J. Kratochvil und M. Miller (eds.), 20th International Workshop on Combinatorial Algorithms, IWOCA 2009
  Lecture Notes in Computer Science, Springer-Verlag, 2009, 289-300

• The Crossing Number of Graphs: Theory and Computation
  Petra Mutzel
  in: Albers, S., Alt, H. und Näher, S. (eds.), Efficient Algorithms, Essays dedicated to Kurt Mehlhorn on the occasion of his 60th birthday
  Lecture Notes in Computer Science 5760, Springer-Verlag, 2009, 305-317

• since 2004 Full Professor (C4) for Algorithm Engineering / Experimental Algorithms, Computer Science Department, Technische Universität Dortmund
• 1999-2004 Full Professor for Algorithms and Data Structures, Institute for Computer Graphics and Algorithms, Technische Universität Wien
• 1999 Temporary Professorship (C3) of Computer Science at Universität Heidelberg
• 1999 Habilitation at University of the Saarland (Member of the Max Planck Institute for Computer Science)
• 1994 Dr. rer. nat. (summa cum laude) in Computer Science, Universität zu Köln
• 1990 Dipl.-Math. at Universität Augsburg (Mathematics with Computer Science)