| 1 | -- | 25 | Susanne Albers, Achim Passen. New Online Algorithms for Story Scheduling in Web Advertising |
| 26 | -- | 46 | Neeldhara Misra, Fahad Panolan, Ashutosh Rai 0001, Venkatesh Raman 0001, Saket Saurabh 0001. Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs |
| 47 | -- | 68 | Amir Carmel, Dekel Tsur, Michal Ziv-Ukelson. On Almost Monge All Scores Matrices |
| 69 | -- | 97 | Therese C. Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi 0001, Fabrizio Montecchiani, Hamideh Vosoughpour, Ziting Yu. Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation |
| 98 | -- | 123 | Julien Lesca, Michel Minoux, Patrice Perny. The Fair OWA One-to-One Assignment Problem: NP-Hardness and Polynomial Time Special Cases |
| 124 | -- | 166 | Eleftherios Anastasiadis, Xiaotie Deng, Piotr Krysta, Minming Li, Han Qiao, Jinshan Zhang 0002. Network Pollution Games |
| 167 | -- | 178 | Tomonari Kitahara, Noriyoshi Sukegawa. A Simple Projection Algorithm for Linear Programming Problems |
| 179 | -- | 200 | Harry Buhrman, Leen Torenvliet, Falk Unger, Nikolai K. Vereshchagin. Sparse Selfreducible Sets and Nonuniform Lower Bounds |
| 201 | -- | 223 | Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa 0001. Parameterized Complexity of Asynchronous Border Minimization |
| 224 | -- | 237 | CĂ©dric Bentz. An FPT Algorithm for Planar Multicuts with Sources and Sinks on the Outer Face |
| 238 | -- | 288 | Yoann Dieudonné, Andrzej Pelc. Impact of Knowledge on Election Time in Anonymous Networks |
| 289 | -- | 316 | Joseph S. B. Mitchell, Valentin Polishchuk, Mikko Sysikaski, Haitao Wang 0001. An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains |
| 317 | -- | 342 | Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, Ralf Klasing, Tomasz Kociumaka, Dominik Pajak. Linear Search by a Pair of Distinct-Speed Robots |
| 343 | -- | 366 | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi 0001, Yoshio Okamoto. Minimum-Cost b-Edge Dominating Sets on Trees |
| 367 | -- | 392 | Marc Bury, Elena Grigorescu, Andrew McGregor 0001, Morteza Monemizadeh, Chris Schwiegelshohn, Sofya Vorotnikova, Samson Zhou. Structural Results on Matching Estimation with Applications to Streaming |
| 393 | -- | 417 | Danny Segev. Assortment Planning with Nested Preferences: Dynamic Programming with Distributions as States? |
| 418 | -- | 0 | Koyo Hayashi, Satoru Iwata 0001. Correction to: Counting Minimum Weight Arborescences |