You are here:: TU Dortmund > Department of Computer Science > Chair 11: ALGORITHM ENGINEERING > Staff > Professor Dr. Petra Mutzel
 

Table of Contents

Professor Dr. Petra Mutzel

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.

Research Topics

  • 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, …

Recent Invited Talk

Recent Program Committee Memberships

Projects

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.

Awards, Scientific Honours

  • 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

Selected Activities

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

Teaching

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

Recent Publications

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

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

Education and Positions

  • 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)
 
Last modified: 2020-02-19 18:08 (external edit)
DokuWiki — RSS-Feed —
Barrierefreiheit   Datenschutzerklärung   Impressum