| 805 | -- | 834 | Jinhui Xu, Lei Xu 0006, Evanthia Papadopoulou. Computing the Map of Geometric Minimal Cuts |
| 835 | -- | 858 | Michael T. Goodrich. Spin-the-Bottle Sort and Annealing Sort: Oblivious Sorting via Round-Robin Random Comparisons |
| 859 | -- | 885 | Thomas Bläsius, Marcus Krug, Ignaz Rutter, Dorothea Wagner. Orthogonal Graph Drawing with Flexibility Constraints |
| 886 | -- | 915 | Steven Kelk, Celine Scornavacca. Constructing Minimal Phylogenetic Networks from Softwired Clusters is Fixed Parameter Tractable |
| 916 | -- | 939 | David G. Harris, Francis Sullivan, Isabel Beichl. Fast Sequential Importance Sampling to Estimate the Graph Reliability Polynomial |
| 940 | -- | 953 | Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh. On Cutwidth Parameterized by Vertex Cover |
| 954 | -- | 997 | Emilio Di Giacomo, Walter Didimo, Peter Eades, Giuseppe Liotta. 2-Layer Right Angle Crossing Drawings |
| 998 | -- | 1018 | Andreas Brandstädt, Raffaele Mosca. Dominating Induced Matchings for P 7-Free Graphs in Linear Time |
| 1019 | -- | 1044 | Sándor P. Fekete, Tom Kamphans, Nils Schweer. Online Square Packing with Gravity |
| 1045 | -- | 1074 | Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro. Improved Approximation Algorithms for the Average-Case Tree Searching Problem |
| 1075 | -- | 1097 | Luca Foschini, John Hershberger, Subhash Suri. On the Complexity of Time-Dependent Shortest Paths |