Forschungskooperation mit Universität Primorska

Wir kooperieren mit der Arbeitsgruppe von Martin Milanič an der Univerza na Primorskem in Koper/Slowenien zu Forschungsfragen aus der algorithmischen Graphentheorie.

Publikationen:

  • J. Beisegel, N. Chiarelli, E. Köhler, M. Milanič, P. Muršič, R. Scheffler. The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs. 19th Scandinavian Symposium on Algorithm Theory (SWAT 2024). LIPIcs 294, Schloss Dagstuhl, S. 7:1–7:20, 2024. DOI 10.4230/LIPIcs.SWAT.2024.7 Preprint arXiv:2404.10670
  • 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, pages 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), pages 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), pages 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), pages 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

Finanzierung

Die Zusammenarbeit wurde vom DAAD innerhalb der Projekte Graph searching, graph classes, and generalizations of chordality und Graph structures and efficent algorithms for optimization (PPP Slowenien) gefördert.