24 citations · 124 across the 75 of their papers we have counts for
1 paper · 2 filters
Robert Ganian, Petr Hlineny, Daniel Kral +3
We study the computational complexity of the FO model checking problem on interval graphs, i.e., intersection graphs of intervals on the real line. The main positive result is that…