Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
staff:mutzel [2018-06-13 09:00]
Petra Mutzel
staff:mutzel [2018-09-24 10:40] (current)
Petra Mutzel
Line 16: Line 16:
 ===== Research Topics ===== ===== Research Topics =====
  
-  * Algorithm ​engineeringexperimental ​algorithms +  * Algorithm ​Engineeringin particular graph algorithms ​and data structures 
-  * Graph algorithmsdata structures +  * Computational Analytics 
-  * Combinatorial ​optimization +  * Algorithmic Data AnalysisGraph Mining 
-  * Algorithmic data analysis, graph mining +  * Combinatorial ​Optimization (polynomial time and ILP-based) 
-  * Graph drawing, visualization of discrete structures +  * Network Design and Optimization 
-  * Network design ​and optimisation ​ +  * Graph and Network Visualization 
-  * Application areas: network analysis, cheminformatics (drug design), information visualization,​ network design and optimization (e.g. Steiner tree, shortest path), computational biology, physics, ...  +  * 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, ... 
 ===== Upcoming Invited Talks ===== ===== Upcoming Invited Talks =====
  
Line 84: Line 84:
    * 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)    * 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 10 Ph.D. students since 2001    * Successfully completed the supervision of 10 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 ​since 2014) and the SK Fin: Senatskommission für Finanzen of the TU Dortmund (2014-2016).+   * 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 ===== ===== Teaching =====
Line 93: Line 93:
 ===== Recent Publications ===== ===== Recent Publications =====
  
-Also see [[http://www.zentralblatt-math.org/​ioport/​en/?q=au:​Mutzel%2C%20P*|io-port.net]] and [[http://​www.informatik.uni-trier.de/​~ley/​db/​indices/​a-tree/​m/​Mutzel:​Petra.html|DBLP]]. My ORCID code is  [[https://​orcid.org/​0000-0001-7621-971X | 0000-0001-7621-971X]].+Also see [[https://scholar.google.de/citations?user=XIaaJv8AAAAJ&​hl=deGoogle Scholar (h-index >= 40)]] and [[http://​www.informatik.uni-trier.de/​~ley/​db/​indices/​a-tree/​m/​Mutzel:​Petra.html|DBLP]] or [[http://​www.zentralblatt-math.org/​ioport/​en/?​q=au:​Mutzel%2C%20P*|io-port.net]]. My ORCID code is  [[https://​orcid.org/​0000-0001-7621-971X | 0000-0001-7621-971X]]. 
 + 
 +  * ** 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,​ to appear 2018 
 + 
 +  * **[[https://​arxiv.org/​abs/​1806.10697|A new Integer Linear Program for the Steiner Tree Problem with Revenues, 
 +  Budget and Hop Constraints]]** ​ \\ // Adalat Jabrayilov and Petra Mutzel // \\ arXiv:​1806.10697 
 +   
 +  * **[[http://​www.mdpi.com/​2078-2489/​9/​7/​153|More Compact Orthogonal Drawings by Allowing Additional Bends]]** \\ // Michael Jünger, Petra Mutzel and Christine Spisla // \\ Information 2018, 9 (7), MDPI, doi:​10.3390/​info9010001
  
   * **Largest Weight Common Subtree Embeddings with Distance Penalties** (Preprint [[https://​arxiv.org/​abs/​1805.00821|arXiv:​1805.00821]]) \\ Andre Droschinsky,​ Nils M. Kriege, Petra Mutzel \\ International Symposium on Mathematical Foundations of Computer Science (MFCS) 2018, to appear   * **Largest Weight Common Subtree Embeddings with Distance Penalties** (Preprint [[https://​arxiv.org/​abs/​1805.00821|arXiv:​1805.00821]]) \\ Andre Droschinsky,​ Nils M. Kriege, Petra Mutzel \\ International Symposium on Mathematical Foundations of Computer Science (MFCS) 2018, to appear
  
   * ** [[https://​arxiv.org/​abs/​1805.06780 | The Crossing Number of Single-Pair-Seq-Shellable Drawings of Complete   * ** [[https://​arxiv.org/​abs/​1805.06780 | The Crossing Number of Single-Pair-Seq-Shellable Drawings of Complete
-  Graphs ]]** \\ // Petra Mutzel, Lutz Oettershagen // \\  CoRR abs/​1805.06780+  Graphs ]]** \\ // Petra Mutzel, Lutz Oettershagen // \\  CoRR abs/​1805.06780, Canadian Conference on Computational Geometry (CCCG) 2018, to appear
   ​   ​
   * ** A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs ** \\ // Nils M. Kriege, Andre Droschinsky,​ Petra Mutzel, 2017, [[https://​arxiv.org/​abs/​1805.10754| CoRR abs/​1805.10754]],​ submitted //    * ** A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs ** \\ // Nils M. Kriege, Andre Droschinsky,​ Petra Mutzel, 2017, [[https://​arxiv.org/​abs/​1805.10754| CoRR abs/​1805.10754]],​ submitted // 
Line 254: Line 261:
  
    * **[[http://​dx.doi.org/​10.1007/​978-3-642-03456-5|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    * **[[http://​dx.doi.org/​10.1007/​978-3-642-03456-5|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 ===== ===== Education and Positions =====
    * since 2004 Full Professor (C4) for Algorithm Engineering / Experimental Algorithms, Computer Science Department, Technische Universität Dortmund    * since 2004 Full Professor (C4) for Algorithm Engineering / Experimental Algorithms, Computer Science Department, Technische Universität Dortmund
 
Last modified: 2018-06-13 09:00 by Petra Mutzel
DokuWikiRSS-Feed