Ekkehard Köhler

1. PRŽULJ, Nataša, CORNEIL, D. G., KÖHLER, Ekkehard. Hereditary dominating pair graphs. Discrete applied mathematics. [Print ed.]. 2004, vol. 134, iss. 1/3, str. 239-261, ilustr. ISSN 0166-218X. DOI: 10.1016/S0166-218X(03)00304-4. [COBISS.SI-ID 1024351041]

2. BEISEGEL, Jesse, DENKERT, Carolin, KÖHLER, Ekkehard, KRNC, Matjaž, PIVAČ, Nevena, SCHEFFLER, Robert, STREHLER, Martin. On the end-vertex problem. In: Abstract book. 10th International Colloquium on Graph Theory and combinatorics, July 9-13, 2018, Lyon, France. [S. l.: s. n.], 2018. Str. 66. https://projet.liris.cnrs.fr/~icgt2018/data/uploads/booklet.pdf, Repozitorij Univerze na Primorskem - RUP. [COBISS.SI-ID 15664131]

3. KRNC, Matjaž, BEISEGEL, Jesse, DENKERT, Carolin, KÖHLER, Ekkehard, PIVAČ, Nevena, SCHEFFLER, Robert, STREHLER, Martin. On the end-vertex problem of graph searches. In: CABELLO, Sergio (ed.), MOHAR, Bojan (ed.). Abstracts of the 9th Slovenian International Conference on Graph Theory, Bled, Slovenia, June 23-29, 2019. Ljubljana: Institute of Mathematics, Physics and Mechanics, IMFM, 2019. Str. 150. ISBN 978-961-92681-1-7. https://conferences.matheo.si/event/28/material/0/4.pdf. [COBISS.SI-ID 18687321]

4. BEISEGEL, Jesse, DENKERT, Carolin, KÖHLER, Ekkehard, KRNC, Matjaž, PIVAČ, Nevena, SCHEFFLER, Robert, STREHLER, Martin. On the end-vertex problem of graph searches. Discrete mathematics & theoretical computer science. 2019, vol. 21, no. 1, str. 1-20. ISSN 1365-8050. https://dmtcs.episciences.org/5572, Repozitorij Univerze na Primorskem - RUP. [COBISS.SI-ID 1541461444]

5. BEISEGEL, Jesse, DENKERT, Carolin, KÖHLER, Ekkehard, KRNC, Matjaž, PIVAČ, Nevena, SCHEFFLER, Robert, STREHLER, Martin. Recognizing graph search trees. In: COUTINHO, Gabriel (ed.). The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019) : 2-7 June 2019, Belo Horizonte, Brazil. Amsterdam: Elsevier, cop. 2019. Vol. 346, str. 99-110. Electronic notes in theoretical computer science, Vol. 346. ISSN 1571-0661. https://doi.org/10.1016/j.entcs.2019.08.010, Repozitorij Univerze na Primorskem - RUP, DOI: 10.1016/j.entcs.2019.08.010. [COBISS.SI-ID 1541575108]

6. BEISEGEL, Jesse, CHIARELLI, Nina, KÖHLER, Ekkehard, KRNC, Matjaž, MILANIČ, Martin, PIVAČ, Nevena, SCHEFFLER, Robert, STREHLER, Martin. Edge elimination and weighted graph classes. In: ADLER, Isolde (ed.), MÜLLER, Haiko (ed.). Graph-theoretic concepts in computer science : revised selected papers. 46th International Workshop, WG 2020 Leeds, UK, June 24-26, 2020. Cham: Springer, cop. 2020. Str. 134-147. Lecture notes in computer science, 12301. ISBN 978-3-030-60439-4, ISBN 978-3-030-60440-0. ISSN 0302-9743. https://link.springer.com/chapter/10.1007%2F978-3-030-60440-0_11, Repozitorij Univerze na Primorskem - RUP, DOI: 10.1007/978-3-030-60440-0_11. [COBISS.SI-ID 36186883]

7. MILANIČ, Martin, BEISEGEL, Jesse, CHIARELLI, Nina, KÖHLER, Ekkehard, KRNC, Matjaž, PIVAČ, Nevena, SCHEFFLER, Robert, STREHLER, Martin. Edge elimination schemes of weighted graph classes, Workshop on Graph Modification algorithms, experiments and new problems, 23rd - 24th January 2020, Bergen, Norway. Repozitorij Univerze na Primorskem - RUP. [COBISS.SI-ID 16092675]

8. BEISEGEL, Jesse, DENKERT, Carolin, KÖHLER, Ekkehard, KRNC, Matjaž, PIVAČ, Nevena, SCHEFFLER, Robert, STREHLER, Martin. The recognition problem of graph search trees. SIAM journal on discrete mathematics. 2021, vol. 35, no. 2, str. 1418-1446, ilustr. ISSN 0895-4801. https://epubs.siam.org/doi/10.1137/20M1313301, Repozitorij Univerze na Primorskem - RUP, DOI: 10.1137/20M1313301. [COBISS.SI-ID 80433667]

9. BEISEGEL, Jesse, CHIARELLI, Nina, KÖHLER, Ekkehard, MILANIČ, Martin, MURŠIČ, Peter, SCHEFFLER, Robert. The simultaneous interval number : a new width parameter that measures the similarity to interval graphs. In: BODLAENDER, Hans L. (ed.). 19th Scandinavian Symposium and Workshops on Algorithm Theory : SWAT 2024, June 12-14, 2024, Helsinki, Finland. Saarbrücken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik: Dagstuhl Publishing, 2024. Str. 7:1–7:20, ilustr. LIPIcs - Leibniz International Proceedings in Informatics, vol. 294. ISBN 978-3-95977-318-8. ISSN 1868-8969. https://doi.org/10.4230/LIPIcs.SWAT.2024.7, https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.7, DOI: 10.4230/LIPIcs.SWAT.2024.7. [COBISS.SI-ID 202553859]