Ijay Narang, Will Perkins: The Hard-Core Model on Bipartite Spectral Expanders: Counting and Sampling at All Fugacities https://arxiv.org/abs/2608.03848 https://arxiv.org/pdf/2608.03848 https://arxiv.org/html/2608.03848

Tomohiro Koana, Soh Kumabe, Yota Otachi: Complexity of induced subgraph isomorphism and maximum common induced subgraph parameterized by cluster vertex deletion number https://arxiv.org/abs/2608.03845 https://arxiv.org/pdf/2608.03845 https://arxiv.org/html/2608.03845

Tomohiro Koana, Soh Kumabe: A Single-Exponential FPT Algorithm for 2-Vertex-Connectivity Augmentation https://arxiv.org/abs/2608.03830 https://arxiv.org/pdf/2608.03830 https://arxiv.org/html/2608.03830

Madhumita Kundu, Souvik Saha, Saket Saurabh, Anannya Upasana: Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension https://arxiv.org/abs/2608.03801 https://arxiv.org/pdf/2608.03801 https://arxiv.org/html/2608.03801

Cassandra Marcussen, Ronitt Rubinfeld, Madhu Sudan: Quality Control Algorithms for Pattern Counting https://arxiv.org/abs/2608.03439 https://arxiv.org/pdf/2608.03439 https://arxiv.org/html/2608.03439

Hiroki Shibata, Yuto Fujie: Sensitivity and Size Relationships of the Lempel-Ziv Factorization https://arxiv.org/abs/2608.03351 https://arxiv.org/pdf/2608.03351 https://arxiv.org/html/2608.03351

Jiseung Kim: One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time https://arxiv.org/abs/2608.03220 https://arxiv.org/pdf/2608.03220 https://arxiv.org/html/2608.03220

Jianfeng Hou, Hongbin Zhao: Near-Optimal Algorithms for Maximal Clique Enumeration in Structurally Sparse Graphs https://arxiv.org/abs/2608.02614 https://arxiv.org/pdf/2608.02614 https://arxiv.org/html/2608.02614

[2026-08-05 Wed (UTC), 8 new articles found for csDS Data Structures and Algorithms]

Honghao Lin, Vahab Mirrokni, David P. Woodruff: The Condition-Number Barrier in Sparse Least Squares https://arxiv.org/abs/2608.02588 https://arxiv.org/pdf/2608.02588 https://arxiv.org/html/2608.02588

Honghao Lin, Vahab Mirrokni, David P. Woodruff: Pairwise-Independent Dithering for Single-Stage Hadamard Quantization https://arxiv.org/abs/2608.02564 https://arxiv.org/pdf/2608.02564 https://arxiv.org/html/2608.02564

Weiming Feng, Yucheng Fu, Heng Guo: Approximating two-terminal network reliability https://arxiv.org/abs/2608.02523 https://arxiv.org/pdf/2608.02523 https://arxiv.org/html/2608.02523

Ijay Narang, Will Perkins, Yuzhou Wang, Timothy L. H. Wee: Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs https://arxiv.org/abs/2608.02503 https://arxiv.org/pdf/2608.02503 https://arxiv.org/html/2608.02503

Minki Hhan: Solving the Shortest Vector Problem in time $2^{0.6039n}$ Time via Mid-point Hessian https://arxiv.org/abs/2608.02478 https://arxiv.org/pdf/2608.02478 https://arxiv.org/html/2608.02478

Weronika Wrzos-Kaminska: Recovering Planted Colorings in Sublinear Time https://arxiv.org/abs/2608.02338 https://arxiv.org/pdf/2608.02338 https://arxiv.org/html/2608.02338

Poojan Shah: Noisy k-means++ is Not too Noisy https://arxiv.org/abs/2608.02318 https://arxiv.org/pdf/2608.02318 https://arxiv.org/html/2608.02318

Othon Michail, George Skretas, Georg Tennigkeit, Shaily Verma: Reconfiguration of Temporal Networks under Reachability Constraints https://arxiv.org/abs/2608.02227 https://arxiv.org/pdf/2608.02227 https://arxiv.org/html/2608.02227

Deeparnab Chakrabarty, Aditi Dudeja, David Saulpic: Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds https://arxiv.org/abs/2608.02176 https://arxiv.org/pdf/2608.02176 https://arxiv.org/html/2608.02176

Bennet H\"ormann, Martin Schirneck: Minimal-to-Maximal Conversion Search Is Not Output-Polynomial https://arxiv.org/abs/2608.02159 https://arxiv.org/pdf/2608.02159 https://arxiv.org/html/2608.02159

Kun He, Dimitrios Myrisiotis, Junhong Nie, Zongqi Wan: Approximating the Trace Distance Between Product Quantum States https://arxiv.org/abs/2608.01841 https://arxiv.org/pdf/2608.01841 https://arxiv.org/html/2608.01841

Paola Bonizzoni, Davide Cozzi, Travis Gagie, Younan Gao, Ragnar Groot Koerkamp: MEM-finding with run-length compressed strings https://arxiv.org/abs/2608.01387 https://arxiv.org/pdf/2608.01387 https://arxiv.org/html/2608.01387

Hayder Tirmazi, Sam Markelon, Allison Bishop, Michael Mitzenmacher: Context Compaction Theory https://arxiv.org/abs/2608.01326 https://arxiv.org/pdf/2608.01326 https://arxiv.org/html/2608.01326

Ziyi Cai, Shuangping Li, Yiheng Shen, Kangning Wang, Peng Zhang: Dense Language Generation Made Simple: Deterministic, Randomized, and Multi-Order Algorithms https://arxiv.org/abs/2608.01320 https://arxiv.org/pdf/2608.01320 https://arxiv.org/html/2608.01320

Chansophea Wathanak In, Yi Li, Wai Ming Tai, Xuan Wu: Active Regression for Single-Index Models with Unknown Link Functions https://arxiv.org/abs/2608.01287 https://arxiv.org/pdf/2608.01287 https://arxiv.org/html/2608.01287

Chuang-Chieh Lin: Testing Full Quartet Consistency: Adaptive Reconstruction, Random Verification, and Constant-Query Testability https://arxiv.org/abs/2608.00987 https://arxiv.org/pdf/2608.00987 https://arxiv.org/html/2608.00987

Yasser Alghouass, Eric Balkanski, Nicole Megow, Vineet Goyal: A Consistency-Robustness Framework for Robust Optimization: Integrating Predictions into Robust Scheduling https://arxiv.org/abs/2608.00848 https://arxiv.org/pdf/2608.00848 https://arxiv.org/html/2608.00848

Rajarshi Bhattacharjee, Cameron Musco, Dominic Rutkowski: Sublinear Time Eigenvector Approximation via Column Sampling https://arxiv.org/abs/2608.00840 https://arxiv.org/pdf/2608.00840 https://arxiv.org/html/2608.00840

William Kuszmaul: An Analysis of Brent's Insertion Method for Hash Tables https://arxiv.org/abs/2608.00762 https://arxiv.org/pdf/2608.00762 https://arxiv.org/html/2608.00762

Cheng Peng: Robust Polynomial Freiman-Ruzsa from Corrupted Set Observations via a Sharp Persistent-Subset BSG Compiler https://arxiv.org/abs/2608.00451 https://arxiv.org/pdf/2608.00451 https://arxiv.org/html/2608.00451

Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Gabriele Farina, Giulio Malavolta: A Subsampling Theorem for Constraint Satisfaction Problems with Large Arity https://arxiv.org/abs/2608.00203 https://arxiv.org/pdf/2608.00203 https://arxiv.org/html/2608.00203