Non-crossing $H$-graphs: a generalization of proper interval graphs admitting FPT algorithms

Flavia Bonomo-Braberman, Nick Brettell, Noleen Köhler +2

We prove new parameterized complexity results for the FO Model Checking problem on a well-known generalization of interval and circular-arc graphs: the class of $H$-graphs, for any…