A parallel java grande benchmark suite LA Smith, JM Bull, J Obdrzalek Proceedings of the 2001 ACM/IEEE Conference on Supercomputing, 8-8, 2001 | 286 | 2001 |

Fyzika. D Halliday, R Resnick, J Walker, P Dub, M Černý, J Komrska, M Lenc, ... Vutium, 2013 | 117 | 2013 |

DAG-width: connectivity measure for directed graphs J Obdrzálek SODA 6, 814-821, 2006 | 117 | 2006 |

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 | 115 | 2012 |

Fast mu-calculus model checking when tree-width is bounded J Obdržálek Computer Aided Verification (CAV), 80-92, 2003 | 112 | 2003 |

When Trees Grow Low: Shrubs and Fast MSO_{1}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 | 78 | 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 | 77 | 2017 |

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 | 65 | 2020 |

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 |

Shrub-depth: Capturing height of dense graphs R Ganian, P Hliněný, J Nešetřil, J Obdržálek, PO De Mendez Logical Methods in Computer Science 15, 2019 | 55 | 2019 |

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 | 55 | 2014 |

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 |

On digraph width measures in parameterized algorithmics R Ganian, P Hliněný, J Kneis, A Langer, J Obdržálek, P Rossmanith Parameterized and Exact Computation: 4th International Workshop, IWPEC 2009 …, 2009 | 48 | 2009 |

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 | 47 | 2011 |

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 | 46 | 2015 |

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 | 44 | 2016 |

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 | 42 | 2012 |

Clique-width and parity games J Obdržálek International Workshop on Computer Science Logic, 54-68, 2007 | 39 | 2007 |

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 Hlineny, D Král, J Obdrzálek, J Schwartz, J Teska Logical Methods in Computer Science 11, 2015 | 34 | 2015 |