| 2023 | A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems. | Kei Kimura, Kazuhisa Makino |
| 2023 | The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable. | Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov |
| 2023 | Improved Approximation Algorithm for Capacitated Facility Location with Uniform Facility Cost. | Mong-Jen Kao |
| 2023 | Succinct Planar Encoding with Minor Operations. | Frank Kammer, Johannes Meintrup |
| 2023 | Is the Algorithmic Kadison-Singer Problem Hard? | Ben Jourdan, Peter Macgregor, He Sun |
| 2023 | Single-Exponential FPT Algorithms for Enumerating Secluded ℱ-Free Subgraphs and Deleting to Scattered Graph Classes. | Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk |
| 2023 | Clustering What Matters in Constrained Settings: Improved Outlier to Outlier-Free Reductions. | Ragesh Jaiswal, Amit Kumar |
| 2023 | Structural Parameterizations of b-Coloring. | Lars Jaffke, Paloma T. Lima, Roohani Sharma |
| 2023 | Regularization of Low Error PCPs and an Application to MCSP. | Shuichi Hirahara, Dana Moshkovitz |
| 2023 | Temporal Separators with Deadlines. | Hovhannes A. Harutyunyan, Kamran Koupayi, Denis Pankratov |
| 2023 | Shortest Beer Path Queries Based on Graph Decomposition. | Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane, Kosuke Sugiyama |
| 2023 | Coloring and Recognizing Mixed Interval Graphs. | Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen, Pawel Rzazewski, Alexander Wolff, Johannes Zink |
| 2023 | Shortest Beer Path Queries in Digraphs with Bounded Treewidth. | Joachim Gudmundsson, Yuan Sha |
| 2023 | Computing a Subtrajectory Cluster from c-Packed Trajectories. | Joachim Gudmundsson, Zijin Huang, Andr van Renssen, Sampson Wong |
| 2023 | Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections. | Petr Gregor, Torsten Mtze, Namrata |
| 2023 | Computing Paths of Large Rank in Planar Frameworks Deterministically. | Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Giannos Stamoulis |
| 2023 | Matching Cuts in Graphs of High Girth and H-Free Graphs. | Carl Feghali, Felicia Lucke, Danil Paulusma, Bernard Ries |
| 2023 | Rapid Mixing for the Hardcore Glauber Dynamics and Other Markov Chains in Bounded-Treewidth Graphs. | David Eppstein, Daniel Frishberg |
| 2023 | Approximation Guarantees for Shortest Superstrings: Simpler and Better. | Matthias Englert, Nicolaos Matsakis, Pavel Vesel |
| 2023 | Group Fairness: From Multiwinner Voting to Participatory Budgeting (Invited Talk). | Edith Elkind |
| 2023 | A Unified Worst Case for Classical Simplex and Policy Iteration Pivot Rules. | Yann Disser, Nils Mosis |
| 2023 | Rectilinear-Upward Planarity Testing of Digraphs. | Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani |
| 2023 | Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets. | Anubhav Dhar, Soumita Hait, Sudeshna Kolay |
| 2023 | Prefix Sorting DFAs: A Recursive Algorithm. | Nicola Cotumaccio |
| 2023 | A Compact DAG for Storing and Searching Maximal Common Subsequences. | Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno |