| 0 | -- | 0 | Marco Bressan 0002. Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs |
| 0 | -- | 0 | Anders Aamand, Mikkel Abrahamsen, Peter M. R. Rasmussen, Thomas D. Ahle. Tiling with Squares and Packing Dominos in Polynomial Time |
| 0 | -- | 0 | Enoch Peserico, Michele Scquizzato. Matching on the Line Admits no \(o(\sqrt {\log n})\)-Competitive Algorithm |
| 0 | -- | 0 | Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman. Competitive Online Search Trees on Trees |
| 0 | -- | 0 | Stefan Walzer. Load Thresholds for Cuckoo Hashing with Overlapping Blocks |
| 0 | -- | 0 | Kevin Buchin, Chenglin Fan, Maarten Löffler, Aleksandr Popov 0001, Benjamin Raichel, Marcel Roeloffzen. Fréchet Distance for Uncertain Curves |
| 0 | -- | 0 | Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu, Roberto Grossi. On the Complexity of String Matching for Graphs |
| 0 | -- | 0 | Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc. Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs |
| 0 | -- | 0 | Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos. Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable |
| 0 | -- | 0 | Rajesh Jayaram, David P. Woodruff. Towards Optimal Moment Estimation in Streaming and Distributed Models |