| 637 | -- | 658 | Serge Gaspers, Dieter Kratsch, Mathieu Liedloff. On Independent Sets and Bicliques in Graphs |
| 659 | -- | 700 | Agustín Bompadre. Exponential Lower Bounds on the Complexity of a Class of Dynamic Programs for Combinatorial Optimization Problems |
| 701 | -- | 712 | Yuichi Yoshida, Hiro Ito. Property Testing on k-Vertex-Connectivity of Graphs |
| 713 | -- | 732 | Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès, Yang Xiang. Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs |
| 733 | -- | 753 | Patrick Briest, Martin Hoefer, Piotr Krysta. Stackelberg Network Pricing Games |
| 754 | -- | 766 | Amr Elmasry, Kurt Mehlhorn, Jens M. Schmidt. An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs |
| 767 | -- | 786 | Petra Berenbrink, Tom Friedetzky, Iman Hajirasouliha, Zengjian Hu. Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks |
| 787 | -- | 806 | Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi. Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems |
| 807 | -- | 822 | Dániel Marx, Ildikó Schlotter. Obtaining a Planar Graph by Vertex Deletion |
| 823 | -- | 841 | Takehiro Ito, Takao Nishizeki, Michael Schröder, Takeaki Uno, Xiao Zhou. Partitioning a Weighted Tree into Subtrees with Weights in a Given Range |
| 842 | -- | 862 | Alireza Zarei, Mohammad Ghodsi. Efficient Observer-Dependent Simplification in Polygonal Domains |
| 863 | -- | 878 | Michael L. Fredman. Generalizing a Theorem of Wilber on Rotations in Binary Search Trees to Encompass Unordered Binary Trees |
| 879 | -- | 905 | Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi. On Smoothed Analysis of Quicksort and Hoare's Find |
| 906 | -- | 929 | MohammadHossein Bateni, MohammadTaghi Hajiaghayi. Euclidean Prize-Collecting Steiner Forest |
| 930 | -- | 950 | René van Bevern, Hannes Moser, Rolf Niedermeier. Approximation and Tidying - A Problem Kernel for s-Plex Cluster Vertex Deletion |
| 951 | -- | 981 | Jing Xiao, Tiancheng Lou, Tao Jiang. An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number of Recombinants |
| 982 | -- | 1005 | Tobias Jacobs. On the Complexity of Optimal Hotlink Assignment |
| 1006 | -- | 1033 | Paola Flocchini, David Ilcinkas, Nicola Santoro. Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles |
| 1034 | -- | 1049 | Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Sebastian Stiller. A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling |
| 1050 | -- | 1072 | Imran A. Pirwani, Mohammad R. Salavatipour. A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs |
| 1073 | -- | 1087 | Liam Roditty. Fully Dynamic Geometric Spanners |
| 1088 | -- | 1111 | Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting. Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window |
| 1112 | -- | 1121 | Micah Adler, Brent Heeringa. Approximating Optimal Binary Decision Trees |
| 1122 | -- | 1158 | Seok-Hee Hong, Hiroshi Nagamochi. A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners |
| 1159 | -- | 1197 | Olivier Bernardi, Éric Fusy. Schnyder Decompositions for Regular Plane Graphs and Application to Drawing |
| 1198 | -- | 1221 | Greg N. Frederickson, Barry Wittman. Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems |