Jan Derbisz

According to our database, Jan Derbisz authored at least 7 papers between 2020 and 2024.

Collaborative distances:

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

2024

Circular-arc graphs and the Helly property.

Jan Derbisz, Tomasz Krawczyk

CoRR, 2024

Characterization of Chordal Circular-arc Graphs: I. Split Graphs.

Yixin Cao, Jan Derbisz, Tomasz Krawczyk

CoRR, 2024

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

A Polynomial Kernel for Bipartite Permutation Vertex Deletion.

Jan Derbisz, Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma

Algorithmica, 2022

2021

A polynomial kernel for vertex deletion into bipartite permutation graphs.

Jan Derbisz

CoRR, 2021

2020

Vertex Deletion into Bipartite Permutation Graphs.

Lukasz Bozyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná, Karolina Okrasa

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020