13 citations · 42 across the 7 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
cs.CC2015
Parameterized Extension Complexity of Independent Set and Related Problems
Jakub Gajarský, Petr Hliněný, Hans Raj Tiwary
Let be a graph on vertices and be the convex hull of characteristic vectors of its independent sets of size at most . We study extension complexity…
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…
math.CO2015★ 3 cited
First order limits of sparse graphs: Plane trees and path-width
Jakub Gajarsky, Petr Hlineny, Tomas Kaiser +5
Nesetril and Ossona de Mendez introduced the notion of first order convergence as an attempt to unify the notions of convergence for sparse and dense graphs. It is known that there…