| 2023 | A Faster Algorithm for Determining the Linear Feasibility of Systems of BTVPI Constraints. Piotr Wojciechowski, K. Subramani |
| 2023 | A Spectral Algorithm for Finding Maximum Cliques in Dense Random Intersection Graphs. Filippos Christodoulou, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis |
| 2023 | Balanced Substructures in Bicolored Graphs. P. S. Ardra, R. Krithika, Saket Saurabh, Roohani Sharma |
| 2023 | Delivery to Safety with Two Cooperating Robots. Jared Coleman, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce |
| 2023 | Dominance Drawings for DAGs with Bounded Modular Width. Giacomo Ortali, Ioannis G. Tollis |
| 2023 | Hardness of Bounding Influence via Graph Modification. Robert D. Barish, Tetsuo Shibuya |
| 2023 | Heuristics for Opinion Diffusion via Local Elections. Rica Gonen, Martin Koutecký, Roei Menashof, Nimrod Talmon |
| 2023 | Introduction to Routing Problems with Mandatory Transitions. Christian Laforest, Timothée Martinod |
| 2023 | Learning Through Imitation by Using Formal Verification. Avraham Raviv, Eliya Bronshtein, Or Reginiano, Michelle Aluf-Medina, Hillel Kugler |
| 2023 | Lower Bounds for Monotone q-Multilinear Boolean Circuits. Andrzej Lingas |
| 2023 | More Effort Towards Multiagent Knapsack. Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman |
| 2023 | Morphing Planar Graph Drawings Through 3D. Kevin Buchin, William S. Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, Alexander Wolff |
| 2023 | Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs. Emmanuel Arrighi, Niels Grüttemeier, Nils Morawietz, Frank Sommer, Petra Wolf |
| 2023 | On the 2-Layer Window Width Minimization Problem. Michael A. Bekos, Henry Förster, Michael Kaufmann, Stephen G. Kobourov, Myroslav Kryven, Axel Kuckuk, Lena Schlipf |
| 2023 | On the Complexity of Scheduling Problems with a Fixed Number of Parallel Identical Machines. Klaus Jansen, Kai Kahler |
| 2023 | On the Parameterized Complexity of s-club Cluster Deletion Problems. Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini |
| 2023 | On the Preservation of Properties When Changing Communication Models. Olav Bunte, Louis C. M. van Gool, Tim A. C. Willemse |
| 2023 | Parameterized Approaches to Orthogonal Compaction. Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi |
| 2023 | Payment Scheduling in the Interval Debt Model. Tom Friedetzky, David C. Kutner, George B. Mertzios, Iain A. Stewart, Amitabh Trehan |
| 2023 | Quantum Complexity for Vector Domination Problem. Andris Ambainis, Ansis Zvirbulis |
| 2023 | SOFSEM 2023: Theory and Practice of Computer Science - 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15-18, 2023, Proceedings Leszek Gasieniec |
| 2023 | Sequentially Swapping Tokens: Further on Graph Classes. Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi |
| 2023 | Solving Cut-Problems in Quadratic Time for Graphs with Bounded Treewidth. Hauke Brinkop, Klaus Jansen |
| 2023 | Space-Efficient STR-IC-LCS Computation. Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai |
| 2023 | The Complexity of Finding Tangles. Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff, Johannes Zink |
| 2023 | The k-Centre Problem for Classes of Cyclic Words. Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov |
| 2023 | Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees. Jonathan Klawitter, Felix Klesen, Moritz Niederer, Alexander Wolff |