Publication Records

AGAOGLU CAGIRICI, Deniz and Petr HLINĚNÝ. Efficient Isomorphism for Sd-Graphs and T-Graphs. ALGORITHMICA. UNITED STATES: SPRINGER, 2023, vol. 85, No 2, p. 352-383. ISSN 0178-4617. Available from: https://dx.doi.org/10.1007/s00453-022-01033-8.

AGAOGLU CAGIRICI, Deniz, Onur CAGIRICI, Jan DERBISZ, Tim HARTMANN, Petr HLINĚNÝ, Jan KRATOCHVÍL, Tomasz KRAWCZYK and Peter ZEMAN. Recognizing H-Graphs - Beyond Circular-Arc Graphs. Online. In Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David. 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik, 2023, p. "8:1"-"8:14", 14 pp. ISBN 978-3-95977-292-1. Available from: https://dx.doi.org/10.4230/LIPIcs.MFCS.2023.8.

AGAOGLU CAGIRICI, Deniz and Petr HLINĚNÝ. Isomorphism Testing for T-graphs in FPT. In Mutzel, P., Rahman, M.S., Slamin. WALCOM: Algorithms and Computation. LNCS 13174. Cham: Springer, Cham, 2022, p. 239-250. ISBN 978-3-030-96730-7. Available from: https://dx.doi.org/10.1007/978-3-030-96731-4_20.

AGAOGLU, Deniz and Onur CAGIRICI. Unit Disk Visibility Graphs. Online. In Nešetřil, Jaroslav and Perarnau, Guillem and Rué, Juanjo and Serra, Oriol. Extended Abstracts EuroComb 2021. Cham: Springer International Publishing, 2021, p. 390-396. ISBN 978-3-030-83822-5. Available from: https://dx.doi.org/10.1007/978-3-030-83823-2_61.

AGAOGLU, Deniz and Petr HLINĚNÝ. Isomorphism Problem for Sd-Graphs. Online. In Javier Esparza and Daniel Kral. 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik, 2020, p. "4:1"-"4:14", 14 pp. ISBN 978-3-95977-159-7. Available from: https://dx.doi.org/10.4230/LIPIcs.MFCS.2020.4.