| 2725 | -- | 2741 | Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama. A Moderately Exponential Time Algorithm for k-IBDD Satisfiability |
| 2742 | -- | 2756 | Zahed Rahmati, Timothy M. Chan. A Clustering-Based Approach to Kinetic Closest Pair |
| 2757 | -- | 2776 | Syed Mohammad Meesum, Saket Saurabh 0001. Rank Reduction of Oriented Graphs by Vertex and Edge Deletions |
| 2777 | -- | 2798 | Riley Murray, Samir Khuller, Megan Chao. Scheduling Distributed Clusters of Parallel Machines : Primal-Dual and LP-based Approximation Algorithms |
| 2799 | -- | 2817 | Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Viktor Zamaraev. Upper Domination: Towards a Dichotomy Through Boundary Properties |
| 2818 | -- | 2833 | Martijn van Ee, René Sitters. The A Priori Traveling Repairman Problem |
| 2834 | -- | 2848 | Emile Ziedan, Deepak Rajendraprasad, Rogers Mathew, Martin Charles Golumbic, Jérémie Dusart. The Induced Separation Dimension of a Graph |
| 2849 | -- | 2873 | Benjamin Grimmer. Dual-Based Approximation Algorithms for Cut-Based Network Connectivity Problems |
| 2874 | -- | 2908 | Uriel Feige, Yael Hitron. The Ordered Covering Problem |
| 2909 | -- | 2940 | Bernhard Bliem, Stefan Woltran. Complexity of Secure Sets |
| 2941 | -- | 2956 | Tim Nonner. Clique Clustering Yields a PTAS for Max-Coloring Interval Graphs |
| 2957 | -- | 2971 | Naoyuki Kamiyama. A Note on Submodular Function Minimization with Covering Type Linear Constraints |