First-Order Logic and Twin-Width for Some Geometric Graphs For some geometric graph classes, tractability of testing first-order formulas is precisely characterised by the graph parameter twin-width. This was first proved for interval graphs among others in [...

#New_accepted_conference_paper
*Colin Geniet*, *Gunwoo Kim*, and Lucas Meijer,
First-Order Logic and Twin-Width for Some Geometric Graphs,
In the Proceedings of the 42nd International Symposium on Computational Geometry (SoCG 2026), accepted, 2026.
arxiv.org/abs/2512.21896

#New_accepted_conference_paper
*Roohani Sharma* and Michał Włodarczyk,
Protrusion Decompositions Revisited: Uniform Lossy Kernels For Reducing Treewidth and Linear Kernels for Hitting Disconnected Minors,
STACS 2026 (March 9-13, 2026, Grenoble, France), accepted.

#New_accepted_conference_paper
*Maximilian Gorsky*, Giannos Stamoulis, Dimitrios Thilikos, Sebastian Wiederrecht,
Catching Rats in H-minor-free Graphs,
Accepted to #SODA2026 (January 11-14, 2026, Vancouver, Canada)

#New_accepted_conference_paper
Rutger Campbell, J. Pascal Gollin, Meike Hatzel, *O-joung Kwon*, Rose McCarty, *Sang-il Oum*, and Sebastian Wiederrecht,
The Erdős-Pósa property for circle graphs as vertex-minors,
Accepted to #SODA2026 (January 11-14, 2026, Vancouver, Canada)