Jakub Gajarsk
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
21
Venues
10
Active years
2013–2026
Best venue rank
A*
Where they publish
Papers
21 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | STOC | Efficient Reversal of Transductions of Sparse Graph Classes. | Jan Dreier, Jakub Gajarsk, Michal Pilipczuk |
| 2025 | LICS | 3D-grids are not transducible from planar graphs. | Jakub Gajarsk, Michal Pilipczuk, Filip Pokrvka |
| 2024 | ICALP | On Classes of Bounded Tree Rank, Their Interpretations, and Efficient Sparsification. | Jakub Gajarsk, Rose McCarty |
| 2024 | LICS | Elementary first-order model checking for sparse graphs. | Jakub Gajarsk, Michal Pilipczuk, Marek Sokolowski, Giannos Stamoulis, Szymon Torunczyk |
| 2023 | ICALP | Flipper Games for Monadically Stable Graph Classes. | Jakub Gajarsk, Nikolas Mhlmann, Rose McCarty, Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokolowski, Szymon Torunczyk |
| 2023 | ISAAC | Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width. | Benjamin Bergougnoux, Jakub Gajarsk, Grzegorz Guspiel, Petr Hlinen, Filip Pokrvka, Marek Sokolowski |
| 2022 | CSL | Differential Games, Locality, and Model Checking for FO Logic of Graphs. | Jakub Gajarsk, Maximilian Gorsky, Stephan Kreutzer |
| 2022 | ESA | Taming Graphs with No Large Creatures and Skinny Ladders. | Jakub Gajarsk, Lars Jaffke, Paloma T. Lima, Jana Novotn, Marcin Pilipczuk, Pawel Rzazewski, Uverton S. Souza |
| 2022 | ICALP | Twin-Width and Types. | Jakub Gajarsk, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk |
| 2022 | LICS | Model Checking on Interpretations of Classes of Bounded Local Cliquewidth. | douard Bonnet, Jan Dreier, Jakub Gajarsk, Stephan Kreutzer, Nikolas Mhlmann, Pierre Simon, Szymon Torunczyk |
| 2022 | LICS | Treelike Decompositions for Transductions of Sparse Graphs. | Jan Dreier, Jakub Gajarsk, Sandra Kiefer, Michal Pilipczuk, Szymon Torunczyk |
| 2022 | LICS | Stable graphs of bounded twin-width. | Jakub Gajarsk, Michal Pilipczuk, Szymon Torunczyk |
| 2020 | STACS | Computing Shrub-Depth Decompositions. | Jakub Gajarsk, Stephan Kreutzer |
| 2018 | ICALP | First-Order Interpretations of Bounded Expansion Classes. | Jakub Gajarsk, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk |
| 2018 | MFCS | Recovering Sparse Graphs. | Jakub Gajarsk, Daniel Krl |
| 2017 | COCOON | Parameterized Shifted Combinatorial Optimization. | Jakub Gajarsk, Petr Hlinen, Martin Kouteck, Shmuel Onn |
| 2016 | LICS | A New Perspective on FO Model Checking of Dense Graph Classes. | Jakub Gajarsk, Petr Hlinen, Jan Obdrzlek, Daniel Lokshtanov, M. S. Ramanujan |
| 2015 | FOCS | FO Model Checking on Posets of Bounded Width. | Jakub Gajarsk, Petr Hlinen, Daniel Lokshtanov, Jan Obdrzlek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh |
| 2015 | MFCS | Parameterized Algorithms for Parity Games. | Jakub Gajarsk, Michael Lampis, Kazuhisa Makino, Valia Mitsou, Sebastian Ordyniak |
| 2014 | ISAAC | Faster Existential FO Model Checking on Posets. | Jakub Gajarsk, Petr Hlinen, Jan Obdrzlek, Sebastian Ordyniak |
| 2013 | ESA | Kernelization Using Structural Parameters on Sparse Graph Classes. | Jakub Gajarsk, Petr Hlinen, Jan Obdrzlek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Snchez Villaamil, Somnath Sikdar |