A parallel java grande benchmark suite. - L. A. Smith; J. Mark Bull; Jan Obdrzálek (SC, 2001)

An OpenMP-like interface for parallel programming in Java. - Mark E. Kambites; Jan Obdrzálek; J. Mark Bull (Concurr. Comput. Pract. Exp., 2001)

Fast Mu-Calculus Model Checking when Tree-Width Is Bounded. - Jan Obdrzálek (CAV, 2003)

DAG-width: connectivity measure for directed graphs. - Jan Obdrzálek (SODA, 2006)

Clique-Width and Parity Games. - Jan Obdrzálek (CSL, 2007)

Efficient Loop Navigation for Symbolic Execution. - Jan Obdrzálek; Marek Trtík (ATVA, 2011)

STANSE: Bug-Finding Framework for C Programs. - Jan Obdrzálek; Jiri Slaby; Marek Trtík (MEMICS, 2011)

Clique-width: When Hard Does Not Mean Impossible. - Robert Ganian; Petr Hlinený; Jan Obdrzálek (STACS, 2011)

Lower Bounds on the Complexity of MSO1 Model-Checking - Robert Ganian; Petr Hlinený; Alexander Langer; Jan Obdrzálek; Peter Rossmanith; Somnath Sikdar (CoRR, 2011)

Qualitative reachability in stochastic BPA games. - Tomás Brázdil; Václav Brozek; Antonín Kucera 001; Jan Obdrzálek (Inf. Comput., 2011)

When Trees Grow Low: Shrubs and Fast MSO1. - Robert Ganian; Petr Hlinený; Jaroslav Nesetril; Jan Obdrzálek; Patrice Ossona de Mendez; Reshma Ramadurai (MFCS, 2012)

Lower Bounds on the Complexity of MSO_1 Model-Checking. - Robert Ganian; Petr Hlinený; Alexander Langer; Jan Obdrzálek; Peter Rossmanith; Somnath Sikdar (STACS, 2012)

The dag-width of directed graphs. - Dietmar Berwanger; Anuj Dawar; Paul Hunter 001; Stephan Kreutzer; Jan Obdrzálek (J. Comb. Theory B, 2012)

Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes. - Robert Ganian; Jan Obdrzálek (IWOCA, 2013)

A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width. - Robert Ganian; Petr Hlinený; Jan Obdrzálek (Eur. J. Comb., 2013)

Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. - Robert Ganian; Petr Hlinený; Jan Obdrzálek (Fundam. Informaticae, 2013)

Finite Integer Index of Pathwidth and Treewidth. - Jakub Gajarský; Jan Obdrzálek; Sebastian Ordyniak; Felix Reidl; Peter Rossmanith; Fernando Sánchez Villaamil; Somnath Sikdar (IPEC, 2014)

Digraph width measures in parameterized algorithmics. - Robert Ganian; Petr Hlinený; Joachim Kneis; Alexander Langer; Jan Obdrzálek; Peter Rossmanith (Discret. Appl. Math., 2014)

Lower bounds on the complexity of MSO1 model-checking. - Robert Ganian; Petr Hlinený; Alexander Langer; Jan Obdrzálek; Peter Rossmanith; Somnath Sikdar (J. Comput. Syst. Sci., 2014)

FO Model Checking on Posets of Bounded Width. - Jakub Gajarský; Petr Hlinený; Daniel Lokshtanov; Jan Obdrzálek; Sebastian Ordyniak; M. S. Ramanujan 001; Saket Saurabh 001 (FOCS, 2015)

Faster Existential FO Model Checking on Posets. - Jakub Gajarský; Petr Hlinený; Jan Obdrzálek; Sebastian Ordyniak (Log. Methods Comput. Sci., 2015)

FO Model Checking of Interval Graphs - Robert Ganian; Petr Hlinený; Daniel Král; Jan Obdrzálek; Jarett Schwartz; Jakub Teska (Log. Methods Comput. Sci., 2015)

Tree-depth and vertex-minors. - Petr Hlinený; O-joung Kwon; Jan Obdrzálek; Sebastian Ordyniak (Eur. J. Comb., 2016)

Are there any good digraph width measures? - Robert Ganian; Petr Hlinený; Joachim Kneis; Daniel Meister 001; Jan Obdrzálek; Peter Rossmanith; Somnath Sikdar (J. Comb. Theory B, 2016)

Kernelization using structural parameters on sparse graph classes. - Jakub Gajarský; Petr Hlinený; Jan Obdrzálek; Sebastian Ordyniak; Felix Reidl; Peter Rossmanith; Fernando Sánchez Villaamil; Somnath Sikdar (J. Comput. Syst. Sci., 2017)

First order limits of sparse graphs: Plane trees and path-width. - Jakub Gajarský; Petr Hlinený; Tomás Kaiser; Daniel Král'; Martin Kupec; Jan Obdrzálek; Sebastian Ordyniak; Vojtech Tuma (Random Struct. Algorithms, 2017)

Shrub-depth: Capturing Height of Dense Graphs. - Robert Ganian; Petr Hlinený; Jaroslav Nesetril; Jan Obdrzálek; Patrice Ossona de Mendez (Log. Methods Comput. Sci., 2019)

A New Perspective on FO Model Checking of Dense Graph Classes. - Jakub Gajarský; Petr Hlinený; Jan Obdrzálek; Daniel Lokshtanov; M. S. Ramanujan 001 (ACM Trans. Comput. Log., 2020)

Cartesian Reachability Logic: A Language-parametric Logic for Verifying k-Safety Properties. - Jan Tusil; Traian Serbanuta; Jan Obdrzálek (LPAR, 2023)

Minuska: Towards a Formally Verified Programming Language Framework. - Jan Tusil; Jan Obdrzálek (SEFM, 2024)

Beyond Occlusion: In Search for Near Real-Time Explainability of CNN-Based Prostate Cancer Classification. - Martin Krebs; Jan Obdrzálek; Vít Musil; Tomás Brázdil (ISBI, 2025)