| 2015 | SoCS | Caching in Context-Minimal OR Spaces. | Rina Dechter, Levi H. S. Lelis, Lars Otten |
| 2014 | CP | Memory-Efficient Tree Size Prediction for Depth-First Search in Graphical Models. | Levi H. S. Lelis, Lars Otten, Rina Dechter |
| 2014 | CP | Anytime AND/OR Depth-First Search for Combinatorial Optimization - (Extended Abstract). | Lars Otten, Rina Dechter |
| 2013 | IJCAI | Predicting the Size of Depth-First Branch and Bound Search Trees. | Levi H. S. Lelis, Lars Otten, Rina Dechter |
| 2012 | ECAI | Advances in Distributed Branch and Bound. | Lars Otten, Rina Dechter |
| 2012 | UAI | Join-graph based cost-shifting schemes. | Alexander Ihler, Natalia Flerova, Rina Dechter, Lars Otten |
| 2012 | UAI | A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models. | Lars Otten, Rina Dechter |
| 2011 | AAAI | Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models. | Kalev Kask, Andrew Gelfand, Lars Otten, Rina Dechter |
| 2011 | PSB | Finding Most Likely Haplotypes in General Pedigrees Through Parallel Search with Dynamic Load Balancing. | Lars Otten, Rina Dechter |
| 2011 | SoCS | Anytime AND/OR Depth-First Search for Combinatorial Optimization. | Lars Otten, Rina Dechter |
| 2010 | ISAIM | Toward parallel search for optimization in graphical models. | Lars Otten, Rina Dechter |
| 2008 | CP | Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems. | Lars Otten, Rina Dechter |
| 2008 | ECAI | On the Practical Significance of Hypertree vs. TreeWidth. | Rina Dechter, Lars Otten, Radu Marinescu |
| 2008 | UAI | Bounding Search Space Size via (Hyper)tree Decompositions. | Lars Otten, Rina Dechter |
| 2006 | CP | Randomization in Constraint Programming for Airline Planning. | Lars Otten, Mattias Grnkvist, Devdatt P. Dubhashi |