8 citations · 66 across the 52 of their papers we have counts for
8 papers · 1 filter
Model-Checking on Ordered Structures
Kord Eickmeyer, Jan van den Heuvel, Ken-ichi Kawarabayashi +6
We study the model-checking problem for first- and monadic second-order logic on finite relational structures. The problem of verifying whether a formula of these logics is true on…
Progressive Algorithms for Domination and Independence
Grzegorz Fabiański, Michał Pilipczuk, Sebastian Siebertz +1
We consider a generic algorithmic paradigm that we call progressive exploration, which can be used to develop simple and efficient parameterized graph algorithms. We identify two m…
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…
Kernelization and approximation of distance- independent sets on nowhere dense graphs
Michał Pilipczuk, Sebastian Siebertz
For a positive integer , a distance- independent set in an undirected graph is a set of vertices pairwise at distance greater than , while a distance…
Polynomial bounds for centered colorings on proper minor-closed graph classes
Michał Pilipczuk, Sebastian Siebertz
For , a coloring of the vertices of a graph is {\em{-centered}} if for every connected subgraph~ of , either receives more than colors und…
Greedy domination on biclique-free graphs
Sebastian Siebertz
The greedy algorithm for approximating dominating sets is a simple method that is known to compute an -approximation of a minimum dominating set on any graph with ve…