Polynomial Time Complexity of Edge Colouring Graphs with Bounded Colour Classes Romeo RizziDavid Cariolaro OriginalPaper 24 January 2013 Pages: 494 - 500
Detecting Fixed Patterns in Chordal Graphs in Polynomial Time Rémy BelmontePetr A. GolovachDaniël Paulusma OriginalPaper 25 January 2013 Pages: 501 - 521
Thresholds for Extreme Orientability Po-Shen LohRasmus Pagh OriginalPaper 31 January 2013 Pages: 522 - 539
An Intersection Model for Multitolerance Graphs: Efficient Algorithms and Hierarchy George B. Mertzios OriginalPaper 07 February 2013 Pages: 540 - 581
On the Huffman and Alphabetic Tree Problem with General Cost Functions Hiroshi FujiwaraTobias Jacobs OriginalPaper 08 February 2013 Pages: 582 - 604
An SDP Primal-Dual Algorithm for Approximating the Lovász-Theta Function T.-H. Hubert ChanKevin L. ChangRajiv Raman OriginalPaper 13 February 2013 Pages: 605 - 618
Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms Giorgos ChristodoulouKurt MehlhornEvangelia Pyrga OriginalPaper 15 February 2013 Pages: 619 - 640
Improved Algorithms for Partial Curve Matching Anil MaheshwariJörg-Rüdiger SackHamid Zarrabi-Zadeh OriginalPaper 20 February 2013 Pages: 641 - 657
Sparse Covers for Planar Graphs and Graphs that Exclude a Fixed Minor Costas BuschRyan LaFortuneSrikanta Tirthapura OriginalPaper 20 February 2013 Pages: 658 - 684
Inclusion/Exclusion Meets Measure and Conquer Jesper NederlofJohan M. M. van RooijThomas C. van Dijk OriginalPaper 27 February 2013 Pages: 685 - 740
Better Size Estimation for Sparse Matrix Products Rasmus Resen AmossenAndrea CampagnaRasmus Pagh OriginalPaper 01 March 2013 Pages: 741 - 757
