Jan Obdržálek
Title
Cited by
Cited by
Year
Fyzika.
D Halliday, R Resnick, J Walker, P Dub, M Černý, J Komrska, M Lenc, ...
Vutium, 2013
1682013
DAG-width: connectivity measure for directed graphs
J Obdržálek
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006
1082006
Fast mu-calculus model checking when tree-width is bounded
J Obdržálek
Computer Aided Verification (CAV), 80-92, 2003
1002003
The dag-width of directed graphs
D Berwanger, A Dawar, P Hunter, S Kreutzer, J Obdržálek
Journal of Combinatorial Theory, Series B 102 (4), 900-923, 2012
922012
Kernelization using structural parameters on sparse graph classes
J Gajarský, P Hliněný, J Obdržálek, S Ordyniak, F Reidl, P Rossmanith, ...
Journal of Computer and System Sciences 84, 219-242, 2017
622017
When Trees Grow Low: Shrubs and Fast MSO1
R Ganian, P Hliněný, J Nešetřil, J Obdržálek, PO de Mendez, ...
International Symposium on Mathematical Foundations of Computer Science, 419-430, 2012
592012
Are there any good digraph width measures?
R Ganian, P Hliněný, J Kneis, D Meister, J Obdržálek, P Rossmanith, ...
International Symposium on Parameterized and Exact Computation, 135-146, 2010
542010
Towards OpenMP for Java
M Bull, M Kambites, J Obdržálek, M Westhead
Proceedings of the Second European Workshop on OpenMP (EWOMP 2000), 98-105, 2000
522000
On digraph width measures in parameterized algorithmics
R Ganian, P Hliněný, J Kneis, A Langer, J Obdržálek, P Rossmanith
International Workshop on Parameterized and Exact Computation, 185-197, 2009
452009
Qualitative reachability in stochastic BPA games
T Brázdil, V Brožek, A Kučera, J Obdržálek
Information and Computation 209 (8), 1160-1183, 2011
442011
A new perspective on FO model checking of dense graph classes
J Gajarský, P Hliněný, J Obdržálek, D Lokshtanov, MS Ramanujan
2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-9, 2016
372016
Digraph width measures in parameterized algorithmics
R Ganian, P Hliněný, J Kneis, A Langer, J Obdržálek, P Rossmanith
Discrete applied mathematics 168, 88-107, 2014
362014
Clique-width and parity games
J Obdržálek
International Workshop on Computer Science Logic, 54-68, 2007
352007
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
R Ganian, P Hliněný, J Obdržálek
Foundations of Software Technology and Theoretical Computer Science (FSTTCS …, 2010
322010
FO model checking on posets of bounded width
J Gajarský, P Hlinený, D Lokshtanov, J Obdralek, S Ordyniak, ...
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 963-974, 2015
312015
Lower Bounds on the Complexity of MSO_1 Model-Checking
R Ganian, P Hliněný, J Obdržálek, A Langer, P Rossmanith, S Sikdar
29th International Symposium on Theoretical Aspects of Computer Science …, 2012
292012
Shrub-depth: Capturing height of dense graphs
R Ganian, P Hliněný, J Nešetřil, J Obdržálek, PO De Mendez
arXiv preprint arXiv:1707.00359, 2017
272017
An OpenMP‐like interface for parallel programming in Java
ME Kambites, J Obdržálek, JM Bull
Concurrency and Computation: Practice and Experience 13 (8‐9), 793-814, 2001
262001
Are there any good digraph width measures?
R Ganian, P Hliněný, J Kneis, D Meister, J Obdržálek, P Rossmanith, ...
Journal of Combinatorial Theory, Series B 116, 250-286, 2016
252016
Algorithmic analysis of parity games
J Obdrzalek
PhD thesis, University of Edinburgh, 2006
252006
The system can't perform the operation now. Try again later.
Articles 1–20