Contact information
Mgr. Jan Obdržálek, PhD.
Fakulta informatiky MU
Botanická 68a
602 00 Brno
Czech Republic
Academic profile
Research interests
Structural graph theory, infinite games on graphs (esp. parity games), mu-calculus, verification of infinite state systems, software model checking, OpenMP for Java.
Selected Publications
-
On Digraph Width Measures in Parameterized Algorithmics
with R. Ganian, P. Hliněný, J. Kneis, A. Langer and P. Rossmanith
Accepted to IWPEC 2009
-
Qualitative Reachability in Stochastic BPA Games
with T. Brázdil, V. Brožek and A. Kučera
[PDF] [BibTeX] [Slides]
In proceedings of STACS 2009.
Full version with proofs: Technical report FIMU-RS-2009-01
-
Clique-Width and Parity Games
[PDF] [BibTeX] [Slides]
In proceedings of CSL 2007, volume 4646 of LNCS series. © Springer-Verlag.
- The DAG-Width of Directed Graphs
with Dietmar Berwanger, Anuj Dawar, Paul Hunter and Stephan Kreutzer
Submitted to the Journal of Combinatorial Theory, Series B.
-
DAG-width - Connectivity Measure for Directed Graphs
[PDF] [BibTeX] [Slides]
In Proceedings of SODA 2006. © SIAM
-
Fast mu-calculus Model Checking when Tree-width is Bounded
(Corrected version, including detailed algorithms)
[PDF] [BibTeX] [Slides]
In Proceedings of CAV 2003, volume 2725 of LNCS series. © Springer-Verlag
Older papers and the complete list can be found
here.
Theses
Projects
... in the past
CV
Academic CV:
[PDF]
PhD students
Course information
Courses in the past
Various resources

Jan Obdržálek
Last modified: Thursday, 02-Jul-2009 14:54:30 CEST
