Research cooperation with University of Primorska
We cooperate with the goup of Martin Milanič at the Univerza na Primorskem in Koper/Slovenia concering research topics from algorithmic graph theory.
Publications:
- J. Beisegel, M. Chudnovsky, V. Gurvich, M. Milanič, M. Servatius. Avoidable vertices and edges in graphs: Existence, characterization, and applications. Discrete Applied Mathematics, volume 309, pp. 285–300, 2022. DOI 10.1016/j.dam.2021.12.006
- J. Beisegel, C. Denkert, E. Köhler, M. Krnc, N. Pivač, R. Scheffler, and M. Strehler. The Recognition Problem of Graph Search Trees. SIAM Journal on Discrete Mathematics, volume 35(2), pp. 1418–1446, 2021. DOI 10.1137/20M1313301
- J. Beisegel, E. Köhler, R. Scheffler, and M. Strehler. Linear Time LexDFS on Chordal Graphs. In Proceedings of the 28th Annual European Symposium on Algorithms, Track A (ESA 2020), volume 173 of Leibniz International Proceedings in Informatics (LIPIcs), pages 13:1–13:13, 2020. DOI 10.4230/LIPIcs.ESA.2020.13
- J. Beisegel, N. Chiarelli, E. Köhler, M. Krnc, M. Milanič, N. Pivač, R. Scheffler, and M. Strehler. Edge Elimination and Weighted Graph Classes. In Proceedings of the 46th International Workshop on Graph-Theoretic Concepts in Computer Science WG 2020, volume 12301 of Lecture Notes in Computer Science (LNCS), pp. 134–147, 2020. DOI 10.1007/978-3-030-60440-0_11
- J. Beisegel, C. Denkert, E. Köhler, M. Krnc, N. Pivač, R. Scheffler, and M. Strehler. On the End-Vertex Problem of Graph Searches. Discrete Mathematics & Theoretical Computer Science, volume 21(1), 2019. DOI 10.23638/DMTCS-21-1-13
- J. Beisegel, M. Chudnovsky, V. Gurvich, M. Milanič, M. Servatius. Avoidable Vertices and Edges in Graphs. In Proceedings of the 16th Workshop on Algorithms and Data Structures (WADS 2019), volume 11646 of Lecture Notes in Computer Science (LNCS), pp. 126–139, 2019. DOI 10.1007/978-3-030-24766-9_10
- J. Beisegel, C. Denkert, E. Köhler, M. Krnc, N. Pivač, R. Scheffler, and M. Strehler: Recognizing Graph Search Trees. In Proceedings of the 10th Latin and American Algorithms, Graphs and Optimization Symposium LAGOS 2019, Electronic Notes in Theoretical Computer Science, pp. 99-110, 2019. DOI 10.1016/j.entcs.2019.08.010 Preprint arXiv:1811.09249
Funding
The collaboration was funded by the DAAD within the projects Graph searching, graph classes, and generalizations of chordality and Graph structures and efficent algorithms for optimization (PPP Slovenia).