269 | -- | 293 | Zhi-Zhong Chen, Wenji Ma, Lusheng Wang. The Parameterized Complexity of the Shared Center Problem |
294 | -- | 314 | David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Mihai Patrascu, Perouz Taslakian. Necklaces, Convolutions, and X+Y |
315 | -- | 334 | Adrian Dumitrescu, Minghui Jiang, János Pach. Opaque Sets |
335 | -- | 369 | Xavier Allamigeon. On the Complexity of Strongly Connected Components in Directed Hypergraphs |
370 | -- | 383 | Danny Z. Chen, Haitao Wang. New Algorithms for Facility Location Problems on the Real Line |
384 | -- | 396 | Philip Bille, Inge Li Gørtz. Substring Range Reporting |
397 | -- | 409 | Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Y. Flatland, Matthew J. Katz, Anil Maheshwari. Switching to Directional Antennas with Constant Increase in Radius and Hop Distance |
410 | -- | 430 | Danny Z. Chen, Haitao Wang. Outlier Respecting Points Approximation |
431 | -- | 442 | Keren Cohen, Raphael Yuster. On Minimum Witnesses for Boolean Matrix Multiplication |
443 | -- | 460 | M. Reza Khani, Mohammad R. Salavatipour. Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems |
461 | -- | 492 | Stasys Jukna. Limitations of Incremental Dynamic Programming |