Folgen
Jakub Gajarsky
Jakub Gajarsky
Assistant professor, University of Warsaw
Bestätigte E-Mail-Adresse bei mimuw.edu.pl
Titel
Zitiert von
Zitiert von
Jahr
Parameterized algorithms for modular-width
J Gajarský, M Lampis, S Ordyniak
Parameterized and Exact Computation: 8th International Symposium, IPEC 2013 …, 2013
1032013
Kernelization using structural parameters on sparse graph classes
J Gajarský, P Hliněný, J Obdržálek, S Ordyniak, F Reidl, P Rossmanith, ...
Journal of Computer and System Sciences 84, 219-242, 2017
742017
First-order interpretations of bounded expansion classes
J Gajarský, S Kreutzer, J Nešetřil, POD Mendez, M Pilipczuk, S Siebertz, ...
ACM Transactions on Computational Logic (TOCL) 21 (4), 1-41, 2020
702020
A new perspective on FO model checking of dense graph classes
J Gajarský, P Hliněný, J Obdržálek, D Lokshtanov, MS Ramanujan
ACM Transactions on Computational Logic (TOCL) 21 (4), 1-23, 2020
632020
FO model checking on posets of bounded width
J Gajarský, P Hlinený, D Lokshtanov, J Obdralek, S Ordyniak, ...
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 963-974, 2015
462015
Kernelizing MSO properties of trees of fixed height, and some consequences
J Gajarsky, P Hlineny
Logical Methods in Computer Science 11, 2015
442015
Stable graphs of bounded twin-width
J Gajarský, M Pilipczuk, S Toruńczyk
Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer …, 2022
342022
Twin-width and generalized coloring numbers
J Dreier, J Gajarský, Y Jiang, PO de Mendez, JF Raymond
Discrete Mathematics 345 (3), 112746, 2022
212022
Faster existential FO model checking on posets
J Gajarský, P Hliněný, J Obdržálek, S Ordyniak
Logical Methods in Computer Science 11, 2015
152015
Model checking on interpretations of classes of bounded local cliquewidth
É Bonnet, J Dreier, J Gajarský, S Kreutzer, N Mählmann, P Simon, ...
Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer …, 2022
122022
Parameterized algorithms for parity games
J Gajarský, M Lampis, K Makino, V Mitsou, S Ordyniak
Mathematical Foundations of Computer Science 2015: 40th International …, 2015
122015
Twin-width and types
J Gajarský, M Pilipczuk, W Przybyszewski, S Toruńczyk
arXiv preprint arXiv:2206.08248, 2022
92022
Recovering sparse graphs
J Gajarsky, D Králʼ
Leibniz International Proceedings in Informatics (LIPIcs) 117, 29, 2018
92018
Flipper games for monadically stable graph classes
J Gajarský, N Mählmann, R McCarty, P Ohlmann, M Pilipczuk, ...
arXiv preprint arXiv:2301.13735, 2023
82023
Treelike decompositions for transductions of sparse graphs
J Dreier, J Gajarský, S Kiefer, M Pilipczuk, S Toruńczyk
Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer …, 2022
82022
Parameterized shifted combinatorial optimization
J Gajarský, P Hliněný, M Koutecký, S Onn
Journal of Computer and System Sciences 99, 53-71, 2019
82019
Differential games, locality and model checking for FO logic of graphs
J Gajarský, M Gorsky, S Kreutzer
arXiv preprint arXiv:2007.11345, 2020
72020
Computing shrub-depth decompositions
J Gajarský, S Kreutzer
37th International Symposium on Theoretical Aspects of Computer Science …, 2020
72020
First order limits of sparse graphs: Plane trees and path‐width
J Gajarský, P Hliněný, T Kaiser, D Král’, M Kupec, J Obdržálek, ...
Random Structures & Algorithms 50 (4), 612-635, 2017
72017
’, M. Kupec, J. Obdrzálek, S. Ordyniak, and V. Tuma, First order limits of sparse graphs: Plane trees and path-width
J Gajarský, P Hlinený, T Kaiser, D Král
arXiv preprint arXiv:1504.08122, 2015
72015
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20