Differences
This shows you the differences between two versions of the page.
staff:mutzel [2018-07-10 20:58] |
staff:mutzel [2019-03-16 14:28] |
||
---|---|---|---|
Line 93: | Line 93: | ||
===== Recent Publications ===== | ===== Recent Publications ===== | ||
- | 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]]. | + | Also see [[https://scholar.google.de/citations?user=XIaaJv8AAAAJ&hl=de| Google Scholar (h-index >= 41)]] 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]]. |
+ | |||
+ | * **[[https://doi.org/10.4230/LIPIcs.STACS.2019.3|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 | ||
+ | |||
+ | * **[[https://epubs.siam.org/doi/abs/10.1137/17M1147974?af=R|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 [[http://arxiv.org/abs/1510.00549 | CoRR abs/1510.00549]]) | ||
+ | |||
+ | * **[[https://doi.org/10.7155/jgaa.00480| A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs]]** \\ // Nils M. Kriege, Andre Droschinsky, Petra Mutzel, Journal of Graph Algorithms and Applications// \\ vol. 22, no. 4, 607-616, 2018 | ||
+ | |||
+ | * **On the Enumeration of Bicriteria Temporal Paths**\\ // Lutz Oettershagen and Petra Mutzel // \\ Theory and Applications of Models of Computation (TAMC 2019), LNCS 11436, Springer, to appear 2019, also see [[https://arxiv.org/abs/1812.02507| CoRR abs/1812.02507]] | ||
* **[[https://arxiv.org/abs/1806.10697|A new Integer Linear Program for the Steiner Tree Problem with Revenues, | * **[[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 | + | Budget and Hop Constraints]]** \\ // Adalat Jabrayilov and Petra Mutzel // \\ In: Proceedings of Algorithm Engineering & Experiments (ALENEX 2019), SIAM, 2019, 107-116 (also see CoRR abs/1806.10697) |
+ | |||
+ | * **[[https://arxiv.org/abs/1803.10983|Fixed-Parameter Algorithms for the Weighted Max-Cut Problem on Embedded 1-Planar Graphs]]** \\ // Christine Dahn, Nils M. Kriege, Petra Mutzel, Julian Schilling // \\ CoRR abs/1805.06780 (and submitted to Journal) | ||
| | ||
- | * **[[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 | + | * **[[http://doi.org/10.1007/978-3-030-04414-5\_13|A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width]]** \\ // Michael Jünger, Petra Mutzel and Christine Spisla // \\ Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Lecture Notes in Computer Science 11282, Springer, 187-199, 2018 |
- | * **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 | + | * **[[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), art-no. 153, MDPI, doi:10.3390/info9010001 |
- | * ** [[https://arxiv.org/abs/1805.06780 | The Crossing Number of Single-Pair-Seq-Shellable Drawings of Complete | + | * **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 \\ 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 |
- | Graphs ]]** \\ // Petra Mutzel, Lutz Oettershagen // \\ CoRR abs/1805.06780, Canadian Conference on Computational Geometry (CCCG) 2018, to appear | + | |
+ | * ** [[https://arxiv.org/abs/1805.06780 | The Crossing Number of Single-Pair-Seq-Shellable Drawings of Complete Graphs ]]** \\ // Petra Mutzel, Lutz Oettershagen // \\ Proceedings of the 30th Canadian Conference on Computational Geometry (CCCG), 11-17, 2018, also see [[https://arxiv.org/abs/1805.06780| CoRR abs/1805.06780]] | ||
| | ||
- | * ** 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]] // |
- | * **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. | + | * **[[http://proceedings.mlr.press/v88/|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), vol. 88, 31-44, 2018 |
- | + | ||
- | * **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]] | ||
- | * ** 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]]) | + | * ** 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 [[https://arxiv.org/abs/1803.10983| 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 // \\ International Workshop on Combinatorial Algorithms 2018, IWOCA 2018, to appear (and [[https://arxiv.org/abs/1803.07515| CoRR abs/1803.07515]]) | + | * ** 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 [[https://arxiv.org/abs/1803.07515| CoRR abs/1803.07515]]) |
* ** [[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 | * ** [[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 | ||
Line 122: | Line 131: | ||
* **[[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 | * **[[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 | ||
+ | |||
+ | * **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. | ||
* **[[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. |