| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Clique-width: When Hard Does Not Mean Impossible | Ganian, Robert et al. | 2011 |
| 2 | Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width | Ganian, Robert et al. | 2010 |
| 3 | Qualitative Reachability in Stochastic BPA Games | Brazdil, Tomas et al. | 2009 |
| Number of result pages: | 1 |
| Number of documents: | 3 |
