6 citations · 9 across the 9 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.LO2015★ 6 cited
FO Model Checking on Posets of Bounded Width
Jakub Gajarský, Petr Hliněný, Daniel Lokshtanov +4
Over the past two decades the main focus of research into first-order (FO) model checking algorithms have been sparse relational structures-culminating in the FPT-algorithm by Groh…
cs.CC2015
Reconfiguration on sparse graphs
Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan +2
A vertex-subset graph problem Q defines which subsets of the vertices of an input graph are feasible solutions. A reconfiguration variant of a vertex-subset problem asks, given two…