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 15
Estimating the number of nodes and paths in a DAG by following a random path
We investigate a simple method to compute an unbiased estimate of the number of nodes of a directed acyclic graph (DAG) by following a random directed path.Order Maintenance in Worst-Case Constant Time, Verified
Order maintenance asks for a data structure that keeps a sequence of elements under insertions and deletions and tells which of two elements comes first.ExplainCC: Explaining Correlated Clusters by Node Labels
An increasingly important requirement for clustering algorithms is that decisions and outcomes need to be clearly understandable for human users.Fully Dynamic All-Pairs Min Cuts on Planar Graphs via Planar Pattern Emulators
We study the fully-dynamic all-pairs minimum cut problem on planar graphs.Dynamic $(Δ+1)$ Vertex Coloring with Adaptive Adversaries: Entropy Compression to the Rescue
We present a randomized algorithm for maintaining a $(Δ+1)$ vertex coloring of a fully dynamic graph against an adaptive adversary with $\tilde{O}(\sqrt{n})$ amortized update time.Complexity of Differentially Private Selection via Federated APIs
Differential privacy (DP) has become the standard for privacy-preserving data analysis, yet its practical implementation in federated or distributed settings often faces a significant utility gap…Fast Perfect $L_2$ Sampling
Perfect $L_2$ sampling is a powerful primitive for turnstile data streams, allowing algorithms to extract an index with probability proportional to its squared frequency, with applications to…Fully Dynamic Unconstrained Submodular Maximization
We study unconstrained maximization of a fixed nonnegative submodular function when the ground set changes by insertions and deletions.Dimension Reduction and Coresets for Min-Sum $k$-Clustering
The min-sum $k$-clustering problem asks to partition an input of $n$ points into $k$ clusters so as to minimize the total pairwise distance within clusters.Planned Restlessness: Delayed Meta Bandits with Budgets
We study episodic finite-horizon Bayesian bandits, or meta-bandits, with independent arms.Local Important Separators with Applications to Unbreakable Decomposition and Multicut
We present the first local FPT algorithm for finding important separators: Given an undirected graph $G$ with $n$ vertices and $m$ edges, vertices $s,t$ and parameters $k$ and $ν$, we can enumerate…An Unconditional Space-Approximation Lower Bound for Semi-Streaming Matching
We prove the first unconditional lower bound tradeoff between the number of passes and the approximation factor of maximum matchings in the semi-streaming model.Uniformity Testing for the Monomer-Dimer Model
We study uniformity testing for the monomer-dimer model on a known graph $G=(V,E)$.Differentially Private Preconditioned Power Iteration Method for Principal Component Analysis that Adapts to the Coherence
In Principal Component Analysis (PCA), we are given as input a matrix $A\in\mathbb{R}^{n\times d}$ and an integer $k\leq d$, and the goal is to find the top $k$ right-singular vectors of $A$.Linear-Time FPT Rectilinear Planarity Testing of Series-Parallel Graphs
A planar graph is rectilinear planar if it admits a planar orthogonal drawing without bends.Polynomial-Time Solvability of the Mixed Evacuation Problem
The mixed evacuation problem is a variant of the dynamic transshipment problem where there exist two modes of transportation and we allocate supplies to each mode of transportation in such a way…Tight Bounds for Randomized Generalized $k$-Server on Uniform Metrics
In the generalized $k$-server problem, each of $k$ servers moves in its own metric space, and a request $(r_1,\dots,r_k)$ is served once some server $i$ stands at the point $r_i$ of its space.A Linear Kernel for Planar Semitotal Domination
A set of vertices $S$ in a graph $G$ is a semitotal dominating set if $S$ is a dominating set and every vertex in $S$ has a witness, that is, another vertex in $S$ within distance at most two.Online Interval Selection with Binary Predictions: Optimal Consistency and a Continuous Robustness Tradeoff
We study online interval selection with binary predictions of membership in a final optimal solution.Approximate Counting for Mixed $p$-Spin Glasses in Weak External Fields via Cluster Expansion
We give algorithms for approximating the partition function $Z_N$ of the Sherrington--Kirkpatrick (SK) model and finite mixed Ising $p$-spin models with $p\ge 3$.