| 2025 | 36th International Symposium on Algorithms and Computation, ISAAC 2025, Tainan, Taiwan, December 7-10, 2025 Ho-Lin Chen, Wing-Kai Hon, Meng-Tsung Tsai |
| 2025 | A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth. Sergio Cabello, Alexander Dobler, Gasper Fijavz, Thekla Hamm, Mirko H. Wagner |
| 2025 | A Dimension-Reducing Fréchet Simplification Oracle. Boris Aronov, Tsuri Farhana, Matthew J. Katz, Indu Ramesh |
| 2025 | A General Framework for Finding Diverse Solutions via Network Flow and Its Applications. Yuni Iwamasa, Tomoki Matsuda, Shunya Morihira, Hanna Sumita |
| 2025 | A Parameterized Study of Secluded Structures in Directed Graphs. Jonas Schmidt, Shaily Verma, Nadym Mallek |
| 2025 | A Tight Lower Bound for Online Service with Deadlines and Lazy Server. Yann Disser, Linda Thelen |
| 2025 | An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies. Yike Chen, Ke Shi, Chao Xu |
| 2025 | Anonymous Self-Stabilising Localisation via Spatial Population Protocols. Leszek Gasieniec, Lukasz Kuszner, Ehsan Latif, Ramviyas Parasuraman, Paul G. Spirakis, Grzegorz Stachowiak |
| 2025 | Approximation Schemes for k-Subset Sum Ratio and k-Way Number Partitioning Ratio. Sotiris Kanellopoulos, Giorgos Mitropoulos, Antonis Antonopoulos, Nikos Leonardos, Aris Pagourtzis, Christos Pergaminelis, Stavros Petsalakis, Kanellos Tsitouras |
| 2025 | BFS and Reverse Shortest Paths for Ball Intersection Graphs in Three and Higher Dimensions. Matthew J. Katz, Rachel Saban, Micha Sharir |
| 2025 | Challenges and Opportunities of Graph-Based Algorithms for Similarity Search (Invited Talk). Piotr Indyk |
| 2025 | Circle-Segment Intersection Queries in Connected Geometric Graphs. Peyman Afshani, Yannick Bosch, Sabine Storandt |
| 2025 | Coloring Reconfiguration Under Color Swapping. Janosch Fuchs, Rin Saito, Tatsuhiro Suga, Takahiro Suzuki, Yuma Tamura |
| 2025 | Compressibility Measures and Succinct Data Structures for Piecewise Linear Approximations. Paolo Ferragina, Filippo Lari |
| 2025 | Covering Weighted Points Using Unit Squares. Chaeyoon Chung, Jaegun Lee, Hee-Kap Ahn |
| 2025 | Deterministic Local Problems in Radio Networks: On the Impact of Local Domination and a Bit of Advice. Pawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski, Shay Kutten, Miguel A. Mosteiro |
| 2025 | Distributed Complexity of P_k-Freeness: Decision and Certification. Masayuki Miyamoto |
| 2025 | Enumerating the Irreducible Closed Sets of an Acyclic Implicational Base of Bounded Degree. Oscar Defrain, Arthur Ohana, Simon Vilmin |
| 2025 | Finding Diverse Solutions in Combinatorial Problems with a Distributive Lattice Structure. Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma |
| 2025 | Finding d-Cuts in Claw-Free Graphs. Jungho Ahn, Tala Eagling-Vose, Felicia Lucke, Daniël Paulusma, Siani Smith |
| 2025 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2025 | Graph Coloring Below Guarantees via Co-Triangle Packing. Shyan Akmal, Tomohiro Koana |
| 2025 | Hardness and Fixed Parameter Tractability for Pinwheel Scheduling Problems. Yusuke Kobayashi, Bingkai Lin |
| 2025 | Hash Functions Bridging the Gap from Theory to Practice (Invited Talk). Mikkel Thorup |
| 2025 | Incidences Between Curves and Points on the Grid. Esther Ezra, Micha Sharir |
| 2025 | Local Routing on Ordered Θ-Graphs. André van Renssen, Shuei Sakaguchi |
| 2025 | Matchgate Signatures Under Variable Permutations. Boning Meng, Yicheng Pan |
| 2025 | Maximizing Social Welfare Among EF1 Allocations at the Presence of Two Types of Agents. Jiaxuan Ma, Yong Chen, Guangting Chen, Mingyang Gong, Guohui Lin, An Zhang |
| 2025 | Minimum Partition of Polygons Under Width and Cut Constraints. Jaehoon Chung, Kazuo Iwama, Chung-Shou Liao, Hee-Kap Ahn |
| 2025 | Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto |
| 2025 | New Algorithmic Directions in Optimal Transport and Applications for Product Spaces. Salman Beigi, Omid Etesami, Mohammad Mahmoody, Amir Najafi |
| 2025 | New Approximate Distance Oracles and Their Applications. Avi Kadria, Liam Roditty |
| 2025 | On the (In)Approximability of the Monitoring Edge Geodetic Set Problem. Davide Bilò, Giordano Colli, Luca Forlizzi, Stefano Leucci |
| 2025 | Optimal Online Bipartite Matching in Degree-2 Graphs. Amey Bhangale, Arghya Chakraborty, Prahladh Harsha |
| 2025 | Parallel Joinable B-Trees in the Fork-Join I/O Model. Michael T. Goodrich, Yan Gu, Ryuto Kitagawa, Yihan Sun |
| 2025 | Parameterized Algorithms for the Drone Delivery Problem. Simon Bartlmae, Andreas Hene, Joshua Könen, Heiko Röglin |
| 2025 | Parameterized Complexity of Directed Traveling Salesman Problem. Václav Blazej, Andreas Emil Feldmann, Foivos Fioravantes, Pawel Rzazewski, Ondrej Suchý |
| 2025 | Parameterized Reunion with Achromatic Number. Satyabrata Jana, Souvik Saha, Saket Saurabh, Anannya Upasana |
| 2025 | Pathfinding in Self-Deleting Graphs. Michal Dvorák, Dusan Knop, Michal Opler, Jan Pokorný, Ondrej Suchý, Krisztina Szilágyi |
| 2025 | Polynomial Equivalence of Extended Chemical Reaction Models. Divya Bajaj, Jose Luis Castellanos, Ryan Knobel, Austin Luchsinger, Aiden Massie, Adrian Salinas, Pablo Santos, Ramiro Santos, Robert Schweller, Tim Wylie |
| 2025 | Precoloring Extension with Demands on Paths. Arun Kumar Das, Michal Opler, Tomás Valla |
| 2025 | Quadratic Kernel for Cliques or Trees Vertex Deletion. Soh Kumabe |
| 2025 | Reachability of Independent Sets and Vertex Covers Under Extended Reconfiguration Rules. Shuichi Hirahara, Naoto Ohsaka, Tatsuhiro Suga, Akira Suzuki, Yuma Tamura, Xiao Zhou |
| 2025 | Realization of Temporally Connected Graphs Based on Degree Sequences. Arnaud Casteigts, Michelle Döring, Nils Morawietz |
| 2025 | Realizing Metric Spaces with Convex Obstacles. Sándor Kisfaludi-Bak, Leonidas Theocharous |
| 2025 | Reforming an Unfair Allocation by Exchanging Goods. Sheung Man Yuen, Ayumi Igarashi, Naoyuki Kamiyama, Warut Suksompong |
| 2025 | Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs. Michelle Döring |
| 2025 | Small Space Encoding and Recognition of k-Palindromic Prefixes. Gabriel Bathie, Jonas Ellert, Tatiana Starikovskaya |
| 2025 | Space-Efficient Depth-First Search via Augmented Succinct Graph Encodings. Michael Elberfeld, Frank Kammer, Johannes Meintrup |
| 2025 | Sparse Induced Subgraphs in P₇-Free Graphs of Bounded Clique Number. Maria Chudnovsky, Jadwiga Czyzewska, Kacper Kluk, Marcin Pilipczuk, Pawel Rzazewski |
| 2025 | Star-Based Separators for Intersection Graphs of c-Colored Pseudo-Segments. Mark de Berg, Bart M. P. Jansen, Jeroen S. K. Lamme |
| 2025 | Streaming Periodicity with Mismatches, Wildcards, and Edits. Taha El Ghazi, Tatiana Starikovskaya |
| 2025 | Structural Parameterizations of Simultaneous Planarity. Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Matthias Pfretzschner, Ignaz Rutter |
| 2025 | Structural Parameters for Steiner Orientation. Tesshu Hanaka, Michael Lampis, Nikolaos Melissinos, Edouard Nemery, Hirotaka Ono, Manolis Vasilakis |
| 2025 | Time-Optimal k-Server. Fabian Frei, Dennis Komm, Moritz Stocker, Philip Whittington |
| 2025 | Traffic-Oblivious Multi-Commodity Flow Network Design. Markus Chimani, Max Ilsen |