Differences

This shows you the differences between two versions of the page.

Link to this comparison view

staff:mutzel [2018-05-20 13:07]
staff:mutzel [2018-05-20 22:47]
Line 95: Line 95:
 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 [[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]].
  
-  * ** 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/​1805.06780 | The Crossing Number of Single-Pair-Seq-Shellable Drawings of Complete 
 +  Graphs ]]** \\ // Petra Mutzel, ​Lutz Oettershagen ​// \\  CoRR abs/1805.06780
  
-  * ** 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]])+  ​* ** 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 [[https://​arxiv.org/​abs/​1802.05908|CoRR abs/​1802.05908]],​ 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]])
  
   * ** 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 // \\ International Workshop on Combinatorial Algorithms 2018, IWOCA 2018, to appear (and [[https://​arxiv.org/​abs/​1803.07515| CoRR abs/​1803.07515]])
  
-  * ** 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+  * ** [[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://​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+  * ** [[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   * **[[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
 
Last modified: 2020-02-19 18:08 (external edit)
DokuWikiRSS-Feed