| 2023 | Parameterized Complexity of Equality MinCSP. | George Osipov, Magnus Wahlstrm |
| 2023 | Approximation Schemes for Min-Sum k-Clustering. | Ismail Naderi, Mohsen Rezapour, Mohammad R. Salavatipour |
| 2023 | Matching Statistics Speed up BWT Construction. | Francesco Masillo |
| 2023 | A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on Integer Points Parameterized by Treewidth and Cutwidth. | Isja Mannens, Jesper Nederlof |
| 2023 | Tight Bounds for Quantum Phase Estimation and Related Problems. | Nikhil S. Mande, Ronald de Wolf |
| 2023 | On the Perturbation Function of Ranking and Balance for Weighted Online Bipartite Matching. | Jingxun Liang, Zhihao Gavin Tang, Yixuan Even Xu, Yuhao Zhang, Renfei Zhou |
| 2023 | Connectivity in the Presence of an Opponent. | Zihui Liang, Bakh Khoussainov, Toru Takisaka, Mingyu Xiao |
| 2023 | Massively Parallel Algorithms for the Stochastic Block Model. | Zelin Li, Pan Peng, Xianbin Zhu |
| 2023 | Structural Parameterizations for Two Bounded Degree Problems Revisited. | Michael Lampis, Manolis Vasilakis |
| 2023 | Improved Approximations for Translational Packing of Convex Polygons. | Adam Kurpisz, Silvan Suter |
| 2023 | Connectivity Queries Under Vertex Failures: Not Optimal, but Practical. | Evangelos Kosinas |
| 2023 | Faster Block Tree Construction. | Dominik Kppl, Florian Kurpicz, Daniel Meyer |
| 2023 | Towards Bypassing Lower Bounds for Graph Shortcuts. | Shimon Kogan, Merav Parter |
| 2023 | Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths. | Tomasz Kociumaka, Adam Polak |
| 2023 | Coloring Tournaments with Few Colors: Algorithms and Complexity. | Felix Klingelhfer, Alantha Newman |
| 2023 | Fitting Tree Metrics with Minimum Disagreements. | Evangelos Kipouridis |
| 2023 | An Improved Approximation Algorithm for the Max-3-Section Problem. | Dor Katzelnick, Aditya Pillai, Roy Schwartz, Mohit Singh |
| 2023 | On Fully Dynamic Strongly Connected Components. | Adam Karczmarz, Marcin Smulewicz |
| 2023 | The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs. | Haim Kaplan, Matthew J. Katz, Rachel Saban, Micha Sharir |
| 2023 | 5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size. | Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk |
| 2023 | Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is Large. | Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi |
| 2023 | Improved Quantum Boosting. | Adam Izdebski, Ronald de Wolf |
| 2023 | Solving Edge Clique Cover Exactly via Synergistic Data Reduction. | Anthony Hevia, Benjamin Kallus, Summer McClintic, Samantha Reisner, Darren Strash, Johnathan Wilson |
| 2023 | Pareto Sums of Pareto Sets. | Demian Hespe, Peter Sanders, Sabine Storandt, Carina Truschel |
| 2023 | Tight Algorithms for Connectivity Problems Parameterized by Clique-Width. | Falko Hegerfeld, Stefan Kratsch |