|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 18 publication records. Showing 18 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Jan Obdrzálek, Jiri Slaby, Marek Trtík |
STANSE: Bug-finding Framework for C Programs  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar |
Lower Bounds on the Complexity of MSO_1 Model-Checking. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek |
Qualitative reachability in stochastic BPA games. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar |
Lower Bounds on the Complexity of MSO1 Model-Checking |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Jan Obdrzálek, Marek Trtík |
Efficient Loop Navigation for Symbolic Execution |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Jan Obdrzálek |
Clique-width: When Hard Does Not Mean Impossible. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Obdrzálek, Marek Trtík |
Efficient Loop Navigation for Symbolic Execution. |
ATVA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Obdrzálek, Jiri Slaby, Marek Trtík |
STANSE: Bug-Finding Framework for C Programs. |
MEMICS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek |
Qualitative Reachability in Stochastic BPA Games |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Jan Obdrzálek |
Better algorithms for satisfiability problems for formulas of bounded rank-width |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar |
Are there any good digraph width measures? |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar |
Are There Any Good Digraph Width Measures? |
IPEC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Jan Obdrzálek |
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith |
On Digraph Width Measures in Parameterized Algorithmics. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek |
Qualitative Reachability in Stochastic BPA Games. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Obdrzálek |
Clique-Width and Parity Games. |
CSL |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Obdrzálek |
DAG-width: connectivity measure for directed graphs. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Obdrzálek |
Fast Mu-Calculus Model Checking when Tree-Width Is Bounded. |
CAV |
2003 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #18 of 18 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")