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 [2019-01-11 14:16]
Petra Mutzel [Recent Publications]
staff:mutzel [2019-03-16 14:29] (current)
Petra Mutzel
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 >= 42)]] 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://​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]])
Line 99: Line 101:
   * **[[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   * **[[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]]+  ​* **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 // \\ In: Proceedings of Algorithm Engineering & Experiments (ALENEX 2019), SIAM, 2019, to appear ​(also see CoRR abs/​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)    * **[[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)
Line 129: 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.
 
Last modified: 2019-01-11 14:16 by Petra Mutzel
DokuWikiRSS-Feed