Differences
This shows you the differences between two versions of the page.
staff:mutzel [2018-05-10 16:52] |
staff:mutzel [2018-07-10 19:20] |
||
---|---|---|---|
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 engineering, experimental algorithms | + | * Algorithm Engineering, in particular graph algorithms and data structures |
- | * Graph algorithms, data structures | + | * Computational Analytics |
- | * Combinatorial optimization | + | * Algorithmic Data Analysis, Graph 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 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=de| Google 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. Kriege, Matthias Fey, Denis 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) | + | * **[[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 | ||
- | * ** 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]]) | + | * **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 |
- | * ** 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.07515| CoRR abs/1803.07515]]) | + | * ** [[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 // | ||
- | * ** New Integer Linear Programming Models for the Vertex Coloring Problem** \\ // Adalat Jabrayilov and Petra Mutzel // \\ 13th Latin American Theoretical INformatics Symposium (LATIN 2018), LNCS, Springer, to appear | + | * **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. 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), 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ü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 | + | * ** The Crossing Number of Seq-Shellable Drawings of Complete Graphs ** \\ // Petra Mutzel, Lutz Oettershagen // \\ International Workshop on Combinatorial Algorithms 2018, IWOCA 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 2018, IWOCA 2018, to appear (and [[https://arxiv.org/abs/1803.07515| CoRR abs/1803.07515]]) |
- | * ** Erratum to: A 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, 2017, submitted // | + | |
+ | * ** [[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 Vision, Imaging and Computer Graphics Theory and Applications (VISIGRAPP) 2018, vol. 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 259: | ||
* **[[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 |