16 citations · 17 across the 2 of their papers we have counts for
2 papers
cs.DM2013★ 16 cited
FO Model Checking of Interval Graphs
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…
cs.DM2011★ 1 cited
Recurrent Partial Words
Francine Blanchet-Sadri, Aleksandar Chakarov, Lucas Manuelli +2
Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, which match or are compatible with all letters; partial words without holes are…