| 697 | -- | 708 | Chih-Chiang Yu, Chien-Hsin Lin, Biing-Feng Wang. Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph |
| 709 | -- | 726 | Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Rothvoß, Guido Schäfer. Connected facility location via random facility sampling and core detouring |
| 727 | -- | 740 | Michael R. Fellows, Jiong Guo, Iyad A. Kanj. The parameterized complexity of some minimum label problems |
| 741 | -- | 750 | Saehwa Kim. Dual ceiling protocol for real-time synchronization under preemption threshold scheduling |
| 751 | -- | 758 | Dekel Tsur. Sequencing by hybridization in few rounds |
| 759 | -- | 777 | Ofer Dekel, Felix A. Fischer, Ariel D. Procaccia. Incentive compatible regression learning |
| 778 | -- | 791 | Tony Tan. On pebble automata for data languages with decidable emptiness problem |
| 792 | -- | 811 | Christian Glaßer. Space-efficient informational redundancy |
| 812 | -- | 836 | Nadja Betzler, Britta Dorn. Towards a dichotomy for the Possible Winner problem in elections based on scoring rules |
| 837 | -- | 846 | Tomás Masopust. Simple restriction in context-free rewriting |
| 861 | -- | 871 | Arto Salomaa. Subword balance, position indices and power sums |
| 872 | -- | 878 | Gregory Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo. Betweenness parameterized above tight lower bound |
| 879 | -- | 883 | David Gamarnik, Dmitriy Katz. A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix |
| 884 | -- | 900 | Shlomi Dolev, Ronen I. Kat, Elad Michael Schiller. When consensus meets self-stabilization |