Petra Mutzel

Petra Mutzel is a German computer scientist, a University Professor of computer science at the Technical University of Dortmund.[1] Her research is in the areas of algorithm engineering, graph drawing and combinatorial optimization.

Education and career

Mutzel earned a diploma in 1990 from the University of Augsburg, in mathematics with computer science. She then earned a doctorate in computer science from the University of Cologne in 1994 under the supervision of Michael Jünger,[1][2] and her habilitation in 1999 from the Max Planck Institute for Informatics. She held a professorship at the Vienna University of Technology beginning in 1999 before moving to Dortmund in 2004.[1]

Contributions

In graph drawing, Mutzel has contributed in work on planarization,[3] crossing minimization in layered graph drawing,[4] and SPQR trees,[5] and co-edited a book on graph drawing.[6] She was both the program chair and organizational chair of the 9th International Symposium on Graph Drawing, in Vienna in 2001.[7]

Mutzel's other contributions include works on the Ising model,[8] steganography,[9] and Steiner trees.[10] In 2012, she was program committee co-chair of the Meeting on Algorithm Engineering and Experiments (ALENEX).[11]

Selected publications
  • De Simone, C.; Diehl, M.; Jünger, M.; Mutzel, P.; Reinelt, G.; Rinaldi, G. (July 1995), "Exact ground states of Ising spin glasses: New experimental results with a branch-and-cut algorithm", Journal of Statistical Physics, 80 (1–2): 487–496, CiteSeerX 10.1.1.30.4226, doi:10.1007/BF02178370.
  • Jünger, M.; Mutzel, P. (1996), "Maximum planar subgraphs and nice embeddings: practical layout tools", Algorithmica, 16 (1): 33–59, CiteSeerX 10.1.1.41.3987, doi:10.1007/s004539900036, MR 1394493.
  • Jünger, Michael; Mutzel, Petra (1997), "2-layer straightline crossing minimization: performance of exact and heuristic algorithms", Journal of Graph Algorithms and Applications, 1 (1): 1–25, CiteSeerX 10.1.1.41.9180, doi:10.7155/jgaa.00001, MR 1478845.
  • Gutwenger, Carsten; Mutzel, Petra (2001), "A linear time implementation of SPQR-trees", Graph Drawing: 8th International Symposium, GD 2000 Colonial Williamsburg, VA, USA, September 20–23, 2000, Proceedings, Lecture Notes in Computer Science, 1984, Berlin: Springer-Verlag, pp. 77–90, doi:10.1007/3-540-44541-2_8, ISBN 978-3-540-41554-1.
  • Jünger, Michael; Mutzel, Petra, eds. (2004), Graph Drawing Software, Mathematics and Visualization, Berlin: Springer-Verlag, doi:10.1007/978-3-642-18638-7, ISBN 978-3-540-00881-1, MR 2159308.
  • Hetzl, Stefan; Mutzel, Petra (2005), "A graph–theoretic approach to steganography", Communications and Multimedia Security: 9th IFIP TC-6 TC-11 International Conference, CMS 2005, Salzburg, Austria, September 19 – 21, 2005, Proceedings, Lecture Notes in Computer Science, 3677, Berlin: Springer-Verlag, pp. 119–128, doi:10.1007/11552055_12, ISBN 978-3-540-28791-9.
  • Ljubić, Ivana; Weiskircher, René; Pferschy, Ulrich; Klau, Gunnar W.; Mutzel, Petra; Fischetti, Matteo (2006), "An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem", Mathematical Programming, 105 (2–3, Ser. B): 427–449, CiteSeerX 10.1.1.219.5353, doi:10.1007/s10107-005-0660-x, MR 2190829.
gollark: <:bees:724389994663247974>, in general.
gollark: What?
gollark: Our modern laser systems fire through wormholes to arbitrary space-bee-time coordinates, so that is unlikely to be an effective defense.
gollark: Don't worry, GTech™ orbital lawsuit lasers are standing by for defense.
gollark: Email 1% of your money per day to GTech™ money intake 3.

References
  1. Faculty profile, TU Dortmund, retrieved 2014-07-04.
  2. Petra Mutzel at the Mathematics Genealogy Project
  3. Jünger & Mutzel (1996).
  4. Jünger & Mutzel (1997).
  5. Gutwenger & Mutzel (2001).
  6. Jünger & Mutzel (2004).
  7. GD 2001 Archived 2013-04-30 at the Wayback Machine web site, retrieved 2014-07-04.
  8. De Simone et al. (1995).
  9. Hetzl & Mutzel (2005).
  10. Ljubić et al. (2006).
  11. ALENEX 2012 web site, retrieved 2014-07-04.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.