| |
| 2007 | ||
|---|---|---|
| 6 | Pavel Surynek, Roman Barták: Maintaining Arc-Consistency over Mutex Relations in Planning Graphs during Search. FLAIRS Conference 2007: 134-139 | |
| 5 | Pavel Surynek, Lukas Chrpa, Jirí Vyskocil: Solving Difficult Problems by Viewing them as Structured Dense Graphs. IICAI 2007: 84-103 | |
| 4 | EE | Pavel Surynek: Solving Difficult SAT Instances Using Greedy Clique Decomposition. SARA 2007: 359-374 |
| 2005 | ||
| 3 | EE | Pavel Surynek, Roman Barták: Encoding HTN Planning as a Dynamic CSP. CP 2005: 868 |
| 2 | Roman Barták, Pavel Surynek: An Improved Algorithm for Maintaining Arc Consistency in Dynamic Constraint Satisfaction Problems. FLAIRS Conference 2005: 161-166 | |
| 2004 | ||
| 1 | EE | Pavel Surynek, Roman Barták: A New Algorithm for Maintaining Arc Consistency After Constraint Retraction. CP 2004: 767-771 |
| 1 | Roman Barták | [1] [2] [3] [6] |
| 2 | Lukas Chrpa | [5] |
| 3 | Jirí Vyskocil | [5] |