| |
| * | 2008 | |
|---|---|---|
| 4 | EE | Lars Otten, Rina Dechter: Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems. CP 2008: 576-581 |
| 3 | EE | Rina Dechter, Lars Otten, Radu Marinescu: On the Practical Significance of Hypertree vs. TreeWidth. ECAI 2008: 913-914 |
| 2 | EE | Lars Otten, Rina Dechter: Bounding Search Space Size via (Hyper)tree Decompositions. UAI 2008: 452-459 |
| 2006 | ||
| 1 | EE | Lars Otten, Mattias Grönkvist, Devdatt P. Dubhashi: Randomization in Constraint Programming for Airline Planning. CP 2006: 406-420 |
| 1 | Rina Dechter | [2] [3] [4] |
| 2 | Devdatt P. Dubhashi | [1] |
| 3 | Mattias Grönkvist | [1] |
| 4 | Radu Marinescu | [3] |