| 2023 | On the Complexity Dichotomy for the Satisfiability of Systems of Term Equations over Finite Algebras. | Peter Mayr |
| 2023 | A Weyl Criterion for Finite-State Dimension and Applications. | Jack H. Lutz, Satyadev Nandakumar, Subin Pulari |
| 2023 | Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius. | Felicia Lucke, Danil Paulusma, Bernard Ries |
| 2023 | Parameterized Max Min Feedback Vertex Set. | Michael Lampis, Nikolaos Melissinos, Manolis Vasilakis |
| 2023 | Parameterized Complexity of Domination Problems Using Restricted Modular Partitions. | Manuel Lafond, Weidong Luo |
| 2023 | Algebraic Reasoning for (Un)Solvable Loops (Invited Talk). | Laura Kovcs |
| 2023 | Set Semantics for Asynchronous TeamLTL: Expressivity and Complexity. | Juha Kontinen, Max Sandstrm, Jonni Virtema |
| 2023 | Formalizing Hyperspaces for Extracting Efficient Exact Real Computation. | Michal Konecn, Sewon Park, Holger Thies |
| 2023 | Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids. | Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa |
| 2023 | Sliding into the Future: Investigating Sliding Windows in Temporal Graphs (Invited Talk). | Nina Klobas, George B. Mertzios, Paul G. Spirakis |
| 2023 | Parameterized Approximation Scheme for Feedback Vertex Set. | Satyabrata Jana, Daniel Lokshtanov, Soumen Mandal, Ashutosh Rai, Saket Saurabh |
| 2023 | On the Complexity of Computing Time Series Medians Under the Move-Split-Merge Metric. | Jana Holznigenkemper, Christian Komusiewicz, Nils Morawietz, Bernhard Seeger |
| 2023 | The Covering Canadian Traveller Problem Revisited. | Niklas Hahn, Michalis Xefteris |
| 2023 | On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract). | Christoph Haase, Alessio Mansutti, Amaury Pouly |
| 2023 | Depth-3 Circuits for Inner Product. | Mika Gs, Ziyi Guan, Tiberiu Mosnoi |
| 2023 | An FPT Algorithm for Spanning Trees with Few Branch Vertices Parameterized by Modular-Width. | Luisa Gargano, Adele A. Rescigno |
| 2023 | Distributed Merlin-Arthur Synthesis of Quantum States and Its Applications. | Franois Le Gall, Masayuki Miyamoto, Harumichi Nishimura |
| 2023 | Parameterized Analysis of the Cops and Robber Game. | Harmender Gahlawat, Meirav Zehavi |
| 2023 | Positive Data Languages. | Florian Frank, Stefan Milius, Henning Urbat |
| 2023 | FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges. | Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana |
| 2023 | Finding a Highly Connected Steiner Subgraph and its Applications. | Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan |
| 2023 | Upward Translation of Optimal and P-Optimal Proof Systems in the Boolean Hierarchy over NP. | Fabian Egidy, Christian Glaer, Martin G. Herold |
| 2023 | Exact and Approximation Algorithms for Routing a Convoy Through a Graph. | Martijn van Ee, Tim Oosterwijk, Ren Sitters, Andreas Wiese |
| 2023 | String Diagrammatic Trace Theory. | Matthew Earnshaw, Pawel Sobocinski |
| 2023 | Recontamination Helps a Lot to Hunt a Rabbit. | Thomas Dissaux, Foivos Fioravantes, Harmender Gahlawat, Nicolas Nisse |