| Efficient symbolic search for cost-optimal planning. | 5 | 0.43 | 2017 |
| Focusing on What Really Matters: Irrelevance Pruning in Merge-and-Shrink | 4 | 0.41 | 2015 |
| Bdds Strike Back (In Ai Planning) | 5 | 0.40 | 2015 |
| "Distance"? Who Cares? Tailoring Merge-and-Shrink Heuristics to Detect Unsolvability. | 17 | 0.62 | 2014 |
| Symbolic and Explicit Search Hybrid through Perfect Hash Functions - A Case Study in Connect Four. | 0 | 0.34 | 2014 |
| BDD Ordering Heuristics for Classical Planning. | 5 | 0.40 | 2014 |
| What's in It for My BDD? On Causal Graphs and Variable Orders in Planning. | 4 | 0.41 | 2013 |
| Translating Single-Player GDL into PDDL. | 0 | 0.34 | 2013 |
| Transition Trees for Cost-Optimal Symbolic Planning. | 6 | 0.44 | 2013 |
| Symbolic A* Search with Pattern Databases and the Merge-and-Shrink Abstraction. | 4 | 0.41 | 2012 |
| Lex-Partitioning: A New Option For Bdd Search | 2 | 0.38 | 2012 |
| Searching with partial belief states in general games with incomplete information | 10 | 0.66 | 2012 |
| Gamer, a General Game Playing Agent | 12 | 0.54 | 2011 |
| On the Complexity of BDDs for State Space Search: A Case Study in Connect Four. | 6 | 0.42 | 2011 |
| Improving Cost-Optimal Domain-Independent Symbolic Planning. | 11 | 0.55 | 2011 |
| Exploiting the Computational Power of the Graphics Card: Optimal State Space Planning on the GPU. | 5 | 0.45 | 2011 |
| Finding the Needle in the Haystack with Heuristically Guided Swarm Tree Search. | 4 | 0.59 | 2010 |
| Layer-Abstraction for Symbolically Solving General Two-Player Games. | 4 | 0.51 | 2010 |
| Instantiating general games using prolog or dependency graphs | 8 | 0.77 | 2010 |
| Optimal symbolic planning with action costs and preferences | 18 | 0.65 | 2009 |
| Solving fully-observable non-deterministic planning problems via translation into a general game | 11 | 0.71 | 2009 |
| Partial Symbolic Pattern Databases for Optimal Sequential Planning | 8 | 0.50 | 2008 |
| Scaling Search with Pattern Databases | 4 | 0.41 | 2008 |
| Symbolic Classification of General Two-Player Games | 12 | 0.72 | 2008 |
| Symbolic Classification of General Multi-Player Games | 5 | 0.53 | 2008 |
| Solving µ-Calculus Parity Games by Symbolic Planning | 0 | 0.34 | 2008 |
| Limits and possibilities of BDDs in state space search | 7 | 0.54 | 2008 |
| Externalizing the Multiple Sequence Alignment Problem with Affine Gap Costs | 4 | 0.47 | 2007 |
