| 2023 | Algorithms and Complexity - 13th International Conference, CIAC 2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings Marios Mavronicolas |
| 2023 | Approximating Power Node-Deletion Problems. Toshihiro Fujito, Kneto Mukae, Junya Tsuzuki |
| 2023 | Asynchronous Fully-Decentralized SGD in the Cluster-Based Model. Hagit Attiya, Noa Schiller |
| 2023 | Broadcasting in Split Graphs. Hovhannes A. Harutyunyan, Narek A. Hovhannisyan |
| 2023 | Communication-Efficient Distributed Graph Clustering and Sparsification Under Duplication Models. Chun Jiang Zhu |
| 2023 | Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision. Pascal Koiran, Subhayan Saha |
| 2023 | Dynamic Coloring on Restricted Graph Classes. Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy |
| 2023 | Dynamic Flows with Time-Dependent Capacities. Thomas Bläsius, Adrian Feilhauer, Jannik Westenfelder |
| 2023 | Efficiently Enumerating All Spanning Trees of a Plane 3-Tree - (Extended Abstract). Muhammad Nur Yanhaona, Asswad Sarker Nomaan, Md. Saidur Rahman |
| 2023 | Enumeration of Minimal Tropical Connected Sets. Ivan Bliznets, Danil Sagunov, Eugene Tagin |
| 2023 | Fast Cauchy Sum Algorithms for Polynomial Zeros and Matrix Eigenvalues. Victor Y. Pan, Soo Go, Qi Luan, Liang Zhao |
| 2023 | Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond. Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda |
| 2023 | How Vulnerable is an Undirected Planar Graph with Respect to Max Flow. Lorenzo Balzotti, Paolo Giulio Franciosa |
| 2023 | Improved Deterministic Leader Election in Diameter-Two Networks. Manish Kumar, Anisur Rahaman Molla, Sumathi Sivasubramaniam |
| 2023 | Independent Set Under a Change Constraint from an Initial Solution. Yuichi Asahiro, Hiroshi Eto, Kana Korenaga, Guohui Lin, Eiji Miyano, Reo Nonoue |
| 2023 | Maintaining Triconnected Components Under Node Expansion. Simon D. Fink, Ignaz Rutter |
| 2023 | Maximum Flows in Parametric Graph Templates. Tal Ben-Nun, Lukas Gianinazzi, Torsten Hoefler, Yishai Oltchik |
| 2023 | Minimum-Link C-Oriented Paths Visiting a Sequence of Regions in the Plane. Kerem Geva, Matthew J. Katz, Joseph S. B. Mitchell, Eli Packer |
| 2023 | Non-crossing Shortest Paths Lengths in Planar Graphs in Linear Time. Lorenzo Balzotti, Paolo Giulio Franciosa |
| 2023 | On One-Sided Testing Affine Subspaces. Nader H. Bshouty |
| 2023 | On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves. Emmanuel Sam, Michael R. Fellows, Frances A. Rosamond, Petr A. Golovach |
| 2023 | Parameterizing Path Partitions. Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya, Rajath Rao K. N |
| 2023 | Partitioning Subclasses of Chordal Graphs with Few Deletions. Satyabrata Jana, Souvik Saha, Abhishek Sahu, Saket Saurabh, Shaily Verma |
| 2023 | Phase Transition in Count Approximation by Count-Min Sketch with Conservative Updates. Éric Fusy, Gregory Kucherov |
| 2023 | Selected Combinatorial Problems Through the Prism of Random Intersection Graphs Models. Paul G. Spirakis, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos |
| 2023 | Stable Scheduling in Transactional Memory. Costas Busch, Bogdan S. Chlebus, Dariusz R. Kowalski, Pavan Poudel |
| 2023 | The Complexity of Secure RAMs. Giuseppe Persiano |
| 2023 | The Power of the Binary Value Principle. Yaroslav Alekseev, Edward A. Hirsch |
| 2023 | Unifying Gathering Protocols for Swarms of Mobile Robots. Jannik Castenow, Jonas Harbig, Friedhelm Meyer auf der Heide |