arXiv cs.DS Data Structures and Algorithms

Amir Abboud, Ron Safier, Nathan Wallheimer: Equivalent Dichotomies for Triangle Detection in Subgraph, Induced, and Colored H-Free Graphs https://arxiv.org/abs/2602.23196 https://arxiv.org/pdf/2602.23196 https://arxiv.org/html/2602.23196

Henrik Reinst\"adtler, Christian Schulz, Nodari Sitchinava, Fabian Walliser: Efficient Parallel Algorithms for Hypergraph Matching https://arxiv.org/abs/2602.22976 https://arxiv.org/pdf/2602.22976 https://arxiv.org/html/2602.22976

Kleitos Papadopoulos: An $\mathcal{O}(\log N)$ Time Algorithm for the Generalized Egg Dropping Problem https://arxiv.org/abs/2602.22870 https://arxiv.org/pdf/2602.22870 https://arxiv.org/html/2602.22870

Isaac D. Myhal, Oliver Serang: static_maps: consteval std::map and std::unordered_map Implementations in C++23 https://arxiv.org/abs/2602.22506 https://arxiv.org/pdf/2602.22506 https://arxiv.org/html/2602.22506

Ilias Diakonikolas, Giannis Iakovidis, Daniel M. Kane, Sihan Liu: Testable Learning of General Halfspaces under Massart Noise https://arxiv.org/abs/2602.22300 https://arxiv.org/pdf/2602.22300 https://arxiv.org/html/2602.22300

[2026-02-27 Fri (UTC), 5 new articles found for csDS Data Structures and Algorithms]

Noam Goldberg, Danny Hermelin, Dvir Shabtay: Robust Permutation Flowshops Under Budgeted Uncertainty https://arxiv.org/abs/2602.22110 https://arxiv.org/pdf/2602.22110 https://arxiv.org/html/2602.22110

John Jeang, Vladimir Podolskii: Tight Bounds for Online Scheduling in the One-Fast-Many-Slow Machines Setting https://arxiv.org/abs/2602.22108 https://arxiv.org/pdf/2602.22108 https://arxiv.org/html/2602.22108

Tomer Adar: Instance-optimal estimation of L2-norm https://arxiv.org/abs/2602.21937 https://arxiv.org/pdf/2602.21937 https://arxiv.org/html/2602.21937

Alexander Lindermayr, Jens Schl\"oter: Delayed-Clairvoyant Flow Time Scheduling via a Borrow Graph Analysis https://arxiv.org/abs/2602.21827 https://arxiv.org/pdf/2602.21827 https://arxiv.org/html/2602.21827

Kaixin Wang, Kaiqiang Yu, Cheng Long: Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy https://arxiv.org/abs/2602.21700 https://arxiv.org/pdf/2602.21700 https://arxiv.org/html/2602.21700

Eduar Castrillo Velilla: DRESS and the WL Hierarchy: Climbing One Deletion at a Time https://arxiv.org/abs/2602.21557 https://arxiv.org/pdf/2602.21557 https://arxiv.org/html/2602.21557

Micha{\l} Szyfelbein, Dariusz Dereniowski: Precedence-Constrained Decision Trees and Coverings https://arxiv.org/abs/2602.21312 https://arxiv.org/pdf/2602.21312 https://arxiv.org/html/2602.21312

[2026-02-26 Thu (UTC), 7 new articles found for csDS Data Structures and Algorithms]

Petr Chmel, Aditi Dudeja, Michal Kouck\'y, Ian Mertz, Ninad Rajgopal: Frontier Space-Time Algorithms Using Only Full Memory https://arxiv.org/abs/2602.21089 https://arxiv.org/pdf/2602.21089 https://arxiv.org/html/2602.21089

Roman Edenhofer: A Space-space Trade-off for Directed st-Connectivity https://arxiv.org/abs/2602.21088 https://arxiv.org/pdf/2602.21088 https://arxiv.org/html/2602.21088

Vinicius Tikara Venturi Date, Leandro Miranda Zatesko: A $2$-branching construction for the $\chi \leq 2r$ bound https://arxiv.org/abs/2602.20949 https://arxiv.org/pdf/2602.20949 https://arxiv.org/html/2602.20949

Elena Gribelyuk, Honghao Lin, David P. Woodruff, Huacheng Yu, Samson Zhou: Adversarial Robustness on Insertion-Deletion Streams https://arxiv.org/abs/2602.20854 https://arxiv.org/pdf/2602.20854 https://arxiv.org/html/2602.20854

Eduar Castrillo Velilla: DRESS: A Continuous Framework for Structural Graph Refinement https://arxiv.org/abs/2602.20833 https://arxiv.org/pdf/2602.20833 https://arxiv.org/html/2602.20833

Keigo Oka: Turing Completeness of GNU find: From mkdir-assisted Loops to Standalone Computation https://arxiv.org/abs/2602.20762 https://arxiv.org/pdf/2602.20762 https://arxiv.org/html/2602.20762

Ria Stevens, Fangshuo Liao, Barbara Su, Jianqiang Li, Anastasios Kyrillidis: Exploiting Low-Rank Structure in Max-K-Cut Problems https://arxiv.org/abs/2602.20376 https://arxiv.org/pdf/2602.20376 https://arxiv.org/html/2602.20376

[2026-02-25 Wed (UTC), 7 new articles found for csDS Data Structures and Algorithms]

Felix Thaler, Sebastian Keller: GPU-Native Compressed Neighbor Lists with a Space-Filling-Curve Data Layout https://arxiv.org/abs/2602.19873 https://arxiv.org/pdf/2602.19873 https://arxiv.org/html/2602.19873

Kasper Green Larsen, Markus Engelund Mathiasen, Chirag Pabbaraju, Clement Svendsen: The Sample Complexity of Replicable Realizable PAC Learning https://arxiv.org/abs/2602.19552 https://arxiv.org/pdf/2602.19552 https://arxiv.org/html/2602.19552

Sajjad Hashemian: Quantum Sketches, Hashing, and Approximate Nearest Neighbors https://arxiv.org/abs/2602.19259 https://arxiv.org/pdf/2602.19259 https://arxiv.org/html/2602.19259

Jakub Ruszil, Artur Pola\'nski, Adam Roman, Jakub Zelek: Computational Complexity of Edge Coverage Problem for Constrained Control Flow Graphs https://arxiv.org/abs/2602.18774 https://arxiv.org/pdf/2602.18774 https://arxiv.org/html/2602.18774

Jialin Yu, Mo\"ise Blanchard: Distribution-Free Sequential Prediction with Abstentions https://arxiv.org/abs/2602.17918 https://arxiv.org/pdf/2602.17918 https://arxiv.org/html/2602.17918

L\'aszl\'o Kozma, Michal Opler: Fast and simple multiplication of bounded twin-width matrices https://arxiv.org/abs/2602.20023 https://arxiv.org/pdf/2602.20023 https://arxiv.org/html/2602.20023

Paul Paschmanns, Vera Traub: The Bidirected Cut Relaxation for Steiner Tree: Better Integrality Gap Bounds and the Limits of Moat Growing https://arxiv.org/abs/2602.19879 https://arxiv.org/pdf/2602.19879 https://arxiv.org/html/2602.19879

Gero Ellmies, Till Fluschnik: Placing Green Bridges Optimally for Robust Habitat Reconnection https://arxiv.org/abs/2602.19834 https://arxiv.org/pdf/2602.19834 https://arxiv.org/html/2602.19834