| 2023 | Morphing Planar Graph Drawings Through 3D. | Kevin Buchin, William S. Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Lffler, Tim Ophelders, Alexander Wolff |
| 2023 | Solving Cut-Problems in Quadratic Time for Graphs with Bounded Treewidth. | Hauke Brinkop, Klaus Jansen |
| 2023 | On the 2-Layer Window Width Minimization Problem. | Michael A. Bekos, Henry Frster, Michael Kaufmann, Stephen G. Kobourov, Myroslav Kryven, Axel Kuckuk, Lena Schlipf |
| 2023 | Hardness of Bounding Influence via Graph Modification. | Robert D. Barish, Tetsuo Shibuya |
| 2023 | Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs. | Emmanuel Arrighi, Niels Grttemeier, Nils Morawietz, Frank Sommer, Petra Wolf |
| 2023 | Balanced Substructures in Bicolored Graphs. | P. S. Ardra, R. Krithika, Saket Saurabh, Roohani Sharma |
| 2023 | Quantum Complexity for Vector Domination Problem. | Andris Ambainis, Ansis Zvirbulis |
| 2023 | The k-Centre Problem for Classes of Cyclic Words. | Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov |
| 2021 | Towards Minimally Conscious Cyber-Physical Systems: A Manifesto. | Jir Wiedermann, Jan van Leeuwen |
| 2021 | The Complexity of Flow Expansion and Electrical Flow Expansion. | Dorothea Wagner, Matthias Wolf |
| 2021 | Adding Matrix Control: Insertion-Deletion Systems with Substitutions III. | Martin Vu, Henning Fernau |
| 2021 | Amnesiac Flooding: Synchronous Stateless Information Dissemination. | Volker Turau |
| 2021 | Concatenation Operations and Restricted Variants of Two-Dimensional Automata. | Taylor J. Smith, Kai Salomaa |
| 2021 | Asymptotic Approximation by Regular Languages. | Ryoma Sin'ya |
| 2021 | A Pipeline for Measuring Brand Loyalty Through Social Media Mining. | Hazem Peter Samoaa, Barbara Catania |
| 2021 | Web Test Automation: Insights from the Grey Literature. | Filippo Ricca, Andrea Stocco |
| 2021 | The Multiple Traveling Salesman Problem on Spiders. | Pedro Prez-Escalona, Ivan Rapaport, Jos A. Soto, Ian Vidal |
| 2021 | Invited Talk: Resilient Distributed Algorithms. | Merav Parter |
| 2021 | Parameterizing Role Coloring on Forests. | Sukanya Pandey, Venkatesh Raman, Vibha Sahlot |
| 2021 | S2CFT: A New Approach for Paper Submission Recommendation. | Dac H. Nguyen, Son Huynh, Phong Huynh, Dinh V. Cuong, Binh T. Nguyen |
| 2021 | Using Process Models to Understand Security Standards. | Fabiola Moyon, Daniel Mndez, Kristian Beckers, Sebastian Klepper |
| 2021 | Fair Division Is Hard Even for Amicable Agents. | Neeldhara Misra, Aditi Sethia |
| 2021 | On the Terminal Connection Problem. | Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uverton S. Souza |
| 2021 | Metadata Management on Data Processing in Data Lakes. | Imen Megdiche, Franck Ravat, Yan Zhao |
| 2021 | Improved Algorithms for Online Load Balancing. | Yaxiong Liu, Kohei Hatano, Eiji Takimoto |