| Parameterized algorithms for modular-width J Gajarský, M Lampis, S Ordyniak International Symposium on Parameterized and Exact Computation, 163-176, 2013 | 152 | 2013 |
| First-order interpretations of bounded expansion classes J Gajarský, S Kreutzer, J Nešetřil, PO Mendez, M Pilipczuk, S Siebertz, ... ACM Transactions on Computational Logic (TOCL) 21 (4), 1-41, 2020 | 88 | 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 | 82 | 2020 |
| 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 | 78 | 2017 |
| 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 | 56 | 2015 |
| 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 | 49 | 2022 |
| Kernelizing MSO properties of trees of fixed height, and some consequences J Gajarsky, P Hlineny Logical Methods in Computer Science 11, 2015 | 39 | 2015 |
| Faster deciding MSO properties of trees of fixed height, and some consequences J Gajarsky, P Hlineny IARCS Annual Conference on Foundations of Software Technology and …, 2012 | 28 | 2012 |
| 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 | 26 | 2022 |
| Flipper games for monadically stable graph classes J Gajarský, N Mählmann, R McCarty, P Ohlmann, M Pilipczuk, ... arXiv preprint arXiv:2301.13735, 2023 | 25 | 2023 |
| Twin-width and generalized coloring numbers J Dreier, J Gajarský, Y Jiang, PO de Mendez, JF Raymond Discrete Mathematics 345 (3), 112746, 2022 | 25 | 2022 |
| Twin-width and types J Gajarský, M Pilipczuk, W Przybyszewski, S Toruńczyk arXiv preprint arXiv:2206.08248, 2022 | 22 | 2022 |
| Faster existential FO model checking on posets J Gajarský, P Hliněný, J Obdržálek, S Ordyniak Logical Methods in Computer Science 11, 2015 | 19 | 2015 |
| 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 | 13 | 2022 |
| Differential games, locality and model checking for FO logic of graphs J Gajarský, M Gorsky, S Kreutzer arXiv preprint arXiv:2007.11345, 2020 | 12 | 2020 |
| 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 | 12 | 2015 |
| Taming graphs with no large creatures and skinny ladders J Gajarský, L Jaffke, PT De Lima, J Masaříková, M Pilipczuk, P Rzążewski, ... SIAM Journal on Discrete Mathematics 38 (4), 3140-3149, 2024 | 11 | 2024 |
| Recovering sparse graphs J Gajarsky, D Král arXiv preprint arXiv:1709.09985, 2017 | 10 | 2017 |
| Computing shrub-depth decompositions J Gajarský, S Kreutzer 37th International Symposium on Theoretical Aspects of Computer Science …, 2020 | 9 | 2020 |
| 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 | 9 | 2017 |
Petr HlinenyMasaryk University, Brno, CZVerified email at fi.muni.cz
