1. Exact Algorithms for Edge Domination

   • Johan M. M. van Rooij
   • Hans L. Bodlaender

   OriginalPaper Open access 06 July 2011 Pages: 535 - 563

2. 1-Local 7/5-Competitive Algorithm for Multicoloring Hexagonal Graphs

   • Petra Šparl
   • Rafał Witkowski
   • Janez Žerovnik

   OriginalPaper Open access 07 September 2011 Pages: 564 - 583

3. Competitive Analysis of Organization Networks or Multicast Acknowledgment: How Much to Wait?

   • Carlos Fisch Brito
   • Elias Koutsoupias
   • Shailesh Vaya

   OriginalPaper 21 September 2011 Pages: 584 - 605

4. Negative Examples for Sequential Importance Sampling of Binary Contingency Tables

   • Ivona Bezáková
   • Alistair Sinclair
   • Eric Vigoda

   OriginalPaper 15 September 2011 Pages: 606 - 620

5. Theory of Randomized Search Heuristics

   • Anne Auger
   • Carsten Witt

   EditorialNotes 29 August 2012 Pages: 621 - 622

6. Black-Box Search by Unbiased Variation

   • Per Kristian Lehre
   • Carsten Witt

   OriginalPaper 09 February 2012 Pages: 623 - 642

   

7. A Simple Ant Colony Optimizer for Stochastic Shortest Path Problems

   • Dirk Sudholt
   • Christian Thyssen

   OriginalPaper 30 December 2011 Pages: 643 - 672

   

8. Multiplicative Drift Analysis

   • Benjamin Doerr
   • Daniel Johannsen
   • Carola Winzen

   OriginalPaper 29 February 2012 Pages: 673 - 697

   

9. Theoretical Foundation for CMA-ES from Information Geometry Perspective

   • Youhei Akimoto
   • Yuichi Nagata
   • Shigenobu Kobayashi

   OriginalPaper 09 September 2011 Pages: 698 - 716