Planning with SAT, Admissible Heuristics and A*	Jussi Rintanen
Computing Perfect Heuristics in Polynomial Time: On Bisimulation and Merge-and-Shrink Abstractions in Optimal Planning	Joerg Hoffmann, Raz Nissim and Malte Helmert
Large Neighborhood Search and Adaptive Randomized Decompositions for Flexible Jobshop Scheduling	Dario Pacino and Pascal Van Hentenryck

Video also available for download here. We recommend VLC for playing