1

Backdoors to Satisfaction
The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday (Hans L. Bodlaender and Rod Downey and Fedor V. Fomin and D'aniel Marx), volume 7370 of Lecture Notes in Computer Science, pages 287-317, 2012, Springer Verlag.
bib DOI
Computing Resolution-Path Dependencies in Linear Time
Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings (Alessandro Cimatti and Roberto Sebastiani), volume 7317 of Lecture Notes in Computer Science, pages 58-71, 2012, Springer Verlag.
bib DOI
Don't Be Strict in Local Search!
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada (Jörg Hoffmann and Bart Selman), 2012, AAAI Press.
bib
Hybrid Heuristics for Multimodal Homecare Scheduling
9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'12) (Nicolas Beldiceanu and Narendra Jussien and 'Eric Pinson), pages 339-355, 2012, Springer.
PDF bib
Improved Packing and Routing of Vehicles with Compartments
Computer Aided Systems Theory – EUROCAST 2011: 13th International Conference, Las Palmas de Gran Canaria, Spain, February 6–11, 2011, Revised Selected Papers, Part I (R. Moreno-D'iaz and others), volume 6927 of LNCS, pages 392-399, 2012, Springer.
PDF bib
k-Gap Interval Graphs
LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings (David Fern'andez-Baca), volume 7256 of Lecture Notes in Computer Science, pages 350-361, 2012, Springer Verlag.
bib DOI
Lower Bounds on the Complexity of MSO1 Model-Checking
29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, volume 14 of LIPIcs, pages 326-337, 2012, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
bib
LP can be a cure for Parameterized Problems
29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pages 338-349, 2012.
PDF bib DOI
On Finding Optimal Polytrees
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada (Jörg Hoffmann and Bart Selman), 2012, AAAI Press.
bib
On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem
Proceedings of the 2nd International Symposium on Combinatorial Optimization (Mahjoub, A.R. and others), volume 7422 of LNCS, pages 225-236, 2012, Springer.
PDF bib