Randomization in Constraint Programming for Airline Planning. - Lars Otten; Mattias Grönkvist; Devdatt P. Dubhashi (CP, 2006)

Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems. - Lars Otten; Rina Dechter (CP, 2008)

On the Practical Significance of Hypertree vs. TreeWidth. - Rina Dechter; Lars Otten; Radu Marinescu 002 (ECAI, 2008)

Bounding Search Space Size via (Hyper)tree Decompositions. - Lars Otten; Rina Dechter (UAI, 2008)

Toward parallel search for optimization in graphical models. - Lars Otten; Rina Dechter (ISAIM, 2010)

Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models. - Kalev Kask; Andrew Gelfand; Lars Otten; Rina Dechter (AAAI, 2011)

Finding Most Likely Haplotypes in General Pedigrees Through Parallel Search with Dynamic Load Balancing. - Lars Otten; Rina Dechter (Pacific Symposium on Biocomputing, 2011)

Advances in Distributed Branch and Bound. - Lars Otten; Rina Dechter (ECAI, 2012)

Join-graph based cost-shifting schemes. - Alexander Ihler; Natalia Flerova; Rina Dechter; Lars Otten (UAI, 2012)

A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models. - Lars Otten; Rina Dechter (UAI, 2012)

Anytime AND/OR depth-first search for combinatorial optimization. - Lars Otten; Rina Dechter (AI Commun., 2012)

Predicting the Size of Depth-First Branch and Bound Search Trees. - Levi H. S. Lelis; Lars Otten; Rina Dechter (IJCAI, 2013)

Vermittlung von Konzepten der Informationstechnik in Oberstufen der beruflichen Bildung technischer Fachrichtungen unter Verwendung mobiler Roboter als Lernträger. - Lars Otten (INFOS, 2013)

A system for exact and approximate genetic linkage analysis of SNP data in large pedigrees. - Mark Silberstein; Omer Weissbrod; Lars Otten; Anna Tzemach; Andrei Anisenia; Oren Shtark; Dvir Tuberg; Eddie Galfrin; Irena Gannon; Adel Shalata; Zvi U. Borochowitz; Rina Dechter; et al. (Bioinform., 2013)

Memory-Efficient Tree Size Prediction for Depth-First Search in Graphical Models. - Levi H. S. Lelis; Lars Otten; Rina Dechter (CP, 2014)

Anytime AND/OR Depth-First Search for Combinatorial Optimization - (Extended Abstract). - Lars Otten; Rina Dechter (CP, 2014)

Caching in Context-Minimal OR Spaces. - Rina Dechter; Levi H. S. Lelis; Lars Otten (SOCS, 2015)

AND/OR Branch-and-Bound on a Computational Grid. - Lars Otten; Rina Dechter (J. Artif. Intell. Res., 2017)