| 0 | -- | 0 | Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira, Raphael Yuster. Counting Homomorphic Cycles in Degenerate Graphs |
| 0 | -- | 0 | Amir Abboud, Fabrizio Grandoni 0001, Virginia Vassilevska Williams. Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter |
| 0 | -- | 0 | Karl Bringmann, Vincent Cohen-Addad, Debarati Das 0001. 0.4-Approximation for Longest Common Subsequence |
| 0 | -- | 0 | Maike Buchin, Anne Driemel, Dennis Rohde. k,ℓ)-Median Clustering for Polygonal Curves |
| 0 | -- | 0 | Sariel Har-Peled, Manor Mendel, Dániel Oláh. Reliable Spanners for Metric Spaces |
| 0 | -- | 0 | Erez Kantor, Zvi Lotker, Merav Parter, David Peleg. The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication |
| 0 | -- | 0 | Rahul Shah, Cheng Sheng 0001, Sharma V. Thankachan, Jeffrey Vitter. Ranked Document Retrieval in External Memory |
| 0 | -- | 0 | Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi 0001, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki. Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams |
| 0 | -- | 0 | Nikhil Bansal 0001, Marek Eliás 0001, Grigorios Koumoutsos, Jesper Nederlof. k-Server in Uniform Metrics |
| 0 | -- | 0 | Franziska Eberle, Nicole Megow, Kevin Schewior. Online Throughput Maximization on Unrelated Machines: Commitment is No Burden |