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