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