Jakub Gajarsky
Title
Cited by
Cited by
Year
Parameterized algorithms for modular-width
J Gajarský, M Lampis, S Ordyniak
International Symposium on Parameterized and Exact Computation, 163-176, 2013
652013
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
622017
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
622017
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
422020
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
412020
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
372015
Kernelizing MSO properties of trees of fixed height, and some consequences
J Gajarsky, P Hlineny
arXiv preprint arXiv:1204.5194, 2012
252012
Kernelizing MSO properties of trees of fixed height, and some consequences
P Hlineny, J Gajarsky
Logical Methods in Computer Science 11, 2015
182015
Faster existential FO model checking on posets
J Gajarský, P Hliněný, J Obdržálek, S Ordyniak
International Symposium on Algorithms and Computation, 441-451, 2014
142014
Parameterized shifted combinatorial optimization
J Gajarský, P Hliněný, M Koutecký, S Onn
Journal of Computer and System Sciences 99, 53-71, 2019
92019
Recovering sparse graphs
J Gajarský, D Král
43rd International Symposium on Mathematical Foundations of Computer Science …, 2018
92018
Parameterized algorithms for parity games
J Gajarský, M Lampis, K Makino, V Mitsou, S Ordyniak
International Symposium on Mathematical Foundations of Computer Science, 336-347, 2015
92015
Efficient solvability of graph MSO properties
J GAJARSKÝ
Masarykova univerzita, Fakulta informatiky, 2012
82012
Parameterized extension complexity of independent set and related problems
J Gajarský, P Hliněný, HR Tiwary
Discrete Applied Mathematics 248, 56-67, 2018
72018
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
62015
Computing shrub-depth decompositions
J Gajarský, S Kreutzer
37th International Symposium on Theoretical Aspects of Computer Science …, 2020
42020
Twin-width and generalized coloring numbers
J Dreier, J Gajarský, Y Jiang, PO de Mendez, JF Raymond
Discrete Mathematics 345 (3), 112746, 2022
32022
Stable graphs of bounded twin-width
J Gajarský, M Pilipczuk, S Toruńczyk
arXiv preprint arXiv:2107.03711, 2021
32021
Deciding Graph MSO Properties: Has it all been told already?
J Gajarský, P Hliněný
32012
The system can't perform the operation now. Try again later.
Articles 1–20