Jakub Gajarský

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 43

Top Topics

Top Venues

J. Comput. Syst. Sci.

Publications

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