| 493 | -- | 0 | . Editor's Note |
| 494 | -- | 500 | Romeo Rizzi, David Cariolaro. Polynomial Time Complexity of Edge Colouring Graphs with Bounded Colour Classes |
| 501 | -- | 521 | Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma. Detecting Fixed Patterns in Chordal Graphs in Polynomial Time |
| 522 | -- | 539 | Po-Shen Loh, Rasmus Pagh. Thresholds for Extreme Orientability |
| 540 | -- | 581 | George B. Mertzios. An Intersection Model for Multitolerance Graphs: Efficient Algorithms and Hierarchy |
| 582 | -- | 604 | Hiroshi Fujiwara, Tobias Jacobs. On the Huffman and Alphabetic Tree Problem with General Cost Functions |
| 605 | -- | 618 | T.-H. Hubert Chan, Kevin L. Chang, Rajiv Raman. An SDP Primal-Dual Algorithm for Approximating the Lovász-Theta Function |
| 619 | -- | 640 | Giorgos Christodoulou, Kurt Mehlhorn, Evangelia Pyrga. Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms |
| 641 | -- | 657 | Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh. Improved Algorithms for Partial Curve Matching |
| 658 | -- | 684 | Costas Busch, Ryan LaFortune, Srikanta Tirthapura. Sparse Covers for Planar Graphs and Graphs that Exclude a Fixed Minor |
| 685 | -- | 740 | Jesper Nederlof, Johan M. M. van Rooij, Thomas C. van Dijk. Inclusion/Exclusion Meets Measure and Conquer |
| 741 | -- | 757 | Rasmus Resen Amossen, Andrea Campagna, Rasmus Pagh. Better Size Estimation for Sparse Matrix Products |