| Parameterized algorithms for modular-width J Gajarský, M Lampis, S Ordyniak International Symposium on Parameterized and Exact Computation, 163-176, 2013 | 68 | 2013 |
| 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 | 65 | 2017 |
| 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 | 65 | 2017 |
| 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 | 46 | 2020 |
| 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 | 44 | 2020 |
| 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 | 41 | 2015 |
| Kernelizing MSO properties of trees of fixed height, and some consequences J Gajarsky, P Hlineny arXiv preprint arXiv:1204.5194, 2012 | 26 | 2012 |
| Kernelizing MSO properties of trees of fixed height, and some consequences P Hlineny, J Gajarsky Logical Methods in Computer Science 11, 2015 | 20 | 2015 |
| 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 | 16 | 2014 |
| Parameterized shifted combinatorial optimization J Gajarský, P Hliněný, M Koutecký, S Onn Journal of Computer and System Sciences 99, 53-71, 2019 | 10 | 2019 |
| Recovering sparse graphs J Gajarský, D Král 43rd International Symposium on Mathematical Foundations of Computer Science …, 2018 | 9 | 2018 |
| 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 | 9 | 2015 |
| Stable graphs of bounded twin-width J Gajarský, M Pilipczuk, S Toruńczyk arXiv preprint arXiv:2107.03711, 2021 | 8 | 2021 |
| Parameterized extension complexity of independent set and related problems J Gajarský, P Hliněný, HR Tiwary Discrete Applied Mathematics 248, 56-67, 2018 | 8 | 2018 |
| Efficient solvability of graph MSO properties J Gajarsky Master's thesis, Masaryk University, Brno, 2012 | 8 | 2012 |
| 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 | 7 | 2017 |
| ’, 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 | 7 | 2015 |
| Twin-width and generalized coloring numbers J Dreier, J Gajarský, Y Jiang, PO de Mendez, JF Raymond Discrete Mathematics 345 (3), 112746, 2022 | 6 | 2022 |
| Computing shrub-depth decompositions J Gajarský, S Kreutzer 37th International Symposium on Theoretical Aspects of Computer Science …, 2020 | 5 | 2020 |
| Deciding Graph MSO Properties: Has it all been told already? J Gajarský, P Hliněný | 3 | 2012 |
