| A parallel Java Grande benchmark suite LA Smith, JM Bull, J Obdrzalek Proceedings of the 2001 ACM/IEEE Conference on Supercomputing, 8-8, 2001 | 285 | 2001 |
| DAG-width: connectivity measure for directed graphs J Obdrzálek SODA 6, 814-821, 2006 | 113 | 2006 |
| Fast mu-calculus model checking when tree-width is bounded J Obdržálek Computer Aided Verification (CAV), 80-92, 2003 | 109 | 2003 |
| The dag-width of directed graphs D Berwanger, A Dawar, P Hunter, S Kreutzer, J Obdržálek Journal of Combinatorial Theory, Series B 102 (4), 900-923, 2012 | 104 | 2012 |
| When Trees Grow Low: Shrubs and Fast MSO1 R Ganian, P Hliněný, J Nešetřil, J Obdržálek, P Ossona de Mendez, ... Mathematical Foundations of Computer Science 2012: 37th International …, 2012 | 73 | 2012 |
| 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 | 70 | 2017 |
| Are there any good digraph width measures? R Ganian, P Hliněný, J Kneis, D Meister, J Obdržálek, P Rossmanith, ... Parameterized and Exact Computation: 5th International Symposium, IPEC 2010 …, 2010 | 60 | 2010 |
| 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 | 53 | 2020 |
| Towards OpenMP for Java M Bull, M Kambites, J Obdržálek, M Westhead Proceedings of the Second European Workshop on OpenMP (EWOMP 2000), 98-105, 2000 | 52 | 2000 |
| Digraph width measures in parameterized algorithmics R Ganian, P Hliněný, J Kneis, A Langer, J Obdržálek, P Rossmanith Discrete applied mathematics 168, 88-107, 2014 | 50 | 2014 |
| On Digraph Width Measures in Parameterized Algorithmics. R Ganian, P Hlinený, J Kneis, A Langer, J Obdrzálek, P Rossmanith IWPEC 5917, 185-197, 2009 | 48 | 2009 |
| Shrub-depth: Capturing height of dense graphs PO de Mendez, J Obdržálek, J Nešetřil, P Hliněný, R Ganian Logical Methods in Computer Science 15, 2019 | 45 | 2019 |
| 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 |
| Qualitative reachability in stochastic BPA games T Brázdil, V Brožek, A Kučera, J Obdržálek Information and Computation 209 (8), 1160-1183, 2011 | 44 | 2011 |
| Lower Bounds on the Complexity of MSO_1 Model-Checking R Ganian, P Hliněný, J Obdržálek, A Langer, P Rossmanith, S Sikdar 29th International Symposium on Theoretical Aspects of Computer Science …, 2012 | 39 | 2012 |
| Clique-width and parity games J Obdržálek Computer Science Logic: 21st International Workshop, CSL 2007, 16th Annual …, 2007 | 38 | 2007 |
| Are there any good digraph width measures? R Ganian, P Hliněný, J Kneis, D Meister, J Obdržálek, P Rossmanith, ... Journal of Combinatorial Theory, Series B 116, 250-286, 2016 | 35 | 2016 |
| Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width R Ganian, P Hliněný, J Obdržálek Foundations of Software Technology and Theoretical Computer Science (FSTTCS …, 2010 | 35 | 2010 |
| FO model checking of interval graphs R Ganian, P Hliněný, D Král’, J Obdržálek, J Schwartz, J Teska Automata, Languages, and Programming: 40th International Colloquium, ICALP …, 2013 | 31 | 2013 |
| Algorithmic analysis of parity games J Obdrzalek PhD thesis, University of Edinburgh, 2006 | 26 | 2006 |
