| 3415 | -- | 3457 | Fu-Hong Liu, Hsiang Hsuan Liu, Prudence W. H. Wong. Non-preemptive Scheduling in a Smart Grid Model and Its Implications on Machine Minimization |
| 3458 | -- | 3491 | Merav Parter, David Peleg. Fault Tolerant Approximate BFS Structures with Additive Stretch |
| 3492 | -- | 3520 | Gregor Matl, Stanislav Zivný. Using a Min-Cut Generalisation to Go Beyond Boolean Surjective VCSPs |
| 3521 | -- | 3565 | George B. Mertzios, André Nichterlein, Rolf Niedermeier. The Power of Linear-Time Data Reduction for Maximum Matching |
| 3566 | -- | 3587 | Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi 0001, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden. Subgraph Isomorphism on Graph Classes that Exclude a Substructure |
| 3588 | -- | 3603 | Sarah Blind, Kolja Knauer, Petru Valicov. Enumerating k-Arc-Connected Orientations |
| 3604 | -- | 3629 | Saba Ahmadi, Samir Khuller, Manish Purohit, Sheng Yang. On Scheduling Coflows |
| 3630 | -- | 3675 | Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner. An Adversarial Model for Scheduling with Testing |
| 3676 | -- | 3706 | Dogan Corus, Pietro S. Oliveto. On the Benefits of Populations for the Exploitation Speed of Standard Steady-State Genetic Algorithms |
| 3707 | -- | 3743 | Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski. Dynamic and Internal Longest Common Substring |