Jan Obdrzálek

According to our database, Jan Obdrzálek authored at least 30 papers between 2001 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Minuska: Towards a Formally Verified Programming Language Framework.

Jan Tusil, Jan Obdrzálek

CoRR, 2024

2023

Cartesian Reachability Logic: A Language-parametric Logic for Verifying k-Safety Properties.

Jan Tusil, Traian Serbanuta, Jan Obdrzálek

Proceedings of the LPAR 2023: Proceedings of 24th International Conference on Logic for Programming, 2023

2020

A New Perspective on FO Model Checking of Dense Graph Classes.

Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan

ACM Trans. Comput. Log., 2020

2019

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

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

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

2016

Are there any good digraph width measures?

Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar

J. Comb. Theory B, 2016

Tree-depth and vertex-minors.

Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak

Eur. J. Comb., 2016

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

Faster Existential FO Model Checking on Posets.

Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak

Log. Methods Comput. Sci., 2015

FO Model Checking on Posets of Bounded Width.

Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014

Lower bounds on the complexity of MSO₁ model-checking.

Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar

J. Comput. Syst. Sci., 2014

Digraph width measures in parameterized algorithmics.

Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith

Discret. Appl. Math., 2014

Finite Integer Index of Pathwidth and Treewidth.

Jakub Gajarský, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar

Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

2013

Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width.

Robert Ganian, Petr Hlinený, Jan Obdrzálek

Fundam. Informaticae, 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

Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes.

Robert Ganian, Jan Obdrzálek

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012

The dag-width of directed graphs.

Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer, Jan Obdrzálek

J. Comb. Theory B, 2012

Lower Bounds on the Complexity of MSO_1 Model-Checking.

Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

When Trees Grow Low: Shrubs and Fast MSO1.

Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez, Reshma Ramadurai

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011

Qualitative reachability in stochastic BPA games.

Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek

Inf. Comput., 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

Clique-width: When Hard Does Not Mean Impossible.

Robert Ganian, Petr Hlinený, Jan Obdrzálek

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

STANSE: Bug-Finding Framework for C Programs.

Jan Obdrzálek, Jiri Slaby, Marek Trtík

Proceedings of the Mathematical and Engineering Methods in Computer Science, 2011

Efficient Loop Navigation for Symbolic Execution.

Jan Obdrzálek, Marek Trtík

Proceedings of the Automated Technology for Verification and Analysis, 2011

2007

Clique-Width and Parity Games.

Jan Obdrzálek

Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2006

DAG-width: connectivity measure for directed graphs.

Jan Obdrzálek

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2003

Fast Mu-Calculus Model Checking when Tree-Width Is Bounded.

Jan Obdrzálek

Proceedings of the Computer Aided Verification, 15th International Conference, 2003

2001

An OpenMP-like interface for parallel programming in Java.

Mark E. Kambites, Jan Obdrzálek, J. Mark Bull

Concurr. Comput. Pract. Exp., 2001

A parallel java grande benchmark suite.

L. A. Smith, J. Mark Bull, Jan Obdrzálek

Proceedings of the 2001 ACM/IEEE conference on Supercomputing, 2001