Back to the list of the institutes
Publications
Jakub Gajarský
Number of publications: 132023
- Jakub Gajarský , Nikolas Mählmann, Rose McCarty, Pierre Ohlmann, Michał Pilipczuk , Wojciech Przybyszewski , Sebastian Siebertz, Marek Sokołowski , Szymon Toruńczyk , Flipper Games for Monadically Stable Graph Classes, 50th EATCS International Colloquium on Automata, Languages and Programming, Padeborn, Germany, 10 July 2023 - 14 July 2023. See in PBN
- Benjamin Bergougnoux, Jakub Gajarský , Grzegorz Guśpiel, Petr Hliněný, Filip Pokrývka, Marek Sokołowski , Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width, The 34th International Symposium on Algorithms and Computation (ISAAC 2023), Kyoto, Japan, 4 December 2023 - 6 December 2023. See in PBN
2022
- Édouard Bonnet, Jan Dreier, Jakub Gajarský , Stephan Kreutzer, Nikolas Mählmann, Pierre Simon, Szymon Toruńczyk , Model Checking on Interpretations of Classes of Bounded Local Cliquewidth, 37'th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, 2 August 2022 - 5 August 2022. See in PBN
- Jakub Gajarský , Michał Pilipczuk , Szymon Toruńczyk , Stable graphs of bounded twin-width, 37'th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, 2 August 2022 - 5 August 2022. See in PBN
- Jakub Gajarský , Lars Jaffke, Paloma T., Jana Novotná, Marcin Pilipczuk , Paweł Rzążewski , Uéverton S., Taming Graphs with No Large Creatures and Skinny Ladders, 2022. See in PBN
- Jan Dreier, Jakub Gajarský , Sandra Kiefer, Michał Pilipczuk , Szymon Toruńczyk , Treelike Decompositions for Transductions of Sparse Graphs, 37'th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, 2 August 2022 - 5 August 2022. See in PBN
- Jakub Gajarský , Yiting Jiang, Jan Dreier, Jean-Florent Raymond, Patrice Ossona de Mendez, Twin-width and generalized coloring numbers, Discrete Mathematics, 345 (3) 2022, p. 112746. See in PBN
- Jakub Gajarský , Michał Pilipczuk , Wojciech Przybyszewski , Szymon Toruńczyk , Twin-Width and Types, 49th International Colloquium on Automata, Languages and Programming, Paris, France, 4 July 2022 - 8 July 2022. See in PBN
2020
- Petr Hliněný, Daniel Lokshtanov, M. S. Ramanujan, Jan Obdržálek, Jakub Gajarský , A New Perspective on FO Model Checking of Dense Graph Classes, ACM Transactions on Computational Logic, 21 (4) 2020, p. 1-23. See in PBN
- Jakub Gajarský , Computing Srub-Depth Decompositions, Leibniz International Proceedings in Informatics, 37th Symposium on Theoretical Aspects of Computer Science, Montpellier, France, 10 March 2020 - 13 March 2020, 154 (56) 2020, p. 1-17. See in PBN
- Stephan Kreutzer, Jaroslav Nešetřil, Patrice Ossona De Mendez, Michał Pilipczuk , Sebastian Siebertz, Szymon Toruńczyk , Jakub Gajarský , First-Order Interpretations of Bounded Expansion Classes, ACM Transactions on Computational Logic, 21 (4) 2020, p. 29:1-29:41. See in PBN
2019
- Jakub Gajarský , Petr Hliněný, Martin Koutecký, Shmuel Onn, Parameterized shifted combinatorial optimization, Journal of Computer and System Sciences, 99 2019, p. 53-71. See in PBN
2018
- Michał Pilipczuk , Sebastian Siebertz, Stephan Kreutzer, Jaroslav Nešetřil, Patrice Ossona de Mendez, Szymon Toruńczyk , Jakub Gajarský , First-Order Interpretations of Bounded Expansion Classes, 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July, 2018. See in PBN