Jan Obdrzálek

Orcid: 0000-0002-6655-7798

According to our database1, Jan Obdrzálek authored at least 29 papers between 2001 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Cartesian Reachability Logic: A Language-parametric Logic for Verifying k-Safety Properties.
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.
ACM Trans. Comput. Log., 2020

2019
Shrub-depth: Capturing Height of Dense Graphs.
Log. Methods Comput. Sci., 2019

2017
First order limits of sparse graphs: Plane trees and path-width.
Random Struct. Algorithms, 2017

Kernelization using structural parameters on sparse graph classes.
J. Comput. Syst. Sci., 2017

2016
Are there any good digraph width measures?
J. Comb. Theory, Ser. B, 2016

Tree-depth and vertex-minors.
Eur. J. Comb., 2016

2015
FO Model Checking of Interval Graphs
Log. Methods Comput. Sci., 2015

Faster Existential FO Model Checking on Posets.
Log. Methods Comput. Sci., 2015

FO Model Checking on Posets of Bounded Width.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014
Lower bounds on the complexity of MSO<sub>1</sub> model-checking.
J. Comput. Syst. Sci., 2014

Digraph width measures in parameterized algorithmics.
Discret. Appl. Math., 2014

Finite Integer Index of Pathwidth and Treewidth.
Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

2013
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width.
Fundam. Informaticae, 2013

A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width.
Eur. J. Comb., 2013

Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012
The dag-width of directed graphs.
J. Comb. Theory, Ser. B, 2012

Lower Bounds on the Complexity of MSO_1 Model-Checking.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

When Trees Grow Low: Shrubs and Fast MSO1.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011
Qualitative reachability in stochastic BPA games.
Inf. Comput., 2011

Lower Bounds on the Complexity of MSO1 Model-Checking
CoRR, 2011

Clique-width: When Hard Does Not Mean Impossible.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

STANSE: Bug-Finding Framework for C Programs.
Proceedings of the Mathematical and Engineering Methods in Computer Science, 2011

Efficient Loop Navigation for Symbolic Execution.
Proceedings of the Automated Technology for Verification and Analysis, 2011

2007
Clique-Width and Parity Games.
Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2006
DAG-width: connectivity measure for directed graphs.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2003
Fast Mu-Calculus Model Checking when Tree-Width Is Bounded.
Proceedings of the Computer Aided Verification, 15th International Conference, 2003

2001
An OpenMP-like interface for parallel programming in Java.
Concurr. Comput. Pract. Exp., 2001

A parallel java grande benchmark suite.
Proceedings of the 2001 ACM/IEEE conference on Supercomputing, 2001


  Loading...