doc. Mgr. Jan Obdržálek, PhD.

2010

• Better algorithms for satisfiability problems for formulas of bounded rank-width

  GANIAN Robert HLINĚNÝ Petr OBDRŽÁLEK Jan

  Article in Proceedings

  IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), year: 2010

• Česko-Slovenská Konference GRAFY 2010

  HLINĚNÝ Petr OBDRŽÁLEK Jan VETCHÝ Vladimír GANIAN Robert

  Conference

  Year: 2010, type: Conference

• Proceedings of the 45th Czech-Slovak Conference GRAFY 2010

  OBDRŽÁLEK Jan

  Year: 2010, type:

2009

• On Digraph Width Measures in Parameterized Algorithmics

  GANIAN Robert HLINĚNÝ Petr OBDRŽÁLEK Jan LANGER Alexander KNEIS Joachim ROSSMANITH Peter

  Article in Proceedings

  IWPEC 2009: International Workshop on Parameterized and Exact Computation, Lecture Notes in Computer Science, year: 2009

• Qualitative Reachability in Stochastic BPA Games

  BRÁZDIL Tomáš BROŽEK Václav KUČERA Antonín OBDRŽÁLEK Jan

  Article in Proceedings

  Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, year: 2009

2007

• Clique-Width and Parity Games

  OBDRŽÁLEK Jan

  Article in Proceedings

  Computer Science Logic 2007, proceedings, year: 2007

2006

• DAG-width - Connectivity Measure for Directed Graphs

  OBDRŽÁLEK Jan

  Article in Proceedings

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

• Escape-width: Measuring "width" of digraphs

  HLINĚNÝ Petr OBDRŽÁLEK Jan

  Conference abstract

  Year: 2006, type: Conference abstract

2003

• Fast Mu-calculus Model Checking when Tree-width is Bounded

  OBDRŽÁLEK Jan

  Article in Proceedings

  CAV 2003, year: 2003

2001

• A Parallel Java Grande Benchmark Suite

  OBDRŽÁLEK Jan BULL J. M. SMITH L. A.

  Article in Proceedings

  Proceedings of the 2001 ACM/IEEE conference on Supercomputing (CDROM), year: 2001