Jan Obdrzálek

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

Collaborative distances :

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

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

Shrub-depth: Capturing Height of Dense Graphs.
CoRR, 2017

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

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

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

Faster Existential FO Model Checking on Posets.
Logical Methods in Computer Science, 2015

FO Model Checking on Posets of Bounded Width.
CoRR, 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 MSO1 model-checking.
J. Comput. Syst. Sci., 2014

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

Tree-depth and Vertex-minors.
CoRR, 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

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

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

Kernelization Using Structural Parameters on Sparse Graph Classes
CoRR, 2013

Expanding the expressive power of Monadic Second-Order logic on restricted graph classes.
CoRR, 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

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

STANSE: Bug-finding Framework for C Programs
CoRR, 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

Efficient Loop Navigation for Symbolic Execution
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

2010
Better algorithms for satisfiability problems for formulas of bounded rank-width
CoRR, 2010

Are there any good digraph width measures?
CoRR, 2010

Qualitative Reachability in Stochastic BPA Games
CoRR, 2010

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

2009
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

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


  Loading...