Data Structures and Algorithms arXiv

Multi-LLM Query Optimization Arlen Dean, Zijin Zhang, Stefanus Jasin, Yuqing Liu arxiv.org/abs/2603.24617 [𝚌𝚜.𝙳𝚂 𝚌𝚜.𝙻𝙶 𝚖𝚊𝚝𝚑.𝙾𝙲]

AutoCSF: Provably Space-Efficient Indexing of Skewed Key-Value Workloads via Filter-Augmented Compressed Static Functions David Torres Ramos, Vihan Lakshman, Chen Luo, Todd Treangen, Benjamin Coleman arxiv.org/abs/2603.24882 [𝚌𝚜.𝙳𝚂 𝚌𝚜.𝙳𝙱]

Fast Spanning Tree Sampling in Broadcast Congested Clique Nima Anari, Alireza Haqi arxiv.org/abs/2603.25018 [𝚌𝚜.𝙳𝚂 𝚌𝚜.𝙳𝙲]

Bounded Independence Edge Sampling for Combinatorial Graph Properties Aaron Putterman, Salil Vadhan, Vadim Zaripov arxiv.org/abs/2603.25095 [𝚌𝚜.𝙳𝚂 𝚌𝚜.𝙲𝙲]

The Geometry of Efficient Nonconvex Sampling Santosh S. Vempala, Andre Wibisono arxiv.org/abs/2603.25622 [𝚌𝚜.𝙳𝚂 𝚌𝚜.𝙻𝙶 𝚖𝚊𝚝𝚑.𝚂𝚃 𝚜𝚝𝚊𝚝.𝙼𝙻 𝚜𝚝𝚊𝚝.𝚃𝙷]

Advances in Exact and Approximate Group Closeness Centrality Maximization Christian Schulz, Jakob Ternes, Henning Woydt arxiv.org/abs/2603.25642 [𝚌𝚜.𝙳𝚂]

Near Linear Time Approximation Schemes for Clustering of Partially Doubling Metrics Anne Driemel, Jan Höckendorff, Ioannis Psarros, Christian Sohler, Di Yue arxiv.org/abs/2603.24336 [𝚌𝚜.𝙳𝚂]

A faster polynomial-space algorithm for Hamiltonian cycle parameterized by treedepth Stefan Kratsch arxiv.org/abs/2603.24492 [𝚌𝚜.𝙳𝚂]

Fault-Tolerant Distance Oracles Below the n ⋅ f Barrier Sanjeev Khanna, Christian Konrad, Aaron Putterman arxiv.org/abs/2603.24530 [𝚌𝚜.𝙳𝚂]

Coordinating Spot and Contract Supply in Freight Marketplaces Philip Kaminsky, Rachitesh Kumar, Roger Lederman arxiv.org/abs/2603.24574 [𝚌𝚜.𝙳𝚂 𝚖𝚊𝚝𝚑.𝙾𝙲]

Computing and Enumerating Minimal Common Supersequences Between Two Strings Braeden Sopp, Adiesha Liyanage, Mingyang Gong, Binhai Zhu arxiv.org/abs/2603.22591 [𝚌𝚜.𝙳𝚂]

Testing Properties of Edge Distributions Yumou Fei arxiv.org/abs/2603.22702 [𝚌𝚜.𝙳𝚂 𝚌𝚜.𝙲𝙲]

Algorithmic warm starts for Hamiltonian Monte Carlo Matthew S. Zhang, Jason M. Altschuler, Sinho Chewi arxiv.org/abs/2603.22741 [𝚌𝚜.𝙳𝚂 𝚌𝚜.𝙻𝙶 𝚌𝚜.𝙽𝙰 𝚖𝚊𝚝𝚑.𝙽𝙰 𝚖𝚊𝚝𝚑.𝚂𝚃 𝚜𝚝𝚊𝚝.𝙼𝙻 𝚜𝚝𝚊𝚝.𝚃𝙷]

On the Complexity of Secluded Path Problems Tesshu Hanaka, Daisuke Tsuru arxiv.org/abs/2603.22818 [𝚌𝚜.𝙳𝚂]

Gabow's O(√nm) Maximum Cardinality Matching Algorithm, Revisited Kurt Mehlhorn, Romina Nobahari arxiv.org/abs/2603.22909 [𝚌𝚜.𝙳𝚂]

Accelerating Maximum Common Subgraph Computation by Exploiting Symmetries Buddhi Kothalawala, Henning Koehler, Muhammad Farhan arxiv.org/abs/2603.23031 [𝚌𝚜.𝙳𝚂]

Compressing Dynamic Fully Indexable Dictionaries in Word-RAM Gabriel Marques Domingues arxiv.org/abs/2603.23119 [𝚌𝚜.𝙳𝚂]

Algorithms and Hardness for Geodetic Set on Tree-like Digraphs Florent Foucaud, Narges Ghareghani, Lucas Lorieau, Morteza Mohammad-Noori, Rasa Parvini Oskuei, Prafullkumar Tale arxiv.org/abs/2603.23193 [𝚌𝚜.𝙳𝚂 𝚌𝚜.𝙳𝙼]

Dynamic k-center clustering with lifetimes Simone Moretti, Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci arxiv.org/abs/2603.23348 [𝚌𝚜.𝙳𝚂]

(Sets of ) Complement Scattered Factors Duncan Adamson, Pamela Fleischmann, Annika Huch arxiv.org/abs/2603.20790 [𝚌𝚜.𝙳𝚂 𝚌𝚜.𝙵𝙻 𝚖𝚊𝚝𝚑.𝙲𝙾]