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-05-10 16:52]
Petra Mutzel
staff:mutzel [2018-09-24 10:40] (current)
Petra Mutzel
Line 10: Line 10:
 | Fax: | +49 231 755 7740 | | Fax: | +49 231 755 7740 |
 | E-Mail: | petra.mutzel{{:​staff:​at.gif|}}cs.tu-dortmund.de| | E-Mail: | petra.mutzel{{:​staff:​at.gif|}}cs.tu-dortmund.de|
-| Consultation hours: | SS 2018: Mi 11:30 12:30 Uhr |+| Consultation hours: | SS 2018: Di 14:00 15:00 Uhr |
  
-Die Sprechstunde entfällt am 16. Mai 2018. 
 Bitte vereinbaren Sie bei Bedarf sowie in der vorlesungsfreien Zeit einen Termin via Email. Bitte vereinbaren Sie bei Bedarf sowie in der vorlesungsfreien Zeit einen Termin via Email.
  
 ===== 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 85: 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 94: 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]].
  
-  * ** Recognizing Cuneiform Signs Using Graph Based Methods ​** \\ // Nils M. KriegeMatthias FeyDenis Fisseler, Petra Mutzel, ​Frank Weichert, // \\ International Workshop ​on Cost-Sensitive Learning (COST) 2018, Proceedings of Machine Learning Research (PMLR), to appear 2018 (and CoRR abs/​1802.05908,​ 2018)+  * ** Bishellable drawings of Kn ** \\ //Bernardo ​M. AbregoOswin AichholzerSilvia Fernandez-Merchant,​ Dan McQuillan, Bojan Mohar, Petra Mutzel, ​Pedro RamosR. Bruce Richter, and Birgit Vogtenhuber ​// \\ SIAM Journal ​on Discrete Mathematics, to appear 2018
  
-  * ** The Crossing Number of Seq-Shellable Drawings of Complete Graphs ​** \\ // Lutz Oettershagen, ​Petra Mutzel // \\ International Workshop on Combinatorial Algorithms 2018, IWOCA 2018, to appear (and [[https://arxiv.org/abs/1803.10983| CoRR abs/1803.10983]])+  * **[[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
  
-  * ** A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs ​**\\ // Christine Dahn, Nils M. Kriege, Petra Mutzel // \\ International Workshop on Combinatorial Algorithms 2018, IWOCA 2018, to appear ​(and [[https://​arxiv.org/​abs/​1803.07515CoRR abs/1803.07515]])+  * **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
  
-  * ** New Integer Linear Programming Models for the Vertex Coloring Problem** \\ // Adalat Jabrayilov ​and Petra Mutzel // \\ 13th Latin American Theoretical INformatics Symposium ​(LATIN 2018), ​LNCSSpringer, to appear+  * ** [[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,​ 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 Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs** (Preprint [[https://​arxiv.org/​abs/​1803.10983|arXiv:​1803.10983]]) ​\\ Christine Dahn, Nils M. Kriege, Petra Mutzel \\ International Workshop on Combinatorial Algorithms ​(IWOCA) ​2018, accepted. 
 + 
 +  * **Recognizing Cuneiform Signs Using Graph Based Methods** (Preprint [[https://​arxiv.org/​abs/​1802.05908|arXiv:​1802.05908]]\\ Nils M. KriegeMatthias FeyDenis 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), to appear
  
   * ** [[https://​onlinelibrary.wiley.com/​doi/​epdf/​10.1002/​cmdc.201700689| 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;​ [[https://​onlinelibrary.wiley.com/​doi/​full/​10.1002/​cmdc.201800126#​ |we also got the cover feature for this article]]   * ** [[https://​onlinelibrary.wiley.com/​doi/​epdf/​10.1002/​cmdc.201700689| 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;​ [[https://​onlinelibrary.wiley.com/​doi/​full/​10.1002/​cmdc.201800126#​ |we also got the cover feature for this article]]
  
-  * ** Orthogonal Compaction Using Additional Bends** \\ // M. JüngerP. Mutzel and C. Spisla ​// \\ Proc. of the 13th International ​Joint Conference ​on Computer VisionImaging and Computer Graphics Theory and Applications (VISIGRAPP) ​2018, vol3: IVAPP, SciTePress, 144-155, 2018+  * ** The Crossing Number of Seq-Shellable Drawings of Complete Graphs ​** \\ // Petra MutzelLutz Oettershagen ​// \\ International ​Workshop ​on Combinatorial Algorithms 2018IWOCA 2018, to appear (and [[https://​arxiv.org/​abs/​1803.10983| CoRR abs/​1803.10983]])
  
-  * **[[https://​doi.org/​10.5220/​0006713301440155| 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+  * ** A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar ​Graphs **\\ // Christine Dahn, Nils M. Kriege, Petra Mutzel // \\ International Workshop on Combinatorial Algorithms 2018IWOCA 2018, to appear (and [[https://​arxiv.org/​abs/​1803.07515| CoRR abs/​1803.07515]])
  
-  * ** Erratum toA polynomial-time maximum common subgraph algorithm ​for  +  * ** [[https://​doi.org/​10.1007/​978-3-319-77404-6_47 |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 
-outerplanar graphs ​and its application to chemoinformatics ​** \\ // Nils M. Kriege, A. Droschinsky, P. Mutzel, ​2017submitted ​// + 
 +  * ** [[https://​doi.org/​10.5220/​0006713301440155 |Orthogonal Compaction Using Additional Bends]]** \\ // M. Jünger, P. Mutzel ​and C. Spisla // \\ Proc. of the 13th International Joint Conference on Computer VisionImaging and Computer Graphics Theory and Applications (VISIGRAPP) 2018vol. 3: IVAPP, SciTePress, 144-155, 2018 
 + 
 +  * **[[https://doi.org/​10.5220/​0006713301440155| 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
  
   * **[[http://​drops.dagstuhl.de/​opus/​volltexte/​2017/​8257| 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.   * **[[http://​drops.dagstuhl.de/​opus/​volltexte/​2017/​8257| 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.
Line 249: 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-05-10 16:52 by Petra Mutzel
DokuWikiRSS-Feed