Isomorphism Problem for Sd-graphs. - Deniz Agaoglu (CoRR, 2019)

Isomorphism Problem for S_d-Graphs. - Deniz Agaoglu; Petr Hlinený (MFCS, 2020)

Unit Disk Visibility Graphs. - Onur Çagirici; Deniz Agaoglu (CoRR, 2021)

Isomorphism Testing for T-graphs in FPT. - Deniz Agaoglu Çagirici; Petr Hlinený (WALCOM, 2022)

Automorphism Group of Marked Interval Graphs in FPT. - Deniz Agaoglu; Petr Hlinený (CoRR, 2022)

Recognition and Isomorphism of Proper U-graphs in FPT-time. - Deniz Agaoglu Çagirici; Peter Zeman 001 (CoRR, 2022)

APUD(1, 1) Recognition in Polynomial Time. - Deniz Agaoglu Çagirici; Onur Çagirici (CoRR, 2022)

Beyond circular-arc graphs - recognizing lollipop graphs and medusa graphs. - Deniz Agaoglu Çagirici; Onur Çagirici; Jan Derbisz; Tim A. Hartmann; Petr Hlinený; Jan Kratochvíl; Tomasz Krawczyk; Peter Zeman 001 (CoRR, 2022)

Recognizing H-Graphs - Beyond Circular-Arc Graphs. - Deniz Agaoglu Çagirici; Onur Çagirici; Jan Derbisz; Tim A. Hartmann; Petr Hlinený; Jan Kratochvíl; Tomasz Krawczyk; Peter Zeman 001 (MFCS, 2023)

Efficient Isomorphism for Sd-Graphs and T-Graphs. - Deniz Agaoglu Çagirici; Petr Hlinený (Algorithmica, 2023)

Recognition and Isomorphism of Proper $ boldsymbol{H}$-Graphs for Unicyclic $ boldsymbol{H}$ in FPT-Time. - Deniz Agaoglu Çagirici; Peter Zeman 001 (WALCOM, 2024)