A polynomial kernel for vertex deletion into bipartite permutation graphs. - Jan Derbisz (CoRR, 2021)

Vertex Deletion into Bipartite Permutation Graphs. - Lukasz Bozyk; Jan Derbisz; Tomasz Krawczyk; Jana Novotná 001; Karolina Okrasa (Algorithmica, 2022)

A Polynomial Kernel for Bipartite Permutation Vertex Deletion. - Jan Derbisz; Lawqueen Kanesh; Jayakrishnan Madathil; Abhishek Sahu; Saket Saurabh 001; Shaily Verma (Algorithmica, 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)

Characterization of Chordal Circular-arc Graphs: I. Split Graphs. - Yixin Cao 001; Jan Derbisz; Tomasz Krawczyk (CoRR, 2024)

Circular-arc graphs and the Helly property. - Jan Derbisz; Tomasz Krawczyk (CoRR, 2024)