| 619 | -- | 641 | Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic. A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs |
| 642 | -- | 660 | Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter. Exact Algorithms for Minimum Weighted Dominating Induced Matching |
| 661 | -- | 685 | Sarah R. Allen, Lisa Hellerstein, Devorah Kletenik, Tonguç Ünlüyurt. Evaluation of Monotone DNF Formulas |
| 686 | -- | 713 | Feodor F. Dragan, Ekkehard Köhler, Arne Leitert. Line-Distortion, Bandwidth and Path-Length of a Graph |
| 714 | -- | 755 | Craig Dillabaugh, Meng He 0001, Anil Maheshwari, Norbert Zeh. I/O-Efficient Path Traversal in Succinct Planar Graphs |
| 756 | -- | 785 | Dimitris Fotakis, Piotr Krysta, Carmine Ventre. Combinatorial Auctions Without Money |
| 786 | -- | 814 | Hélio B. Macêdo Filho, Raphael C. S. Machado, C. M. H. de Figueiredo. Efficient Algorithms for Clique-Colouring and Biclique-Colouring Unichord-Free Graphs |
| 815 | -- | 835 | Shun Sato. Combinatorial Relaxation Algorithm for the Entire Sequence of the Maximum Degree of Minors |
| 836 | -- | 866 | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot. The Price of Optimum: Complexity and Approximation for a Matching Game |
| 867 | -- | 901 | Sándor P. Fekete, Hella-Franziska Hoffmann. Online Square-into-Square Packing |
| 902 | -- | 920 | Michael A. Bekos, Thomas C. van Dijk, Martin Fink 0001, Philipp Kindermann, Stephen G. Kobourov, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff. Improved Approximation Algorithms for Box Contact Representations |
| 921 | -- | 941 | Lasse Kliemann. The Price of Anarchy in Bilateral Network Formation in an Adversary Model |
| 942 | -- | 969 | Lélia Blin, Janna Burman, Nicolas Nisse. Exclusive Graph Searching |