13 citations · 42 across the 7 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2018
First-order interpretations of bounded expansion classes
Jakub Gajarský, Stephan Kreutzer, Jaroslav Nešetřil +4
The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-che…
cs.DM2017
Recovering sparse graphs
Jakub Gajarsky, Daniel Kral
We construct a fixed parameter algorithm parameterized by d and k that takes as an input a graph G' obtained from a d-degenerate graph G by complementing on at most k arbitrary sub…
cs.DM2012★ 10 cited
Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences
Jakub Gajarsky, Petr Hlineny
Fix an integer h>=1. In the universe of coloured trees of height at most h, we prove that for any graph decision problem defined by an MSO formula with r quantifiers, there exists…