Differences
This shows you the differences between two versions of the page.
staff:mutzel [2018-06-13 08:52] |
staff:mutzel [2018-06-13 09:00] |
||
---|---|---|---|
Line 99: | Line 99: | ||
* ** [[https://arxiv.org/abs/1805.06780 | The Crossing Number of Single-Pair-Seq-Shellable Drawings of Complete | * ** [[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 | Graphs ]]** \\ // Petra Mutzel, Lutz Oettershagen // \\ 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 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. | * **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 | * **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]] | ||
* ** 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, to appear (and [[https://arxiv.org/abs/1803.10983| CoRR abs/1803.10983]]) | ||
Line 109: | Line 113: | ||
* ** [[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 | ||
- | |||
- | * ** [[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://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 |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 | ||
- | |||
- | * ** Erratum to: A polynomial-time maximum common subgraph algorithm for | ||
- | outerplanar graphs and its application to chemoinformatics ** \\ // Nils M. Kriege, A. Droschinsky, P. Mutzel, 2017, submitted // | ||
* **[[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. |