Computational Analytics

Room:	2.077
Phone:	+49 (228) 73-69917
E-Mail:	petra.mutzelcs.uni-bonn.de
Address:	Institute for Computer Science 1, Friedrich-Hirzebruch-Allee 8

Chair of Computational Analytics

In addition: Scientific Director of HPC/A Lab at DiCe

Our paper titled "Enhancing Graph Edit Distance Computation: Stronger and Orientation-based ILP Formulations" co-authored by Andrea D'axcezo, Julian Meffert, Petra Mutzel and Fabrizio Rossi, has appeared in the Proceedings for the VLDB Endowment (VLDB) 2025 (A* ranked). In there, we suggest new ILP formulations for the graph edit distance problem, and theoretically show that they theoretically and practically dominate all existing ones. We are able to solve many more instances (and much larger sizes) from the standard benchmark instances to provable optimality as previous approaches.

Timothy Mattson is Honorary Professor of the University of Bristol and regarded as an important co-founder of OpenMP (an API supporting multi-platform shared-memory multiprocessing programming). During his time at Intel, he has also worked on the further development of MPI, PyOMP, and GraphBLAS. He has written over 150 publications including six books on parallel computing. He will visit Bonn University during the week of March 24-28, 2025, in order to provide three workshops on various aspects of parallel programming using OpenMP. Please visit the webpage for more information.

The Symposium of Experimental Algorithms 2025 (SEA 2025) has taken place from 22 to 24 July 2025 in Venice, Italy. The co-chairs have been Petra Mutzel and Nicola Prezza. SEA aims to attract papers from the Computer Science community, the Operations Research/Mathematical Programming community and any other scientific community that is concerned with the main theme of the symposium, namely the role of experimentation and of algorithm engineering techniques in the design and evaluation of algorithms and data structures. The Proceedings are available here.

• Computational Analytics
• Algorithm Engineering, in particular graph algorithms and data structures
• 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, geosciences, cartography, computational biology, statistical physics, …

• ``N. N.´´, Invited Talk at the 20th International Conference and Workshops on Algorithms and Computation (WALCOM 2026), Perugia (Italy), March 4-6, 2026
• ``Computational Optimization in Geodesy´´, Invited Talk at the 3rd Vienna Workshop on Computational Optimization, University of Vienna (Austria), June 4-6,2025
• ``Algorithmic Data Science on Graphs´´, AI Talks at JMU, Center for AI and Data Science (CAIDAS) at Julius-Maximilians University of Wuerzburg, January 16, 2024
• ``Algorithmic Data Science on Graphs´´, TU Wien (Austria), November 16, 2023
• ``Graph Similarity´´, Colloquium Jacques Morgenstern, Sciences et Technologies de l'Information et de la Communication, INRIA, Sophia Antipolis, March 24, 2023
• ``Quantum annealing versus digital computing: An experimental comparison´´, Bonn Workshop on Combinatorial Optimization: Celebrating the 65th Birthday of William Cook, October 17 - 21, 2022, org. by D. Applegate, D. Espinoza, S. Held, and B. Korte, based on our paper published at ACM Journal of Experimental Algorithmics 2021 (link to paper)
• ``Lect. 1: ILP Formulations for the Graph Coloring Problem, Lect. 2+3: Graph Similarity´´, Hausdorff School: Computational Combinatorial Optimization, September 12 - 16, 2022, org. by William Cook (Waterloo) and Stephan Held (Bonn)
• ``Algorithmic Data Science´´, 19th Symposium on Experimental Algorithms, SEA 2021, Université Côte d'Azur, Valrose, France, June 7-9, 2021
• International School on Mathematics ``GUIDO STAMPACCHIA´´, Graph Theory, Algorithms And Applications, 5th Edition, org. by R. Cerulli, A. Goldberg, G.F. Italiano, R.E. Tarjan, Centre “Ettore Majorana” for Scientific Culture Erice, Italy, July 2020 (postponed due to Corona)

• PC member at the 48th German Conference on Artificial Intelligence (KI 2025), Potsdam, September 16-19, 2025, org. in cooperation with GI-SIG AI
• PC co-chair of the 23th Symposium on Experimental and Efficient Algorithms 2025 (SEA 2025), jointly with Nicola Prezza, Venice (Italy), July 22-24, 2025
• PC member of the 33th International Symposium on Algorithms and Computation (ISAAC 2023), Kyoto, Japan, December 3rd - 6th, 2023
• PC co-chair of the 16th International Conference and Workshop on Algorithms and Computation 2022 (WALCOM 2022), jointly with Md. Saidur Rahman and S. Slamin, University of Jember, East Java, Indonesia, March 24-26, 2022
• PC chair of the 20th European Symposium on Algorithms 2021 (ESA 2021, track B), part of ALGO 2021, Lisbon, September 6-10, 2021
• PC member of the 19th Symposium on Experimental Algorithms 2020 (SEA 2020), Catania (Italy), June 2020
• PC member of Algorithm Engineering & Experiments 2020 (ALENEX 2020), Salt Lake City (USA), January 2020

• Spokesperson of the DFG research unit AI FOR 5361: Algorithmic Data Analysis for Geodesy (AlgoForGe), since 2023
• PI of the Lamarr Institute for Machine Learning and Artificial Intelligence, since July 2022
• Member of the Scientific Advisory Board of the Freiburg Institute for Advanced Studies (FRIAS), since 2020
• Member of the Steering Committee of ESA ( European Symposium on Algorithms), since 2020
• Elected Member of the Steering Committee of TRA 1: Mathematics, Modelling and Simulation of Complex Systems, Bonn University, since 05/2020
• Regular Member of the Hausdorff Center for Mathematics (HCM), since 01/2020 (associate member since 11/2019)
• Member of the Advisory Board (Kuratorium) of the Fraunhofer SCAI (since 2020)
• Member of the 2021 and 2018 and 2015 Beale-Orchard Hays Prize Committee for Excellence in Computational Mathematical Programming by the Mathematical Optimization Society
• Member of the Steering Committee of ALENEX (SIAM Symposium on Algorithm Engineering and Experiments), 2020 - 2023 (previously also 2012-2017)
• Member of the Supervisory Board of the Helmholtz Center for Information Security (CISPA) in Saarbrücken, since 2019
• Elected Member of the “DFG-Senatsauschuss” and the “DFG-Bewilligungsausschuss” for Collaborative Research Centres (SFB), 01/2013 – 12/2018
• 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 ACM Journal on Experimental Algorithmics since 2013, EURO Journal on Computational Optimization (2012-2020), Mathematical Programming Computation since 2010, Graph Drawing E-print Archive since 2006, Journal of Graph Algorithms and Applications (JGAA) since 2005, and several guest editorials
• PI of many projects funded by the DFG, EU, BMBF, BMWi, and others. Current and past projects can be found here.

• since 2019: Full Professor for Computational Analytics, Institute for Computer Science, University of Bonn
• 2004-2019: 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)

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

• Enhancing Graph Edit Distance Computation: Stronger and Orientation-based ILP Formulations
  Andrea D'ascenzo, Julian Meffert, Petra Mutzel, Fabrizio Rossi
  Proceedings of the VLDB Endowment (VLDB) (core rank A*), Eds.T. Palpanas, P. Pietzuch, N. Tatbul and P. Triantafillou, Vol. 18, no. 11, 2025, pp. 4737-4749, ISSN 2150-8097, doi:10.14778/3749646.3749726

• A Customized SAT-based Solver for Graph Coloring
  Timo Brand, Daniel Faber, Stephan Held, and Petra Mutzel
  SIAM Symposium on Algorithm Engineering and Experiments (ALENEX) 2026, Vancouver, to appear(preprint see: https://arxiv.org/abs/2504.04821)

• Bicriteria Polygon Aggregation with Arbitrary Shapes
  Lotte Blank and David Eppstein and Jan-Henrik Haunert and Herman Haverkort and Benedikt Kolbe and Philip Mayer and Petra Mutzel and Alexander Naumann and Jonas Sauer
  arXiv 2025, https://arxiv.org/pdf/2507.11212

• 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
  arXiv 2025, https://arxiv.org/abs/2505.24438

• Proceedings of the 23rd International Symposium on Experimental Algorithms
  Petra Mutzel and Nicola Prezza
  SEA 2025, July 22–24, 2025, Venice, Italy, LIPIcs, vol. 338, ISBN: 978-3-95977-375-1

• A Simpler Approach for Monotone Parametric Minimum Cut: Finding the Breakpoints in Order
  Arne Beines, Michael Kaibel, Philip Mayer, Petra Mutzel, and Jonas Sauer
  SIAM Symposium on Algorithm Engineering and Experiments (ALENEX) 2025, New Orleans, Louisiana, U.S., Eds. J. Berry and K. Hanauer, SIAM, pp. 29-41, 2025, doi: 10.1137/1.9781611978339.3, (preprint see: https://doi.org/10.48550/arXiv.2410.15920)

• PACE Solver Description: Exact Solution of the One-Sided Crossing Minimization Problem by the MPPEG Team
  Michael Jünger, Paul Jünger, Petra Mutzel, and Gerhard Reinelt
  19th International Symposium on Parameterized and Exact Computation (IPEC 2024). Editors: Édouard Bonnet and Paweł Rzążewski; LIPIcs 321, Article No. 27; pp. 27:1–27:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024), https://doi.org/10.4230/LIPIcs.IPEC.2024.27

• Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings
  Alexander Dobler, Michael Jünger, Paul J. Jünger, Julian Meffert, Petra Mutzel, and Martin Nöllenburg
  32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Editors: Stefan Felsner and Karsten Klein; LIPIcs 320, Article No. 31; pp. 31:1–31:19, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, https://doi.org/10.4230/LIPIcs.GD.2024.31

• SAT Encoding of Partial Ordering Models for Graph Coloring Problems
  Daniel Faber, Adalat Jabrayilov and Petra Mutzel
  27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024), Pune, India, LIPIcs 305, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 12:1-12:20, https://doi.org/10.4230/LIPIcs.SAT.2024.12, also see CoRR https://doi.org/10.48550/arXiv.2403.15961, 2024

• Separator based Data Reduction for the Maximum Cut Problem
  Jonas Charfreitag, Christine Dahn, Michael Kaibel, Philip Mayer, Petra Mutzel, and Lukas Schürmann
  22nd International Symposium on Experimental Algorithms (SEA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 301, pp. 4:1-4:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024), https://doi.org/10.4230/LIPIcs.SEA.2024.4

• Engineering an A-Star Algorithm for the Flip Distance of Plane Triangulations
  Philip Mayer and Petra Mutzel
  International Symposium on Experimental Algorithms (SEA 2024), Vienna, Austria, Leibniz International Proceedings in Informatics (LIPIcs), Volume 301, pp. 23:1-23:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024), https://doi.org/10.4230/LIPIcs.SEA.2024.23

• Delay-Resistant Robust Vehicle Routing with Heterogeneous Time Windows
  Petra Mutzel, Till Niemann, Lukas Schürmann, Sebastian Stiller
  Computers and Operations Research, Elsevier Science, vol. 164, no. 10, issn = 0305-0548, https://doi.org/10.1016/j.cor.2024.106553, 2024

• Clustering Building Footprint Polygons Based on Graph Similarity Measures
  Sophie Duong, Peter Rottmann, Jan{-}Henrik Haunert, and Petra Mutzel
  Proc. 1st {ACM} {SIGSPATIAL} International Workshop on Advances in Urban-AI (UrbanAI 2023), p. 22-31, ACM, https://doi.org/10.1145/3615900.3628790, 2023

• Minimum Error Triangulations for Sea Surface Reconstruction\\ Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman Haverkort, Juergen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel, Heiko Röglin
  Journal of Computational Geometry, vol. 14 (2), p. 108-171, 2023

• A Higher-Order Temporal H-Index for Evolving Networks
  Lutz Oettershagen, Nils M. Kriege, Petra Mutzel
  The 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD 2023), (core rank A*), ACM, p. 1770-1782, https://doi.org/10.1145/3580305.3599242, 2023

• Special issue on selected papers from the 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022)
  Eds. Md. Saidur Rahman, Petra Mutzel and Slamin
  Theoretical Computer Science, vol. 973, https://doi.org/10.1016/j.tcs.2023.114095, 2023

• Special Issue Dedicated to 16th International Conference and Workshops on Algorithms and Computation, WALCOM 2022
  Eds.Md. Saidur Rahman, Petra Mutzel, and Slamin
  Algorithmica 85(11): 3325-3326, 2023

• An Index For Temporal Closeness Computation in Evolving Graphs
  Lutz Oettershagen, Petra Mutzel
  SIAM International Conference on Data Mining (SDM), 2023
  preprint arXiv:2111.10095
  

• A Reduced Cost-based Model Strengthening Method
  Lukas Schürmann and Petra Mutzel
  SIAM Conference on Applied and Computational Discrete Algorithms (ACDA23), Society for Industrial and Applied Mathematics (SIAM), 2023

• Integer Programming for the Maximum Cut Problem: A Refined Model and Implications for Branching
  Jonas Charfreitag, Sven Mallach, and Petra Mutzel
  SIAM Conference on Applied and Computational Discrete Algorithms (ACDA 2023), p. 63-74, SIAM, https://doi.org/10.1137/1.9781611977714.6, 2023

• A Temporal Graphlet Kernel For Classifying Dissemination in Evolving Networks
  Lutz Oettershagen, Nils M. Kriege, Claude Jordan, Petra Mutzel
  SIAM International Conference on Data Mining (SDM), 2023
  also: best paper award at the 18th International Workshop on Mining and Learning with Graphs 2022 arXiv:2209.07332

• TGLib: An Open-Source Library for Temporal Graph Analysis
  Lutz Oettershagen and Petra Mutzel
  2022 IEEE International Conference on Data Mining Workshops (ICDMW), p. 1240-1245, doi: 10.1109/ICDMW58026.2022.00160, 2022

• Vehicle Routing with Heterogeneous Time Windows
  Petra Mutzel, Tim Niemann, Lukas Schürmann, Sebastian Stiller, and Andreas M. Tillmann
  Proceedings of OR2022, 2022

• WALCOM: Algorithms and Computation - 16th International Conference and Workshops (WALCOM 2022)
  Eds. Petra Mutzel, Md. Saidur Rahman and Slamin
  Lecture Notes in Computer Science, 13174, Springer, 2022

• Temporal Walk Centrality: Ranking Nodes in Evolving Networks
  Lutz Oettershagen, Petra Mutzel and Nils Kriege
  WWW '22: The ACM Web Conference (formerly known as International World Wide Web Conference, abbreviated as WWW, core rank A*), ACM, p. 1640-1650, 2022

• Minimum-Error Triangulations for Sea Surface Reconstruction
  Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman Haverkort, Juergen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel, Heiko Röglin
  38th International Symposium on Computational Geometry (SoCG 2022), LIPIcs, vol 224, p. 7:1-7:18, 2022

• McSparse: Exact Solutions of Sparse Maximum Cut and Sparse Unconstrained Binary Quadratic Optimization Problems
  Jonas Charfreitag, Michael Jünger, Sven Mallach, Petra Mutzel
  SIAM Symposium on Algorithm Engineering and Experiments (ALENEX) 2022, Alexandria, Virginia, U.S., Eds. C. A. Philips, B. Speckmann, SIAM, p. 54-66, 2022

• Computing Top-k Temporal Closeness in Temporal Networks
  L. Oettershagen, P. Mutzel
  Knowledge and Information Systems, vol 64, no. 2, 507-535, 2022, Springer

• 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: 85-102

• 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: 76-96

• 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)
  Petra Mutzel, Rasmus Pagh, Grzegorz Herman
  LIPIcs 204, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, ISBN = 978-3-95977-204-4, 2021

• Point feature label placement for multi-page maps on small-screen devices
  Sven Gedicke, Adalat Jabrayilov, Benjamin Niedermann, Petra Mutzel, Jan-Henrik Haunert
  Computers & Graphics, vol. 100, pp. 66-80, ISSN 0097-8493, 2021, Link to video

• Quantum Annealing versus Digital Computing: An Experimental Comparison
  Michael Jünger, Elisabeth Lobe, Petra Mutzel, Gerhard Reinelt, Franz Rendl, Giovanni Rinaldi, and Tobias Stollenwerk
  ACM Journal of Experimental Algorithmics (JEA), Association for Computing Machinery, vol. 26, no. 1, 1.9:1–1.9:30, 2021 (pdf also available here)

• Minimum-Error Triangulation is NP-hard
  Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman Haverkort, Petra Mutzel and Heiko Röglin
  A37th European Workshop on Computational Geometry (EuroCG 2021), April 7-9, 2021, Saint-Petersburg University, Russia

• Fixed-Parameter Algorithms for the Weighted Max-Cut Problem on Embedded 1-Planar Graphs
  Christine Dahn, Nils M. Kriege, Petra Mutzel, Julian Schilling
  Theoretical Computer Science, vol. 825, pp. 172-184, 2021 (also see CoRR abs/1812.03074)

• Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings
  C. Morris, G. Rattan, P. Mutzel
  Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, 2020

• Efficient Top-k Temporal Closeness Calculation in Temporal Networks
  L. Oettershagen, P. Mutzel
  IEEE International Conference on Data Mining (ICDM), 2020

• Spatio-Temporal Top-k Similarity Search for Trajectories in Graphs
  A. Driemel, P. Mutzel, L. Oettershagen
  CoRR abs/2009.06778

• Increasing Virus Test Capacity via Recursive Pool Testing with an Application to SARS-CoV-2 Testing
  P. Mutzel, A. Bertram, P. Jünger, P. Jünger, H. Krieger, S. Schmitz, M. Jünger
  medRxiv, the preprint server for health sciences, 2020.07.02.20144956, Cold Spring Harbor Laboratory Press, Yale University, and BMJ, 2020

• Temporal Graph Kernels for Classifying Dissemination Processes
  Lutz Oettershagen, Nils M. Kriege, Christopher Morris, Petra Mutzel
  SIAM International Conference on Data Mining (SDM 2020), SIAM, pp. 496-504, 2020, preprint: CoRR abs/1911.05496, 2019

• Shrinking Trees not Blossoms: A Recursive Maximum Matching Approach
  Andre Droschinsky, Petra Mutzel, Erik Thordsen
  SIAM Symposium on Algorithm Engineering and Experiments (ALENEX) 2020, Salt Lake City, Eds. G.E. Blelloch and I. Finocchi, 146 – 160, 2020

• TUDataset: A collection of benchmark datasets for learning with graphs
  C. Morris, N. Kriege, F. Bause, K. Kersting, P. Mutzel, M. Neumann
  CoRR abs/2007.08663, 2020

• Crossing Number for Graphs with Bounded Pathwidth
  Therese Biedl, Markus Chimani, Martin Derka and Petra Mutzel
  Algorithmica, vol. 82, no. 2, 355-384, 2020

• Maximum Cut Parameterized by Crossing Number
  Markus Chimani, Christine Dahn, Martina Juhnke-Kubitzke, Nils M. Kriege, Petra Mutzel, Alexander Nover
  Journal of Graph Algorithms and Applications (JGAA), vol 24, no. 3, 2020

• 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 33 (6), 1505-1547, 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, and Tobias Stollenwerk
  CoRR abs/1904-11965, 2019

• Protein Complex Similarity Based on Weisfeiler-Lehman Labeling
  Bianca K. Stöcker, Till Schäfer, Petra Mutzel, Johannes Köster, Nils M. Kriege and Sven Rahmann
  in: Similarity Search and Applications - 12th International Conference (SISAP 2019), Eds. G. Amato, C. Gennaro, V. Oria, M. Radovanovic, LNCS 11807, Springer, 308-322, 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 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)

• 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 Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width (Extended Abstract)
  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
  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, (Preprint: arXiv:1805.00821)

• 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.