Theory & Algorithms · Computer Science & AI
Data Structures & Algorithms
The newest papers in Data Structures & Algorithms that ReadSearch has read, newest first. Each links to its own page, with its authors, date, where it was published and the original.
1,174 papers, from 4 September 2026 to 5 November 2026: 1,174 arXiv preprints.
Get the few papers worth your time in Data Structures & Algorithms every morning.
Follow Data Structures & Algorithms and ReadSearch reads its new papers each day, then brings you the few worth reading, each with its key finding in a sentence.
Newest papers, page 55
Counting Paths and Trees via Exterior Algebra
We give randomized approximation algorithms for counting k-paths and k-forests in a host graph.Fast and Theoretically-Efficient Batch-Parallel Link-Cut Trees, Euler Tour Trees, and Treaps
Parallel batch-dynamic trees are a fundamental building block in recent theoretical and practical advances in dynamic graph algorithms.A rooted tree framework for linear time ultrabubble detection
Pangenomics uses graphs to show genetic differences within or between species.Prefix Sharing Is a Sorting Problem
LLM serving reuses KV cache by exact prefix match, so when a prompt is assembled from a set of reusable pieces -- retrieved passages, tool definitions, few-shot exemplars -- the order chosen for…Beyond Kruskal: Polynomial-Time Tensor Decomposition under the Lovitz-Petrov Condition
Identifiability criteria certify that a given tensor decomposition is a unique rank decomposition.Tight Hardness for Temporal Path Covers at Vertex-Cover Number Two
Temporal Path Cover (TPC) and Temporally Disjoint Path Cover (TDPC) ask for minimum-cardinality covers of a temporal digraph by temporal paths, with TDPC additionally requiring pairwise temporal…Should Tables Be Sorted? Revisited with a Large Language Model
We revisit the implicit membership problem in Yao's full-table model [Yao, 1981] and obtain, to our knowledge, the first quantitative improvements to his 45-year-old Ramsey bounds, most notably…Colored Interaction-Profile Realization: Complexity of Matching-Match on Spiders
Network motifs and colored local interaction patterns provide a useful way to describe the structure of complex networks.Maximum Matching on Regular Nonbipartite Graphs
Blocking flow-type maximum matching algorithms are based on finding maximal sets of shortest augmenting paths.Spatial Mixing and Deterministic Approximate Counting of Multi-spin Systems beyond Bounded Degree Graphs
We develop a framework for deterministic approximate counting of multi-spin systems beyond bounded-degree graphs.Differential Privacy Meets Fixed Parameter Tractability: Algorithms and Lower Bounds
We study combinatorial optimization problems under the constraint of $ε$-differential privacy ($ε$-DP).Rank-1-perturbed trickledown theorems: Mixing time of Glauber dynamics for the Sherrington-Kirkpatrick model up to $β\leq \frac{1}{2}+\varepsilon$
We introduce a new family of trickledown theorems, a.k.a., local to global technique to bound the spectral gap of the Glauber dynamics for multi-state spin systems.NOC NOC, who's there? Clustering systems of tree-child and normal networks
Clustering systems provide a natural way to encode structural information contained in phylogenetic networks.Efficient Online Inverse Optimization with $O(d)$ Regret
We give a deterministic algorithm for online inverse linear optimization with regret $O(d)$, uniform in the horizon and $O(d^{2})$ time per round.Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice
Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points.A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix
For every fixed $0<\varepsilon\le1$, we give a deterministic strongly polynomial algorithm that, given a nonnegative matrix $A\in\mathbb{R}_{\ge0}^{n\times n}$, returns $Q$ satisfying…Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation
Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget.Convex Optimization with Nested Evolving Feasible Sets (CONES) under Time-Varying Loss Functions
Convex Optimization with Nested Evolving Feasible Sets (CONES)} was introduced in \cite{CONESVaze} where the objective function \(f\) remains fixed but the feasible region evolves over time as a…Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor
We show that there is a fixed planar graph $H$, namely the $5 \times 5$ grid, such that Max Independent Set remains NP-hard in $H$-induced-minor-free graphs.A Reusable Framework for Robust Approximation Algorithms in the Interval Uncertainty Model
Robust optimization under interval uncertainty aims to compute solutions that perform well on a range of scenarios that are described by interval-constrained costs.