| 2025 | Finding d-Cuts in Claw-Free Graphs. | Jungho Ahn, Tala Eagling-Vose, Felicia Lucke, Danil Paulusma, Siani Smith |
| 2025 | Circle-Segment Intersection Queries in Connected Geometric Graphs. | Peyman Afshani, Yannick Bosch, Sabine Storandt |
| 2025 | A Parameterized Study of Secluded Structures in Directed Graphs. | Jonas Schmidt, Shaily Verma, Nadym Mallek |
| 2025 | Precoloring Extension with Demands on Paths. | Arun Kumar Das, Michal Opler, Toms Valla |
| 2025 | Hardness and Fixed Parameter Tractability for Pinwheel Scheduling Problems. | Yusuke Kobayashi, Bingkai Lin |
| 2024 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2024 | Optimal Offline ORAM with Perfect Security via Simple Oblivious Priority Queues. | Thore Thieen, Jan Vahrenhold |
| 2024 | Role of Structured Matrices in Fine-Grained Algorithm Design (Invited Talk). | Barna Saha |
| 2024 | A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs. | Daniel Paul-Pena, C. Seshadhri |
| 2024 | A Fast Algorithm for Computing a Planar Support for Non-Piercing Rectangles. | Ambar Pal, Rajiv Raman, Saurabh Ray, Karamjeet Singh |
| 2024 | Data Privacy: The Land Where Average Cases Don't Exist and Assumptions Quickly Perish (Invited Talk). | Olga Ohrimenko |
| 2024 | On the Parameterized Complexity of Diverse SAT. | Neeldhara Misra, Harshil Mittal, Ashutosh Rai |
| 2024 | Online Multi-Level Aggregation with Delays and Stochastic Arrivals. | Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski |
| 2024 | Complexity of Local Search for Euclidean Clustering Problems. | Bodo Manthey, Nils Morawietz, Jesse van Rhijn, Frank Sommer |
| 2024 | Exact Algorithms for Clustered Planarity with Linear Saturators. | Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi |
| 2024 | Simple Realizability of Abstract Topological Graphs. | Giordano Da Lozzo, Walter Didimo, Fabrizio Montecchiani, Miriam Mnch, Maurizio Patrignani, Ignaz Rutter |
| 2024 | Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs. | Vadim V. Lozin, Barnaby Martin, Sukanya Pandey, Danil Paulusma, Mark H. Siggers, Siani Smith, Erik Jan van Leeuwen |
| 2024 | Uniform Polynomial Kernel for Deletion to K_{2, p} Minor-Free Graphs. | William Lochet, Roohani Sharma |
| 2024 | A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems. | Qian Li, Minghui Ouyang, Yuyi Wang |
| 2024 | Composition Orderings for Linear Functions and Matrix Multiplication Orderings. | Susumu Kubo, Kazuhisa Makino, Souta Sakamoto |
| 2024 | Reconfiguration of Labeled Matchings in Triangular Grid Graphs. | Naonori Kakimura, Yuta Mishima |
| 2024 | Hardness Amplification for Dynamic Binary Search Trees. | Shunhua Jiang, Victor Lecomte, Omri Weinstein, Sorrachai Yingchareonthawornchai |
| 2024 | A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees. | Ashwin Jacob, Diptapriyo Majumdar, Meirav Zehavi |
| 2024 | Data Structures for Approximate Frchet Distance for Realistic Curves. | Ivor van der Hoog, Eva Rotenberg, Sampson Wong |
| 2024 | Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width). | Petr Hlinen, Liana Khazaliya |