| 2023 | From Algorithms to Connectivity and Back: Finding a Giant Component in Random | Zongchen Chen, Nitya Mani |
| 2023 | Curve Simplification and Clustering under Frchet Distance. | Siu-Wing Cheng, Haoqiang Huang |
| 2023 | Differentially Private All-Pairs Shortest Path Distances: Improved Algorithms and Lower Bounds. | Justin Y. Chen, Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Shyam Narayanan, Jelani Nelson, Yinzhan Xu |
| 2023 | Timeliness Through Telephones: Approximating Information Freshness in Vector Clock Models. | Da Qi Chen, Lin An, Aidin Niaparast, R. Ravi, Oleksandr Rudenko |
| 2023 | Faster Deterministic Worst-Case Fully Dynamic All-Pairs Shortest Paths via Decremental Hop-Restricted Shortest Paths. | Shiri Chechik, Tianyi Zhang |
| 2023 | Faster Algorithm for Turn-based Stochastic Games with Bounded Treewidth. | Krishnendu Chatterjee, Tobias Meggendorfer, Raimundo Saona, Jakub Svoboda |
| 2023 | Short Synchronizing Words for Random Automata. | Guillaume Chapuy, Guillem Perarnau |
| 2023 | Simplex Range Searching Revisited: How to Shave Logs in Multi-Level Data Structures. | Timothy M. Chan, Da Wei Zheng |
| 2023 | On the Number of Incidences When Avoiding an Induced Biclique in Geometric Settings. | Timothy M. Chan, Sariel Har-Peled |
| 2023 | Finding Triangles and Other Small Subgraphs in Geometric Intersection Graphs. | Timothy M. Chan |
| 2023 | Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition. | Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Nidia Obscura Acosta, Akash Pareek, Sorrachai Yingchareonthawornchai |
| 2023 | Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows. | Ruoxu Cen, William He, Jason Li, Debmalya Panigrahi |
| 2023 | Zigzagging through acyclic orientations of chordal graphs and hypergraphs. | Jean Cardinal, Hung Phuc Hoang, Arturo Merino, Torsten Mtze |
| 2023 | Parallel Exact Shortest Paths in Almost Linear Work and Square Root Depth. | Nairen Cao, Jeremy T. Fineman |
| 2023 | Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility). | Niv Buchbinder, Joseph (Seffi) Naor, David Wajc |
| 2023 | Traversing the FFT Computation Tree for Dimension-Independent Sparse Fourier Transforms. | Karl Bringmann, Michael Kapralov, Mikhail Makarov, Vasileios Nakos, Amir Yagudin, Amir Zandieh |
| 2023 | Integrality Gaps for Random Integer Programs via Discrepancy. | Sander Borst, Daniel Dadush, Dan Mikulincer |
| 2023 | Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. | Marthe Bonamy, Edouard Bonnet, Hugues Dprs, Louis Esperet, Colin Geniet, Claire Hilaire, Stphan Thomass, Alexandra Wesolek |
| 2023 | Small Shadows of Lattice Polytopes. | Alexander E. Black |
| 2023 | Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time. | Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, David Wajc |
| 2023 | Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates. | Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak |
| 2023 | Algorithmizing the Multiplicity Schwartz-Zippel Lemma. | Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar |
| 2023 | Kernelization for Graph Packing Problems via Rainbow Matching. | Stphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht |
| 2023 | Closing the Gap Between Directed Hopsets and Shortcut Sets. | Aaron Bernstein, Nicole Wein |
| 2023 | A logic-based algorithmic meta-theorem for mim-width. | Benjamin Bergougnoux, Jan Dreier, Lars Jaffke |