Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences. - Jakub Gajarský; Petr Hlinený (FSTTCS, 2012)

Parameterized Algorithms for Modular-Width. - Jakub Gajarský; Michael Lampis; Sebastian Ordyniak (IPEC, 2013)

Finite Integer Index of Pathwidth and Treewidth. - Jakub Gajarský; Jan Obdrzálek; Sebastian Ordyniak; Felix Reidl; Peter Rossmanith; Fernando Sánchez Villaamil; Somnath Sikdar (IPEC, 2014)

FO Model Checking on Posets of Bounded Width. - Jakub Gajarský; Petr Hlinený; Daniel Lokshtanov; Jan Obdrzálek; Sebastian Ordyniak; M. S. Ramanujan 001; Saket Saurabh 001 (FOCS, 2015)

Parameterized Algorithms for Parity Games. - Jakub Gajarský; Michael Lampis; Kazuhisa Makino; Valia Mitsou; Sebastian Ordyniak (MFCS (2), 2015)

Faster Existential FO Model Checking on Posets. - Jakub Gajarský; Petr Hlinený; Jan Obdrzálek; Sebastian Ordyniak (Log. Methods Comput. Sci., 2015)

Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences. - Jakub Gajarský; Petr Hlinený (Log. Methods Comput. Sci., 2015)

Deobfuscating sparse graphs. - Jakub Gajarský; Daniel Král (CoRR, 2017)

Kernelization using structural parameters on sparse graph classes. - Jakub Gajarský; Petr Hlinený; Jan Obdrzálek; Sebastian Ordyniak; Felix Reidl; Peter Rossmanith; Fernando Sánchez Villaamil; Somnath Sikdar (J. Comput. Syst. Sci., 2017)

First order limits of sparse graphs: Plane trees and path-width. - Jakub Gajarský; Petr Hlinený; Tomás Kaiser; Daniel Král'; Martin Kupec; Jan Obdrzálek; Sebastian Ordyniak; Vojtech Tuma (Random Struct. Algorithms, 2017)

Recovering Sparse Graphs. - Jakub Gajarský; Daniel Král (MFCS, 2018)

Parameterized extension complexity of independent set and related problems. - Jakub Gajarský; Petr Hlinený; Hans Raj Tiwary (Discret. Appl. Math., 2018)

Parameterized shifted combinatorial optimization. - Jakub Gajarský; Petr Hlinený; Martin Koutecký; Shmuel Onn (J. Comput. Syst. Sci., 2019)

Computing Shrub-Depth Decompositions. - Jakub Gajarský; Stephan Kreutzer (STACS, 2020)

A New Perspective on FO Model Checking of Dense Graph Classes. - Jakub Gajarský; Petr Hlinený; Jan Obdrzálek; Daniel Lokshtanov; M. S. Ramanujan 001 (ACM Trans. Comput. Log., 2020)

First-Order Interpretations of Bounded Expansion Classes. - Jakub Gajarský; Stephan Kreutzer; Jaroslav Nesetril; Patrice Ossona de Mendez; Michal Pilipczuk; Sebastian Siebertz; Szymon Torunczyk (ACM Trans. Comput. Log., 2020)

Differential Games, Locality, and Model Checking for FO Logic of Graphs. - Jakub Gajarský; Maximilian Gorsky; Stephan Kreutzer (CSL, 2022)

Twin-Width and Types. - Jakub Gajarský; Michal Pilipczuk; Wojciech Przybyszewski; Szymon Torunczyk (ICALP, 2022)

Model Checking on Interpretations of Classes of Bounded Local Cliquewidth. - Édouard Bonnet; Jan Dreier; Jakub Gajarský; Stephan Kreutzer; Nikolas Mählmann; Pierre Simon; Szymon Torunczyk (LICS, 2022)

Treelike Decompositions for Transductions of Sparse Graphs. - Jan Dreier; Jakub Gajarský; Sandra Kiefer; Michal Pilipczuk; Szymon Torunczyk (LICS, 2022)

Stable graphs of bounded twin-width. - Jakub Gajarský; Michal Pilipczuk; Szymon Torunczyk (LICS, 2022)

Twin-width and generalized coloring numbers. - Jan Dreier; Jakub Gajarský; Yiting Jiang; Patrice Ossona de Mendez; Jean-Florent Raymond (Discret. Math., 2022)

Flipper Games for Monadically Stable Graph Classes. - Jakub Gajarský; Nikolas Mählmann; Rose McCarty; Pierre Ohlmann; Michal Pilipczuk; Wojciech Przybyszewski; Sebastian Siebertz; Marek Sokolowski 001; Szymon Torunczyk (ICALP, 2023)

Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width. - Benjamin Bergougnoux; Jakub Gajarský; Grzegorz Guspiel; Petr Hlinený; Filip Pokrývka; Marek Sokolowski 001 (ISAAC, 2023)

On Classes of Bounded Tree Rank, Their Interpretations, and Efficient Sparsification. - Jakub Gajarský; Rose McCarty (ICALP, 2024)

Elementary first-order model checking for sparse graphs. - Jakub Gajarský; Michal Pilipczuk; Marek Sokolowski 001; Giannos Stamoulis; Szymon Torunczyk (LICS, 2024)

Taming Graphs with No Large Creatures and Skinny Ladders. - Jakub Gajarský; Lars Jaffke; Paloma T. Lima; Jana Masaríková; Marcin Pilipczuk; Pawel Rzazewski; Uéverton S. Souza (SIAM J. Discret. Math., 2024)

Corrigendum to "Twin-width and generalized coloring numbers" [Discrete Math. 345 (3) (2022) 112746]. - Jan Dreier; Jakub Gajarský; Yiting Jiang; Patrice Ossona de Mendez; Jean-Florent Raymond (Discret. Math., 2024)

3D-grids are not transducible from planar graphs. - Jakub Gajarský; Michal Pilipczuk; Filip Pokrývka (CoRR, 2025)

Obstructions and dualities for matroid depth parameters. - Jakub Gajarský; Kristýna Pekárková; Michal Pilipczuk (CoRR, 2025)

First-order transducibility among classes of sparse graphs. - Jakub Gajarský; Jeremi Gladkowski; Jan Jedelský; Michal Pilipczuk; Szymon Torunczyk (CoRR, 2025)