activity
20142026
most citedBetter 3-coloring algorithms: excluding a triangle and a seven vertex path

8 citations · 8 across the 6 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2025

Non-crossing -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 -graphs, for any…