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
mutzel:start [2019-01-11 14:57]
Petra Mutzel [Selected Recent Publications]
mutzel:start [2019-04-01 11:39] (current)
Bernd Zey
Line 14: Line 14:
  
   * [[staff:​mutzel|Prof. Dr. Petra Mutzel]]   * [[staff:​mutzel|Prof. Dr. Petra Mutzel]]
 +  * [[staff:​charfreitag|Jonas Charfreitag]]
   * [[staff:​dahn|Christine Dahn]]   * [[staff:​dahn|Christine Dahn]]
   * [[staff:​droschinsky|Andre Droschinsky]]   * [[staff:​droschinsky|Andre Droschinsky]]
Line 57: Line 58:
 ===== Selected Recent Publications =====  ===== Selected Recent Publications =====
  
-  * 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,
Line 85: Line 86:
  
   * ** 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]])   * ** 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]])
 +
 +  * **On Maximum Common Subgraph Problems in Series-Parallel Graphs** \\ // Nils Kriege, Florian Kurpicz, Petra Mutzel // \\ European Journal of Combinatorics,​ Elsevier, vol. 68, 75-95, 2018 
  
   * ** 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   * ** 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
 +
 +  * **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.
Line 92: Line 97:
   * ** Erratum to: A polynomial-time maximum common subgraph algorithm for    * ** Erratum to: A polynomial-time maximum common subgraph algorithm for 
 outerplanar graphs and its application to chemoinformatics ** \\ // Nils M. Kriege, A. Droschinsky,​ P. Mutzel //  outerplanar graphs and its application to chemoinformatics ** \\ // Nils M. Kriege, A. Droschinsky,​ P. Mutzel // 
- 
-  * **On Maximum Common Subgraph Problems in Series-Parallel Graphs** \\ // Nils Kriege, Florian Kurpicz, Petra Mutzel // \\ European Journal of Combinatorics,​ Elsevier, vol. 68, 75-95, 2018  
  
   * **[[http://​arxiv.org/​abs/​1604.08147 | Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem]]** \\ // Fritz Boekler and Petra Mutzel // \\ 11th International Conference and Workshop on Algorithms and Computation (WALCOM), LNCS 10167, Springer, 190-203, 2017   * **[[http://​arxiv.org/​abs/​1604.08147 | Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem]]** \\ // Fritz Boekler and Petra Mutzel // \\ 11th International Conference and Workshop on Algorithms and Computation (WALCOM), LNCS 10167, Springer, 190-203, 2017
 
Last modified: 2019-01-11 14:57 by Petra Mutzel
DokuWikiRSS-Feed