1. Editor’s Note

   Announcement 23 April 2014 Pages: 493 - 493

2. Polynomial Time Complexity of Edge Colouring Graphs with Bounded Colour Classes

   • Romeo Rizzi
   • David Cariolaro

   OriginalPaper 24 January 2013 Pages: 494 - 500

   

3. Detecting Fixed Patterns in Chordal Graphs in Polynomial Time

   • Rémy Belmonte
   • Petr A. Golovach
   • Daniël Paulusma

   OriginalPaper 25 January 2013 Pages: 501 - 521

   

4. Thresholds for Extreme Orientability

   • Po-Shen Loh
   • Rasmus Pagh

   OriginalPaper 31 January 2013 Pages: 522 - 539

   

5. An Intersection Model for Multitolerance Graphs: Efficient Algorithms and Hierarchy

   • George B. Mertzios

   OriginalPaper 07 February 2013 Pages: 540 - 581

   

6. On the Huffman and Alphabetic Tree Problem with General Cost Functions

   • Hiroshi Fujiwara
   • Tobias Jacobs

   OriginalPaper 08 February 2013 Pages: 582 - 604

   

7. An SDP Primal-Dual Algorithm for Approximating the Lovász-Theta Function

   • T.-H. Hubert Chan
   • Kevin L. Chang
   • Rajiv Raman

   OriginalPaper 13 February 2013 Pages: 605 - 618

8. Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms

   • Giorgos Christodoulou
   • Kurt Mehlhorn
   • Evangelia Pyrga

   OriginalPaper 15 February 2013 Pages: 619 - 640

   

9. Improved Algorithms for Partial Curve Matching

   • Anil Maheshwari
   • Jörg-Rüdiger Sack
   • Hamid Zarrabi-Zadeh

   OriginalPaper 20 February 2013 Pages: 641 - 657

   

10. Sparse Covers for Planar Graphs and Graphs that Exclude a Fixed Minor

    • Costas Busch
    • Ryan LaFortune
    • Srikanta Tirthapura

    OriginalPaper 20 February 2013 Pages: 658 - 684

    

11. Inclusion/Exclusion Meets Measure and Conquer

    • Jesper Nederlof
    • Johan M. M. van Rooij
    • Thomas C. van Dijk

    OriginalPaper 27 February 2013 Pages: 685 - 740

    

12. Better Size Estimation for Sparse Matrix Products

    • Rasmus Resen Amossen
    • Andrea Campagna
    • Rasmus Pagh

    OriginalPaper 01 March 2013 Pages: 741 - 757