Preprints
Optimal b-colourings and fall colourings in H-free graphs
March 2026
Unavoidable pivot-minors in graphs of large rank-depth
July 2025
Finding d-cuts in claw-free graphs
May 2025
Approximating maximum cut on interval graphs and split graphs beyond Goemans-Williamson
July 2025
A coarse Erdős-Pósa theorem
January 2025
Twin-width one
January 2025
Spectral integral variation of signed graphs
January 2024
Accepted Journal Papers
Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes
Journal of Computer and System Sciences (JCSS)
August 2026
The proper conflict-free k-coloring problem and the odd k-coloring problem are NP-complete on bipartite graphs
Discrete Applied Mathematics (DAM)
December 2025
Twin-width of random graphs
Random Structures & Algorithms (RSA)
June 2024
A polynomial kernel for 3-lear power deletion
Algorithmica
May 2023
Bounds for the twin-width of graphs
SIAM Journal on Discrete Mathematics (SIDMA)
September 2022
Well-partitioned chordal graphs
Discrete Mathematics (Discrete Math.)
May 2022
Towards constant-factor approximation for chordal/distance-hereditary vertex deletion
Algorithmica
April 2022
Twin-width of subdivisions of multigraphs
SIAM Journal on Discrete Mathematics (SIDMA)
April 2025
Refereed Conference Papers
Finding d-cuts in claw-free graphs
The 36th International Symposium on Algorithms and Computation (ISAAC 2025)
December 2025
Approximating maximum cut on interval and split graphs beyond Goemans-Williamson
The 28th International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2025)
August 2025
Twin-width one
The 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025)
March 2025
A coarse Erdős-Pósa theorem
The 36th ACM-SIAM Symposium on Discrete Algorithms (SODA25)
January 2025
Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes
The 34th International Symposium on Algorithms and Computation (ISAAC 2023)
December 2023
Three problems on well-partitioned chordal graphs
The 12th International Conference on Algorithms and Complexity (CIAC 2021)
May 2021
Towards constant-factor approximation for chordal/distance-hereditary vertex deletion
The 31st International Symposium on Algorithms and Computation (ISAAC 2020)
December 2020
A polynomial kernel for 3-leaf power deletion
The 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
August 2020
Well-partitioned chordal graphs: obstruction set and disjoint paths
The 46th Graph-Theoretic Concepts in Computer Science (WG 2020)
June 2020