Deniz Agaoglu

According to our database, Deniz Agaoglu authored at least 11 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Recognition and Isomorphism of Proper $\boldsymbol{H}$-Graphs for Unicyclic $\boldsymbol{H}$ in FPT-Time.

Deniz Agaoglu Çagirici, Peter Zeman

Proceedings of the WALCOM: Algorithms and Computation, 2024

2023

Efficient Isomorphism for S_d-Graphs and T-Graphs.

Deniz Agaoglu Çagirici, Petr Hlinený

Algorithmica, February, 2023

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

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

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

CoRR, 2022

APUD(1, 1) Recognition in Polynomial Time.

Deniz Agaoglu Çagirici, Onur Çagirici

CoRR, 2022

Recognition and Isomorphism of Proper U-graphs in FPT-time.

Deniz Agaoglu Çagirici, Peter Zeman

CoRR, 2022

Automorphism Group of Marked Interval Graphs in FPT.

Deniz Agaoglu, Petr Hlinený

CoRR, 2022

Isomorphism Testing for T-graphs in FPT.

Deniz Agaoglu Çagirici, Petr Hlinený

Proceedings of the WALCOM: Algorithms and Computation, 2022

2021

Unit Disk Visibility Graphs.

Onur Çagirici, Deniz Agaoglu

CoRR, 2021

2020

Isomorphism Problem for S_d-Graphs.

Deniz Agaoglu, Petr Hlinený

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019

Isomorphism Problem for S_d-graphs.

Deniz Agaoglu

CoRR, 2019