| Isomorphism Problem for S_d-Graphs D Ağaoğlu, P Hliněný 45th International Symposium on Mathematical Foundations of Computer Science …, 2020 | 13 | 2020 |
| Isomorphism Testing for T-graphs in FPT D Ağaoğlu Çağırıcı, P Hliněný WALCOM: Algorithms and Computation: 16th International Conference and …, 2022 | 11 | 2022 |
| Efficient Isomorphism for -graphs and -graphs DA Çağırıcı, P Hliněný arXiv preprint arXiv:1907.01495, 2019 | 6* | 2019 |
| Isomorphism Testing for T-graphs in FPT D Ağaoğlu, P Hliněný arXiv preprint arXiv:2111.10910, 2021 | 3* | 2021 |
| Unit Disk Visibility Graphs D Ağaoğlu, O Çağırıcı Extended Abstracts EuroComb 2021: European Conference on Combinatorics …, 2021 | 3 | 2021 |
| Efficient Isomorphism for -Graphs and T-Graphs D Ağaoğlu Çağırıcı, P Hliněný Algorithmica 85 (2), 352-383, 2023 | 1 | 2023 |
| Recognizing -graphs – beyond circular-arc graphs D Ağaoğlu Çağırıcı, O Çağırıcı, J Derbisz, TA Hartmann, P Hliněný, ... Dagstuhl: Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2023 | 1 | 2023 |
| Parameterized Algorithms for Geometric Intersection Graphs D Agaoglu | 1* | |
| Beyond circular-arc graphs--recognizing lollipop graphs and medusa graphs D Ağaoğlu Çağırıcı, O Çağırıcı, J Derbisz, TA Hartmann, P Hliněný, ... arXiv e-prints, arXiv: 2212.05433, 2022 | | 2022 |
| Unit disk visibility graphs DA Cagırıcı, O Cagırıcı Discrete Mathematics Days 2022 263, 17, 2022 | | 2022 |
| Recognition and Isomorphism of Proper -graphs in FPT-time DA Çağırıcı, P Zeman arXiv preprint arXiv:2206.13372, 2022 | | 2022 |
| Recognition and Isomorphism of Proper -graphs in FPT-time D Ağaoğlu Çağırıcı, P Zeman arXiv e-prints, arXiv: 2206.13372, 2022 | | 2022 |
| Automorphism Group of Marked Interval Graphs in FPT D Ağaoğlu, P Hliněný arXiv preprint arXiv:2202.12664, 2022 | | 2022 |
| Automorphisms of Set Families and of Families of Cliques in an Interval Graph in FPT Time D Ağaoğlu Çağırıcı, P Hliněný arXiv e-prints, arXiv: 2202.12664, 2022 | | 2022 |
| 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020) D Král, N Bertrand, S Cabello, M Wootters, D Ağaoğlu, P Hliněný, J Ahn, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2020 | | 2020 |
| Isomorphism Problem for S_d-Graphs. D Agaoglu, P Hlinený MFCS, 4:1-4:14, 2020 | | 2020 |
| Isomorphism Problem for Geometric Intersection Graphs D Agaoglu | | |
