| 2024 | 35th International Symposium on Algorithms and Computation, ISAAC 2024, Sydney, Australia, December 8-11, 2024 Julián Mestre, Anthony Wirth |
| 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 | A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees. Ashwin Jacob, Diptapriyo Majumdar, Meirav Zehavi |
| 2024 | A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems. Qian Li, Minghui Ouyang, Yuyi Wang |
| 2024 | Algorithmic Problems in Discrete Choice (Invited Talk). Ravi Kumar |
| 2024 | Approximating the Fréchet Distance When Only One Curve Is c-Packed. Joachim Gudmundsson, Tiancheng Mai, Sampson Wong |
| 2024 | Approximation Algorithms for Cumulative Vehicle Routing with Stochastic Demands. Jingyang Zhao, Mingyu Xiao |
| 2024 | Basis Sequence Reconfiguration in the Union of Matroids. Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi, Yuto Okada, Rin Saito |
| 2024 | Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs. Vadim V. Lozin, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Mark H. Siggers, Siani Smith, Erik Jan van Leeuwen |
| 2024 | Complexity of Local Search for Euclidean Clustering Problems. Bodo Manthey, Nils Morawietz, Jesse van Rhijn, Frank Sommer |
| 2024 | Composition Orderings for Linear Functions and Matrix Multiplication Orderings. Susumu Kubo, Kazuhisa Makino, Souta Sakamoto |
| 2024 | Constant Approximating Disjoint Paths on Acyclic Digraphs Is W[1]-Hard. Michal Wlodarczyk |
| 2024 | Constrained Boundary Labeling. Thomas Depian, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger |
| 2024 | Constrained Two-Line Center Problems. Taehoon Ahn, Sang Won Bae |
| 2024 | Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain. Sándor P. Fekete, Ramin Kosfeld, Peter Kramer, Jonas Neutzner, Christian Rieck, Christian Scheffer |
| 2024 | Core Stability in Additively Separable Hedonic Games of Low Treewidth. Tesshu Hanaka, Noleen Köhler, Michael Lampis |
| 2024 | Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width). Petr Hlinený, Liana Khazaliya |
| 2024 | Data Privacy: The Land Where Average Cases Don't Exist and Assumptions Quickly Perish (Invited Talk). Olga Ohrimenko |
| 2024 | Data Structures for Approximate Fréchet Distance for Realistic Curves. Ivor van der Hoog, Eva Rotenberg, Sampson Wong |
| 2024 | Does Subset Sum Admit Short Proofs? Michal Wlodarczyk |
| 2024 | Dynamic Parameterized Problems on Unit Disk Graphs. Shinwoo An, Kyungjin Cho, Leo Jang, Byeonghyeon Jung, Yudam Lee, Eunjin Oh, Donghun Shin, Hyeonjun Shin, Chanho Song |
| 2024 | Easier Ways to Prove Counting Hard: A Dichotomy for Generalized #SAT, Applied to Constraint Graphs. MIT Hardness Group, Josh Brunner, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Markus Hecher, Frederick Stock, Zixiang Zhou |
| 2024 | Enhancing Generalized Compressed Suffix Trees, with Applications. Sankardeep Chakraborty, Kunihiko Sadakane, Wiktor Zuba |
| 2024 | Exact Algorithms for Clustered Planarity with Linear Saturators. Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi |
| 2024 | FPT Approximations for Fair k-Min-Sum-Radii. Lena Carta, Lukas Drexler, Annika Hennes, Clemens Rösner, Melanie Schmidt |
| 2024 | Fault-Tolerant Bounded Flow Preservers. Shivam Bansal, Keerti Choudhary, Harkirat Dhanoa, Harsh Wardhan |
| 2024 | From Chinese Postman to Salesman and Beyond: Shortest Tour δ-Covering All Points on All Edges. Fabian Frei, Ahmed Ghazy, Tim A. Hartmann, Florian Hörsch, Dániel Marx |
| 2024 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2024 | Generating All Invertible Matrices by Row Operations. Petr Gregor, Hung P. Hoang, Arturo Merino, Ondrej Micka |
| 2024 | Hardness Amplification for Dynamic Binary Search Trees. Shunhua Jiang, Victor Lecomte, Omri Weinstein, Sorrachai Yingchareonthawornchai |
| 2024 | Kernelization Complexity of Solution Discovery Problems. Mario Grobler, Stephanie Maaz, Amer E. Mouawad, Naomi Nishimura, Vijayaragunathan Ramamoorthi, Sebastian Siebertz |
| 2024 | Knapsack with Vertex Cover, Set Cover, and Hitting Set. Palash Dey, Ashlesha Hota, Sudeshna Kolay, Sipra Singh |
| 2024 | Lower Bounds for Adaptive Relaxation-Based Algorithms for Single-Source Shortest Paths. Sunny Atalig, Alexander Hickerson, Arrdya Srivastav, Tingting Zheng, Marek Chrobak |
| 2024 | Mimicking Networks for Constrained Multicuts in Hypergraphs. Kyungjin Cho, Eunjin Oh |
| 2024 | Minimum Plane Bichromatic Spanning Trees. Hugo A. Akitaya, Ahmad Biniaz, Erik D. Demaine, Linda Kleist, Frederick Stock, Csaba D. Tóth |
| 2024 | On HTLC-Based Protocols for Multi-Party Cross-Chain Swaps. Emily Clark, Chloe Georgiou, Katelyn Poon, Marek Chrobak |
| 2024 | On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting. Alexander Firbas, Manuel Sorge |
| 2024 | On the Connected Minimum Sum of Radii Problem. Hyung-Chan An, Mong-Jen Kao |
| 2024 | On the Parameterized Complexity of Diverse SAT. Neeldhara Misra, Harshil Mittal, Ashutosh Rai |
| 2024 | On the Spanning and Routing Ratios of the Yao-Four Graph. Prosenjit Bose, Darryl Hill, Michiel Smid, Tyler Tuttle |
| 2024 | Online Multi-Level Aggregation with Delays and Stochastic Arrivals. Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski |
| 2024 | Optimal Offline ORAM with Perfect Security via Simple Oblivious Priority Queues. Thore Thießen, Jan Vahrenhold |
| 2024 | Optimal Sensitivity Oracle for Steiner Mincut. Koustav Bhanja |
| 2024 | Partitioning Problems with Splittings and Interval Targets. Samuel Bismuth, Vladislav Makarov, Erel Segal-Halevi, Dana Shapira |
| 2024 | Reconfiguration of Labeled Matchings in Triangular Grid Graphs. Naonori Kakimura, Yuta Mishima |
| 2024 | Revisit the Scheduling Problem with Calibrations. Lin Chen, Yixiong Gao, Minming Li, Guohui Lin, Kai Wang |
| 2024 | Robust Bichromatic Classification Using Two Lines. Erwin Glazenburg, Thijs van der Horst, Tom Peters, Bettina Speckmann, Frank Staals |
| 2024 | Robust Classification of Dynamic Bichromatic Point Sets in R². Erwin Glazenburg, Marc J. van Kreveld, Frank Staals |
| 2024 | Role of Structured Matrices in Fine-Grained Algorithm Design (Invited Talk). Barna Saha |
| 2024 | Routing from Pentagon to Octagon Delaunay Graphs. Prosenjit Bose, Jean-Lou De Carufel, John Stuart |
| 2024 | Simple Realizability of Abstract Topological Graphs. Giordano Da Lozzo, Walter Didimo, Fabrizio Montecchiani, Miriam Münch, Maurizio Patrignani, Ignaz Rutter |
| 2024 | Single Family Algebra Operation on BDDs and ZDDs Leads to Exponential Blow-Up. Kengo Nakamura, Masaaki Nishino, Shuhei Denzumi |
| 2024 | Subsequence Matching and Analysis Problems for Formal Languages. Szilárd Zsolt Fazekas, Tore Koß, Florin Manea, Robert Mercas, Timo Specht |
| 2024 | Succinct Data Structures for Baxter Permutation and Related Families. Sankardeep Chakraborty, Seungbum Jo, Geunho Kim, Kunihiko Sadakane |
| 2024 | Temporal Queries for Dynamic Temporal Forests. Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Alessandro Straziota |
| 2024 | The Complexity of Geodesic Spanners Using Steiner Points. Sarita de Berg, Tim Ophelders, Irene Parada, Frank Staals, Jules Wulms |
| 2024 | The Existential Theory of the Reals with Summation Operators. Markus Bläser, Julian Dörfler, Maciej Liskiewicz, Benito van der Zander |
| 2024 | Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover. Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale |
| 2024 | Uniform Polynomial Kernel for Deletion to K_{2, p} Minor-Free Graphs. William Lochet, Roohani Sharma |
| 2024 | When Can Cluster Deletion with Bounded Weights Be Solved Efficiently? Jaroslav Garvardt, Christian Komusiewicz, Nils Morawietz |