Jakub Gajarský

According to our database, Jakub Gajarský authored at least 27 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

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., January, 2024

Elementary first-order model checking for sparse graphs.

Jakub Gajarský, Michal Pilipczuk, Marek Sokolowski, Giannos Stamoulis, Szymon Torunczyk

CoRR, 2024

2023

Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width.

Benjamin Bergougnoux, Jakub Gajarský, Grzegorz Guspiel, Petr Hlinený, Filip Pokrývka, Marek Sokolowski

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Flipper Games for Monadically Stable Graph Classes.

Jakub Gajarský, Nikolas Mählmann, Rose McCarty, Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokolowski, Szymon Torunczyk

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Twin-width and generalized coloring numbers.

Jan Dreier, Jakub Gajarský, Yiting Jiang, Patrice Ossona de Mendez, Jean-Florent Raymond

Discret. Math., 2022

Stable graphs of bounded twin-width.

Jakub Gajarský, Michal Pilipczuk, Szymon Torunczyk

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Treelike Decompositions for Transductions of Sparse Graphs.

Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michal Pilipczuk, Szymon Torunczyk

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 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

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Twin-Width and Types.

Jakub Gajarský, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Taming Graphs with No Large Creatures and Skinny Ladders.

Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Differential Games, Locality, and Model Checking for FO Logic of Graphs.

Jakub Gajarský, Maximilian Gorsky, Stephan Kreutzer

Proceedings of the 30th EACSL Annual Conference on Computer Science Logic, 2022

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

A New Perspective on FO Model Checking of Dense Graph Classes.

Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan

ACM Trans. Comput. Log., 2020

Computing Shrub-Depth Decompositions.

Jakub Gajarský, Stephan Kreutzer

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

2019

Parameterized shifted combinatorial optimization.

Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn

J. Comput. Syst. Sci., 2019

2018

Parameterized extension complexity of independent set and related problems.

Jakub Gajarský, Petr Hlinený, Hans Raj Tiwary

Discret. Appl. Math., 2018

Recovering Sparse Graphs.

Jakub Gajarský, Daniel Král

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

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

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

Deobfuscating sparse graphs.

Jakub Gajarský, Daniel Král

CoRR, 2017

2015

Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences.

Jakub Gajarský, Petr Hlinený

Log. Methods Comput. Sci., 2015

Faster Existential FO Model Checking on Posets.

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

Log. Methods Comput. Sci., 2015

Parameterized Algorithms for Parity Games.

Jakub Gajarský, Michael Lampis, Kazuhisa Makino, Valia Mitsou, Sebastian Ordyniak

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

FO Model Checking on Posets of Bounded Width.

Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014

Finite Integer Index of Pathwidth and Treewidth.

Jakub Gajarský, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar

Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

2013

Parameterized Algorithms for Modular-Width.

Jakub Gajarský, Michael Lampis, Sebastian Ordyniak

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

2012

Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences.

Jakub Gajarský, Petr Hlinený

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012