| 559 | -- | 573 | Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger. The Focus of Attention Problem |
| 574 | -- | 588 | Mourad El Ouali, Peter Munstermann, Anand Srivastav. Randomized Approximation for the Set Multicover Problem in Hypergraphs |
| 589 | -- | 601 | Yossi Azar, Niv Buchbinder, Kamal Jain. How to Allocate Goods in an Online Market? |
| 602 | -- | 629 | Manfred Cochefert, Jean-François Couturier 0001, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma. Parameterized Algorithms for Finding Square Roots |
| 630 | -- | 642 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk. On Group Feedback Vertex Set Parameterized by the Size of the Cutset |
| 643 | -- | 663 | Sergio Cabello, Panos Giannopoulos. The Complexity of Separating Points in the Plane |
| 664 | -- | 712 | Charalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos. Authenticated Hash Tables Based on Cryptographic Accumulators |
| 713 | -- | 741 | Mingyu Xiao, Hiroshi Nagamochi. An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure |
| 742 | -- | 777 | Diego Arroyuelo, Pooya Davoodi, Srinivasa Rao Satti. Succinct Dynamic Cardinal Trees |
| 778 | -- | 786 | Tomoya Hibi, Toshihiro Fujito. Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications |
| 787 | -- | 811 | Andrew McGregor, A. Pavan, Srikanta Tirthapura, David P. Woodruff. Space-Efficient Estimation of Statistics Over Sub-Sampled Streams |
| 812 | -- | 850 | Erik D. Demaine, Matthew J. Patitz, Trent A. Rogers, Robert T. Schweller, Scott M. Summers, Damien Woods. The Two-Handed Tile Assembly Model is not Intrinsically Universal |
| 851 | -- | 907 | Hari Krovi, Frédéric Magniez, Maris Ozols, Jérémie Roland. Quantum Walks Can Find a Marked Element on Any Graph |
| 908 | -- | 946 | Yoann Dieudonné, Andrzej Pelc. Anonymous Meeting in Networks |
| 947 | -- | 967 | Andreas Björklund, Petteri Kaski, Lukasz Kowalik. Constrained Multilinear Detection and Generalized Graph Motifs |