16 citations · 16 across the 4 of their papers we have counts for
1 paper · 1 filter
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…