Jan Obdrzálek

According to our database1, Jan Obdrzálek authored at least 26 papers between 2003 and 2017.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


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

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

A New Perspective on FO Model Checking of Dense Graph Classes.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

FO Model Checking of Interval Graphs
Logical Methods in Computer Science, 2015

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

Lower bounds on the complexity of MSO1 model-checking.
J. Comput. Syst. Sci., 2014

Digraph width measures in parameterized algorithmics.
Discrete Applied Mathematics, 2014

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

Faster Existential FO Model Checking on Posets.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

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

FO Model Checking of Interval Graphs.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Kernelization Using Structural Parameters on Sparse Graph Classes.
Proceedings of the Algorithms - ESA 2013, 2013

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

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

Are There Any Good Digraph Width Measures?
Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Qualitative Reachability in Stochastic BPA Games.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

On Digraph Width Measures in Parameterized Algorithmics.
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

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

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

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