Journal publications:
J. Gajarský, L. Jaffke, P. T. Lima, J. Masaríková, M. Pilipczuk, P. Rzazewski, U. S. Souza
Taming Graphs with No Large Creatures and Skinny Ladders
SIAM Journal of Discrete Mathematics, 2024
J. Dreier, J. Gajarský, Y. Jiang, P. Ossona de Mendez, J.-F. Raymond
Twin-width and generalized coloring numbers
Discrete Mathematics, 2022
J. Gajarský, P. Hliněný, D. Lokshtanov, J. Obdržálek, M. S. Ramanujan
A New Perspective on FO Model Checking of Dense Graph Classes
ACM Transactions on Computational Logic, 2020
J. Gajarský, S. Kreutzer, J. Nešetřil, P. Ossona de Mendez, M. Pilipczuk, S. Siebertz, S. Torunczyk
First-Order Interpretations of Bounded Expansion Classes
ACM Transactions on Computational Logic, 2020
J. Gajarský, P. Hliněný, M. Koutecký, S. Onn
Parameterized shifted combinatorial optimization
Journal of Computer and System Sciences, 2019
J. Gajarský, P. Hliněný, H. R. Tiwary
Parameterized extension complexity of independent set and related problems
Discrete Applied Mathematics, 2018
J. Gajarský, P. Hliněný, J. Obdržálek, S. Ordyniak, F. Reidl, P. Rossmanith, F. Sanchez Villaamil, and S. Sikdar
Kernelization using structural parameters on sparse graph classes
Journal of Computer and System Sciences, 2017
J. Gajarský, P. Hliněný, T. Kaiser, D. Kráľ, M. Kupec, J. Obdržálek, S. Ordyniak, V. Tůma
First order limits of sparse graphs: Plane trees and path width
Random Structures and Algorithms, 2017
J. Gajarský and P. Hliněný
Kernelizing MSO properties of trees of fixed height, and some consequences
Logical Methods in Computer Science, 11(1), 2015
J. Gajarský, P. Hliněný, J. Obdržálek, S. Ordyniak
Faster existential FO model checking on posets
Logical Methods in Computer Science, 11(4), 2015
Conference proceedings:
J. Gajarský, R. McCarty
On Classes of Bounded Tree Rank, Their Interpretations, and Efficient Sparsification
ICALP(B) 2024
J. Gajarský, M. Pilipczuk, M. Sokołowski, G. Stamoulis, Sz. Toruńczyk
Elementary first-order model checking for sparse graphs
LICS 2024
J. Gajarský, N. Mählmann, R. McCarty, P. Ohlmann, M. Pilipczuk, W. Przybyszewski, S. Siebertz, M. Sokołowski, Sz. Toruńczyk
Flipper games for monadically stable graph classes
ICALP(B) 2023
B. Bergougnoux, J. Gajarský, G. Guspiel, P. Hlinený, F. Pokrývka, M. Sokolowski
Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width
ISAAC 2023
J. Gajarský, M. Gorsky, S. Kreutzer
Differential Games, Locality, and Model Checking for FO Logic of Graphs
CSL 2022
J. Gajarský, L. Jaffke, P. Lima, J. Novotná, M. Pilipczuk, P, Rzazewski, U. Souza
Taming graphs with no large creatures and skinny ladders
ESA 2022
J. Gajarský, M. Pilipczuk, W. Przybyszewski, S. Toruńczyk
Twin-width and types
ICALP(B) 2022
Remark: Best paper award
É. Bonnet, J. Dreier, J. Gajarský, S. Kreutzer, N. Mählmann, P. Simon, S. Toruńczyk,
Model checking on interpretations of graph classes of bounded local clique-width
LICS 2022
J. Gajarský, M. Pilipczuk, S. Torunczyk
Stable graphs of bounded twin-width
LICS 2022
Remark: Distinguished paper (1 of 6)
J. Dreier, J. Gajarský, S. Kiefer, M. Pilipczuk, S. Torunczyk
Tree-like decompositions for trasductions of sparse graphs
LICS 2022
J. Gajarský, M. Gorsky, S. Kreutzer
Differential games, locality and model checking for FO logic of graphs
CSL 2022
J. Gajarský, S. Kreutzer
Computing shrub-depth decompositions
STACS 2020
J. Gajarský, S. Kreutzer, J. Nešetřil, P. Ossona de Mendez, M. Pilipczuk, S. Siebertz, S. Torunczyk
First-Order interpretations of bounded expansion classes
ICALP 2018
J. Gajarský, D. Kráľ
Recovering sparse graphs
MFCS 2018
J. Gajarský, P. Hliněný, M. Koutecký, Shmuel Onn.
Parameterized Shifted Combinatorial Optimization
COCOON 2017
J. Gajarský, P. Hliněný, D. Lokshtanov, J. Obdržálek, M. S. Ramanujan
A New Perspective on FO Model Checking of Dense Graph Classes
LICS 2016
J. Gajarský, P. Hliněný, D. Lokshtanov, J. Obdržálek, S. Ordyniak, M. S. Ramanujan, and S. Saurabh
FO model checking on posets of bounded width
FOCS 2015
J. Gajarský, Michael Lampis, K. Makino, V. Mitsou, and S. Ordyniak
Parameterized algorithms for parity games
MFCS 2015
J. Gajarský, P. Hliněný, J. Obdržálek, and S. Ordyniak
Faster existential FO model checking on posets
ISAAC 2014
J. Gajarský, J. Obdržálek, S. Ordyniak, F. Reidl, P. Rossmanith, F. Sanchez Villaamil, and S. Sikdar
Finite integer index of pathwidth and treewidth
IPEC 2014
J. Gajarský, P. Hliněný, J. Obdržálek, S. Ordyniak, F. Reidl, P. Rossmanith, F. Sanchez Villaamil, and S. Sikdar
Kernelization using structural parameters on sparse graph classes
ESA 2013
J. Gajarský, M. Lampis, and S. Ordyniak
Parameterized algorithms for modular-width
IPEC 2013
J. Gajarský and P. Hliněný
Faster deciding MSO properties of trees of fixed height, and some consequences
FSTTCS 2012