#### Filter Results:

- Full text PDF available (15)

#### Publication Year

2012

2018

- This year (5)
- Last 5 years (16)
- Last 10 years (19)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Jakub Gajarský, Petr Hlinený, +5 authors Somnath Sikdar
- ESA
- 2013

Meta-theorems for polynomial (linear) kernels have been the subject of intensive research in parameterized complexity. Heretofore, there were meta-theorems for linear kernels on graphs of bounded… (More)

- Jakub Gajarský, Petr Hlinený
- FSTTCS
- 2012

We prove, in the universe of trees of bounded height, that for any MSO formula with m variables there exists a set of kernels such that the size of each of these kernels can be bounded by an… (More)

- Jakub Gajarský, Michael Lampis, Sebastian Ordyniak
- IPEC
- 2013

It is known that a number of natural graph problems which are FPT parameterized by treewidth become W-hard when parameterized by clique-width. It is therefore desirable to find a different structural… (More)

Determining the winner of a Parity Game is a major problem in computational complexity with a number of applications in verification. In a parameterized complexity setting, the problem has often been… (More)

- Jakub Gajarský, Petr Hlinený, +4 authors Saket Saurabh
- 2015 IEEE 56th Annual Symposium on Foundations of…
- 2015

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 Grohe, Kreutzer and… (More)

- Jakub Gajarský, Petr Hlinený
- Logical Methods in Computer Science
- 2012

Fix an integer h ≥ 1. In the universe of coloured trees of height at most h, we prove that for any MSO formula with r variables there exists a set of kernels, each of size bounded by an elementary… (More)

- Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak
- ISAAC
- 2014

We prove that the model checking problem for the existential fragment of first order (FO) logic on partially ordered sets is fixedparameter tractable (FPT) with respect to the formula and the width… (More)

- Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn
- COCOON
- 2017

Shifted combinatorial optimization is a new nonlinear optimization framework which is a broad extension of standard combinatorial optimization, involving the choice of several feasible solutions at a… (More)

We study the FO model checking problem of dense graph classes, namely those which are FO-interpretable in some sparse graph classes. Note that if an input dense graph is given together with the… (More)

- Jakub Gajarský, Petr Hlinený, +4 authors Saket Saurabh
- 2015

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 Grohe, Kreutzer and… (More)