| Parameterized algorithms for modular-width J Gajarský, M Lampis, S Ordyniak Parameterized and Exact Computation: 8th International Symposium, IPEC 2013 …, 2013 | 88 | 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 | 71 | 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 | 71 | 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 | 63 | 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 | 55 | 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 | 45 | 2015 |
| Kernelizing MSO properties of trees of fixed height, and some consequences J Gajarsky, P Hlineny arXiv preprint arXiv:1204.5194, 2012 | 42 | 2012 |
| 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 | 20 | 2022 |
| Faster existential FO model checking on posets J Gajarský, P Hliněný, J Obdržálek, S Ordyniak Algorithms and Computation: 25th International Symposium, ISAAC 2014, Jeonju …, 2014 | 15 | 2014 |
| Twin-width and generalized coloring numbers J Dreier, J Gajarský, Y Jiang, PO de Mendez, JF Raymond Discrete Mathematics 345 (3), 112746, 2022 | 11 | 2022 |
| 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 |
| Parameterized algorithms for parity games J Gajarský, M Lampis, K Makino, V Mitsou, S Ordyniak Mathematical Foundations of Computer Science 2015: 40th International …, 2015 | 10 | 2015 |
| Recovering sparse graphs J Gajarsky, D Králʼ Leibniz International Proceedings in Informatics (LIPIcs) 117, 29, 2018 | 9 | 2018 |
| 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 | 8 | 2022 |
| 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 |
| 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 |
| Efficient solvability of graph MSO properties J Gajarsky Master's thesis, Masaryk University, Brno, 2012 | 7 | 2012 |
| 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 | 6 | 2022 |
| Twin-width and types J Gajarský, M Pilipczuk, W Przybyszewski, S Toruńczyk arXiv preprint arXiv:2206.08248, 2022 | 5 | 2022 |
Petr HlinenyMasaryk University, Brno, CZVerified email at fi.muni.cz
