doc. Mgr. Jan Obdržálek, PhD.
docent – Katedra teorie programování
kancelář: C420
Botanická 554/68a
602 00 Brno
telefon: | 549 49 4225 |
---|---|
e‑mail: |
Počet publikací: 43
2012
-
Can dense graphs be "sparse"?
Rok: 2012, druh: Konferenční abstrakty
-
Lower Bounds on the Complexity of MSO_1 Model-Checking
29th International Symposium on Theoretical Aspects of Computer Science STACS2012, rok: 2012
-
STANSE: Bug-finding Framework for C Programs
LNCS Proceeding of Memics 2011, rok: 2012
-
The DAG-width of directed graphs
Journal of Combinatorial Theory, Ser B, rok: 2012, ročník: 102, vydání: 4, DOI
-
When Trees Grow Low: Shrubs and Fast MSO1
Math Foundations of Computer Science MFCS 2012, rok: 2012
2011
-
Clique-width: When Hard Does Not Mean Impossible
28th International Symposium on Theoretical Aspects of Computer Science STACS2011, rok: 2011
-
Efficient Loop Navigation for Symbolic Execution
Automated Technology for Verification and Analysis, 9th International Symposium, ATVA 2011, rok: 2011
-
Qualitative Reachability in Stochastic BPA Games
Information and Computation, rok: 2011, ročník: 209, vydání: 8
2010
-
Are there any good digraph width measures?
Parameterized and exact computation, IPEC 2010, rok: 2010
-
Better algorithms for satisfiability problems for formulas of bounded rank-width
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), rok: 2010