Jakub Gajarský

56 papers A* 11A 3B 6Misc 1Journal 33Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Efficient reversal of transductions of sparse graph classes.
CoRR
Jan Dreier, Jakub Gajarský, Michal Pilipczuk
2025 A* conf
3D-grids are not transducible from planar graphs.
LICS
Jakub Gajarský, Michal Pilipczuk, Filip Pokrývka
2025 J jnl
3D-grids are not transducible from planar graphs.
CoRR
Jakub Gajarský, Michal Pilipczuk, Filip Pokrývka
2025 J jnl
First-order transducibility among classes of sparse graphs.
CoRR
Jakub Gajarský, Jeremi Gladkowski, Jan Jedelský, Michal Pilipczuk, Szymon Torunczyk
2025 J jnl
Obstructions and dualities for matroid depth parameters.
CoRR
Jakub Gajarský, Kristýna Pekárková, Michal Pilipczuk
2024 J jnl
Corrigendum to "Twin-width and generalized coloring numbers" [Discrete Math. 345 (3) (2022) 112746].
Discret. Math.
Jan Dreier, Jakub Gajarský, Yiting Jiang, Patrice Ossona de Mendez, Jean-Florent Raymond
2024 A* conf
Elementary first-order model checking for sparse graphs.
LICS
Jakub Gajarský, Michal Pilipczuk, Marek Sokolowski, Giannos Stamoulis, Szymon Torunczyk
2024 J jnl
Elementary first-order model checking for sparse graphs.
CoRR
Jakub Gajarský, Michal Pilipczuk, Marek Sokolowski, Giannos Stamoulis, Szymon Torunczyk
2024 A* conf
On Classes of Bounded Tree Rank, Their Interpretations, and Efficient Sparsification.
ICALP
Jakub Gajarský, Rose McCarty
2024 J jnl
On classes of bounded tree rank, their interpretations, and efficient sparsification.
CoRR
Jakub Gajarský, Rose McCarty
2024 J jnl
Taming Graphs with No Large Creatures and Skinny Ladders.
SIAM J. Discret. Math.
Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Masaríková, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza
2023 A* conf
Flipper Games for Monadically Stable Graph Classes.
ICALP
Jakub Gajarský, Nikolas Mählmann, Rose McCarty, Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokolowski, Szymon Torunczyk
2023 J jnl
Flipper games for monadically stable graph classes.
CoRR
Jakub Gajarský, Nikolas Mählmann, Rose McCarty, Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokolowski, Szymon Torunczyk
2023 B conf
Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width.
ISAAC
Benjamin Bergougnoux, Jakub Gajarský, Grzegorz Guspiel, Petr Hlinený, Filip Pokrývka, Marek Sokolowski
2023 J jnl
Sparse Graphs of Twin-width 2 Have Bounded Tree-width.
CoRR
Benjamin Bergougnoux, Jakub Gajarský, Grzegorz Guspiel, Petr Hlinený, Filip Pokrývka, Marek Sokolowski
2022 B conf
Differential Games, Locality, and Model Checking for FO Logic of Graphs.
CSL
Jakub Gajarský, Maximilian Gorsky, Stephan Kreutzer
2022 A* conf
Model Checking on Interpretations of Classes of Bounded Local Cliquewidth.
LICS
Édouard Bonnet, Jan Dreier, Jakub Gajarský, Stephan Kreutzer, Nikolas Mählmann, Pierre Simon, Szymon Torunczyk
2022 J jnl
Model Checking on Interpretations of Classes of Bounded Local Cliquewidth.
CoRR
Édouard Bonnet, Jan Dreier, Jakub Gajarský, Stephan Kreutzer, Nikolas Mählmann, Pierre Simon, Szymon Torunczyk
2022 A* conf
Stable graphs of bounded twin-width.
LICS
Jakub Gajarský, Michal Pilipczuk, Szymon Torunczyk
2022 A conf
Taming Graphs with No Large Creatures and Skinny Ladders.
ESA
Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza
2022 J jnl
Taming graphs with no large creatures and skinny ladders.
CoRR
Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza
2022 A* conf
Treelike Decompositions for Transductions of Sparse Graphs.
LICS
Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michal Pilipczuk, Szymon Torunczyk
2022 J jnl
Treelike decompositions for transductions of sparse graphs.
CoRR
Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michal Pilipczuk, Szymon Torunczyk
2022 A* conf
Twin-Width and Types.
ICALP
Jakub Gajarský, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk
2022 J jnl
Twin-width and generalized coloring numbers.
Discret. Math.
Jan Dreier, Jakub Gajarský, Yiting Jiang, Patrice Ossona de Mendez, Jean-Florent Raymond
2022 J jnl
Twin-width and types.
CoRR
Jakub Gajarský, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk
2021 J jnl
Stable graphs of bounded twin-width.
CoRR
Jakub Gajarský, Michal Pilipczuk, Szymon Torunczyk
2020 J jnl
A New Perspective on FO Model Checking of Dense Graph Classes.
ACM Trans. Comput. Log.
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan
2020 A conf
Computing Shrub-Depth Decompositions.
STACS
Jakub Gajarský, Stephan Kreutzer
2020 J jnl
Differential games, locality and model checking for FO logic of graphs.
CoRR
Jakub Gajarský, Maximilian Gorsky, Stephan Kreutzer
2020 J jnl
First-Order Interpretations of Bounded Expansion Classes.
ACM Trans. Comput. Log.
Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
2019 J jnl
Parameterized shifted combinatorial optimization.
J. Comput. Syst. Sci.
Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn
2018 J jnl
A New Perspective on FO Model Checking of Dense Graph Classes.
CoRR
Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, M. S. Ramanujan
2018 A* conf
First-Order Interpretations of Bounded Expansion Classes.
ICALP
Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
2018 J jnl
First-order interpretations of bounded expansion classes.
CoRR
Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
2018 J jnl
Parameterized extension complexity of independent set and related problems.
Discret. Appl. Math.
Jakub Gajarský, Petr Hlinený, Hans Raj Tiwary
2018 B conf
Recovering Sparse Graphs.
MFCS
Jakub Gajarský, Daniel Král
2017 J jnl
Deobfuscating sparse graphs.
CoRR
Jakub Gajarský, Daniel Král
2017 J jnl
First order limits of sparse graphs: Plane trees and path-width.
Random Struct. Algorithms
Jakub Gajarský, Petr Hlinený, Tomás Kaiser, Daniel Král', Martin Kupec, Jan Obdrzálek, Sebastian Ordyniak, Vojtech Tuma
2017 J jnl
Kernelization using structural parameters on sparse graph classes.
J. Comput. Syst. Sci.
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
2017 Misc conf
Parameterized Shifted Combinatorial Optimization.
COCOON
Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn
2017 J jnl
Parameterized Shifted Combinatorial Optimization.
CoRR
Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn
2016 A* conf
A New Perspective on FO Model Checking of Dense Graph Classes.
LICS
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan
2015 A* conf
FO Model Checking on Posets of Bounded Width.
FOCS
Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh
2015 J jnl
FO Model Checking on Posets of Bounded Width.
CoRR
Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh
2015 J jnl
Faster Existential FO Model Checking on Posets.
Log. Methods Comput. Sci.
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak
2015 J jnl
Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences.
Log. Methods Comput. Sci.
Jakub Gajarský, Petr Hlinený
2015 — conf
Parameterized Algorithms for Parity Games.
MFCS (2)
Jakub Gajarský, Michael Lampis, Kazuhisa Makino, Valia Mitsou, Sebastian Ordyniak
2015 J jnl
Parameterized Extension Complexity of Independent Set and Related Problems.
CoRR
Jakub Gajarský, Petr Hlinený, Hans Raj Tiwary
2014 B conf
Faster Existential FO Model Checking on Posets.
ISAAC
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak
2014 B conf
Finite Integer Index of Pathwidth and Treewidth.
IPEC
Jakub Gajarský, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
2013 J jnl
Kernelization Using Structural Parameters on Sparse Graph Classes
CoRR
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
2013 A conf
Kernelization Using Structural Parameters on Sparse Graph Classes.
ESA
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
2013 B conf
Parameterized Algorithms for Modular-Width.
IPEC
Jakub Gajarský, Michael Lampis, Sebastian Ordyniak
2013 J jnl
Parameterized Algorithms for Modular-Width.
CoRR
Jakub Gajarský, Michael Lampis, Sebastian Ordyniak
2012 — conf
Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences.
FSTTCS
Jakub Gajarský, Petr Hlinený