Jan Obdrzálek

Publication Activity (10 Years)

Years Active: 2001-2023
Publications (10 Years): 14

Top Topics

Top Venues

Log. Methods Comput. Sci.

J. Comput. Syst. Sci.

Publications

Jan Tusil, Traian Serbanuta, Jan Obdrzálek
Cartesian Reachability Logic: A Language-parametric Logic for Verifying k-Safety Properties. LPAR (2023)
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan
A New Perspective on FO Model Checking of Dense Graph Classes. ACM Trans. Comput. Log. 21 (4) (2020)
Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez
Shrub-depth: Capturing Height of Dense Graphs. Log. Methods Comput. Sci. 15 (1) (2019)
Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, M. S. Ramanujan
A New Perspective on FO Model Checking of Dense Graph Classes. CoRR (2018)
Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez
Shrub-depth: Capturing Height of Dense Graphs. CoRR (2017)
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
Kernelization using structural parameters on sparse graph classes. J. Comput. Syst. Sci. 84 (2017)
Jakub Gajarský, Petr Hlinený, Tomás Kaiser, Daniel Král', Martin Kupec, Jan Obdrzálek, Sebastian Ordyniak, Vojtech Tuma
First order limits of sparse graphs: Plane trees and path-width. Random Struct. Algorithms 50 (4) (2017)
Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak
Tree-depth and vertex-minors. Eur. J. Comb. 56 (2016)
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan
A New Perspective on FO Model Checking of Dense Graph Classes. LICS (2016)
Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
Are there any good digraph width measures? J. Comb. Theory, Ser. B 116 (2016)
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak
Faster Existential FO Model Checking on Posets. Log. Methods Comput. Sci. 11 (4) (2015)
Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh
FO Model Checking on Posets of Bounded Width. CoRR (2015)
Robert Ganian, Petr Hlinený, Daniel Král, Jan Obdrzálek, Jarett Schwartz, Jakub Teska
FO Model Checking of Interval Graphs Log. Methods Comput. Sci. 11 (4) (2015)
Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh
FO Model Checking on Posets of Bounded Width. FOCS (2015)
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak
Faster Existential FO Model Checking on Posets. ISAAC (2014)
Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak
Tree-depth and Vertex-minors. CoRR (2014)
Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
model-checking. J. Comput. Syst. Sci. 80 (1) (2014)
Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith
Digraph width measures in parameterized algorithmics. Discret. Appl. Math. 168 (2014)
Jakub Gajarský, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
Finite Integer Index of Pathwidth and Treewidth. IPEC (2014)
Robert Ganian, Petr Hlinený, Jan Obdrzálek
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. Fundam. Informaticae 123 (1) (2013)
Robert Ganian, Jan Obdrzálek
Expanding the expressive power of Monadic Second-Order logic on restricted graph classes. CoRR (2013)
Robert Ganian, Jan Obdrzálek
Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes. IWOCA (2013)
Robert Ganian, Petr Hlinený, Daniel Král', Jan Obdrzálek, Jarett Schwartz, Jakub Teska
FO Model Checking of Interval Graphs. ICALP (2) (2013)
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
Kernelization Using Structural Parameters on Sparse Graph Classes CoRR (2013)
Robert Ganian, Petr Hlinený, Jan Obdrzálek
A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width. Eur. J. Comb. 34 (3) (2013)
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
Kernelization Using Structural Parameters on Sparse Graph Classes. ESA (2013)
Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
Lower Bounds on the Complexity of MSO_1 Model-Checking. STACS (2012)
Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer, Jan Obdrzálek
The dag-width of directed graphs. J. Comb. Theory, Ser. B 102 (4) (2012)
Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez, Reshma Ramadurai
When Trees Grow Low: Shrubs and Fast MSO1. MFCS (2012)
Jan Obdrzálek, Jiri Slaby, Marek Trtík
STANSE: Bug-finding Framework for C Programs CoRR (2012)
Jan Obdrzálek, Marek Trtík
Efficient Loop Navigation for Symbolic Execution CoRR (2011)
Robert Ganian, Petr Hlinený, Jan Obdrzálek
Clique-width: When Hard Does Not Mean Impossible. STACS (2011)
Jan Obdrzálek, Marek Trtík
Efficient Loop Navigation for Symbolic Execution. ATVA (2011)
Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek
Qualitative reachability in stochastic BPA games. Inf. Comput. 209 (8) (2011)
Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
Lower Bounds on the Complexity of MSO1 Model-Checking CoRR (2011)
Jan Obdrzálek, Jiri Slaby, Marek Trtík
STANSE: Bug-Finding Framework for C Programs. MEMICS (2011)
Robert Ganian, Petr Hlinený, Jan Obdrzálek
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. FSTTCS (2010)
Robert Ganian, Petr Hlinený, Jan Obdrzálek
Better algorithms for satisfiability problems for formulas of bounded rank-width CoRR (2010)
Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
Are There Any Good Digraph Width Measures? IPEC (2010)
Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
Are there any good digraph width measures? CoRR (2010)
Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek
Qualitative Reachability in Stochastic BPA Games CoRR (2010)
Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith
On Digraph Width Measures in Parameterized Algorithmics. IWPEC (2009)
Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek
Qualitative Reachability in Stochastic BPA Games. STACS (2009)
Jan Obdrzálek
Clique-Width and Parity Games. CSL (2007)
Jan Obdrzálek
DAG-width: connectivity measure for directed graphs. SODA (2006)
Jan Obdrzálek
Fast Mu-Calculus Model Checking when Tree-Width Is Bounded. CAV (2003)
Mark E. Kambites, Jan Obdrzálek, J. Mark Bull
An OpenMP-like interface for parallel programming in Java. Concurr. Comput. Pract. Exp. 13 (8-9) (2001)
L. A. Smith, J. Mark Bull, Jan Obdrzálek
A parallel java grande benchmark suite. SC (2001)