arXiv cs.DS Data Structures and Algorithms

Oliver Kullmann, Edward Clewer: Simple minimally unsatisfiable subsets of 2-CNFs https://arxiv.org/abs/2603.10944 https://arxiv.org/pdf/2603.10944 https://arxiv.org/html/2603.10944

Matti Karppa: Huffman-Bucket Sketch: A Simple $O(m)$ Algorithm for Cardinality Estimation https://arxiv.org/abs/2603.10930 https://arxiv.org/pdf/2603.10930 https://arxiv.org/html/2603.10930

Kangke Cheng, Shihong Song, Guanlin Mo, Hu Ding: Sample-and-Search: An Effective Algorithm for Learning-Augmented k-Median Clustering in High dimensions https://arxiv.org/abs/2603.10721 https://arxiv.org/pdf/2603.10721 https://arxiv.org/html/2603.10721

Manish Kumar, Othon Michail, Andreas Padalkin, Christian Scheideler: Sublinear-Time Reconfiguration of Programmable Matter with Joint Movements https://arxiv.org/abs/2603.10720 https://arxiv.org/pdf/2603.10720 https://arxiv.org/html/2603.10720

Matteo Stromieri, Emanuele Natale, Amos Korman: Intermittent Cauchy walks enable optimal 3D search across target shapes and sizes https://arxiv.org/abs/2603.10655 https://arxiv.org/pdf/2603.10655 https://arxiv.org/html/2603.10655

Mohsen Ghaffari, Christoph Grunau: Density-Dependent Graph Orientation and Coloring in Scalable MPC https://arxiv.org/abs/2603.10639 https://arxiv.org/pdf/2603.10639 https://arxiv.org/html/2603.10639

Chirag Kaudan (Oregon State University), Amir Nayyeri (Oregon State University): Reconstructing Bounded Treelength Graphs with Linearithmic Shortest Path Distance Queries https://arxiv.org/abs/2603.10432 https://arxiv.org/pdf/2603.10432 https://arxiv.org/html/2603.10432

Christian Coester: Transposition is Nearly Optimal for IID List Update https://arxiv.org/abs/2603.10244 https://arxiv.org/pdf/2603.10244 https://arxiv.org/html/2603.10244

[2026-03-12 Thu (UTC), 8 new articles found for csDS Data Structures and Algorithms]

Joan Boyar, Shahin Kamali, Kim S. Larsen, Ali Fata Lavasani, Yaqiao Li, Denis Pankratov: On the Online Weighted Non-Crossing Matching Problem https://arxiv.org/abs/2603.09262 https://arxiv.org/pdf/2603.09262 https://arxiv.org/html/2603.09262

Peaker Guo, Rayne Holland, Hao Wu: Fast and Optimal Differentially Private Frequent-Substring Mining https://arxiv.org/abs/2603.09166 https://arxiv.org/pdf/2603.09166 https://arxiv.org/html/2603.09166

Miguel Bosch-Calvo, Fabrizio Grandoni, Yusuke Kobayashi, Takashi Noguchi: A PTAS for Weighted Triangle-free 2-Matching https://arxiv.org/abs/2603.09144 https://arxiv.org/pdf/2603.09144 https://arxiv.org/html/2603.09144

Cezar-Mihail Alexandru, Adithya Diddapur, Magn\'us M. Halld\'orsson, Christian Konrad, Kheeran K. Naidu: Unit Interval Selection in Random Order Streams https://arxiv.org/abs/2603.08937 https://arxiv.org/pdf/2603.08937 https://arxiv.org/html/2603.08937

Benjam\'in Guzm\'an: bsort: A theoretically efficient non-comparison-based sorting algorithm for integer and floating-point numbers https://arxiv.org/abs/2603.08929 https://arxiv.org/pdf/2603.08929 https://arxiv.org/html/2603.08929

[2026-03-11 Wed (UTC), 5 new articles found for csDS Data Structures and Algorithms]

Josh Alman, Shyamal Patel, Rocco A. Servedio: Learning Functions of Halfspaces https://arxiv.org/abs/2603.08700 https://arxiv.org/pdf/2603.08700 https://arxiv.org/html/2603.08700

Talya Eden, C. Seshadhri: A note on approximating the average degree of bounded arboricity graphs https://arxiv.org/abs/2603.08694 https://arxiv.org/pdf/2603.08694 https://arxiv.org/html/2603.08694

Pravesh Kothari, Anand Louis, Rameesh Paul, Prasad Raghavendra: Improved Certificates for Independence Number in Semirandom Hypergraphs https://arxiv.org/abs/2603.08693 https://arxiv.org/pdf/2603.08693 https://arxiv.org/html/2603.08693

Vincent Cohen-Addad, Liudeng Wang, David P. Woodruff, Samson Zhou: Distributed Algorithms for Euclidean Clustering https://arxiv.org/abs/2603.08615 https://arxiv.org/pdf/2603.08615 https://arxiv.org/html/2603.08615

Kshitij Gajjar, Neeldhara Misra: Permutation Match Puzzles: How Young Tanvi Learned About Computational Complexity https://arxiv.org/abs/2603.08110 https://arxiv.org/pdf/2603.08110 https://arxiv.org/html/2603.08110

Chao Li: The Li-Chao Tree: Algorithm Specification and Analysis https://arxiv.org/abs/2603.07948 https://arxiv.org/pdf/2603.07948 https://arxiv.org/html/2603.07948

Mike Heddes, Igor Nunes, Tony Givargis, Alex Nicolau: Approximating Tensor Network Contraction with Sketches https://arxiv.org/abs/2603.07387 https://arxiv.org/pdf/2603.07387 https://arxiv.org/html/2603.07387

[2026-03-10 Tue (UTC), 7 new articles found for csDS Data Structures and Algorithms]

Martin Schirneck: Transversal Rank, Conformality and Enumeration https://arxiv.org/abs/2603.06402 https://arxiv.org/pdf/2603.06402 https://arxiv.org/html/2603.06402

Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Kevin Schewior, Rob van Stee: Forwarding Packets Greedily https://arxiv.org/abs/2603.06039 https://arxiv.org/pdf/2603.06039 https://arxiv.org/html/2603.06039

Ofek Gila, Michael T. Goodrich, Vinesh Sridhar: How to Sort in a Refrigerator: Simple Entropy-Sensitive Strictly In-Place Sorting Algorithms https://arxiv.org/abs/2603.05676 https://arxiv.org/pdf/2603.05676 https://arxiv.org/html/2603.05676

[2026-03-09 Mon (UTC), 3 new articles found for csDS Data Structures and Algorithms]

Alexander E. Black, Raphael Steiner: Finding Short Paths on Simple Polytopes https://arxiv.org/abs/2603.05482 https://arxiv.org/pdf/2603.05482 https://arxiv.org/html/2603.05482

Guangya Cai: Generalizing Fair Top-$k$ Selection: An Integrative Approach https://arxiv.org/abs/2603.04689 https://arxiv.org/pdf/2603.04689 https://arxiv.org/html/2603.04689

[2026-03-06 Fri (UTC), 2 new articles found for csDS Data Structures and Algorithms]