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 19
Near-Optimal Consistency-Robustness Bounds for Non-Clairvoyant Scheduling
We study the problem of characterizing the optimal consistency--robustness tradeoff for single-machine non-clairvoyant scheduling with predicted processing times.Optimal Labeling Schemes for $Γ$-Free Matrices
We study labeling schemes for $p \times q$ $Γ$-free binary matrices, which do not contain a submatrix of the form $Γ= \begin{pmatrix} 1 & 1 \\ 1 & 0 \end{pmatrix}$.On the Largest Cardinality Subset Sum
We study Largest Cardinality Subset Sum (LCSS): given $n$ nonnegative integers and a target $t$, compute a subset summing to $t$ with maximum cardinality.How to Walk a Dog in Parallel: On Parallel Computation of the Discrete Frechet Distance
The Fréchet distance (also known as the dog-leash distance) is a well-studied and prevalent distance measure for polygonal curves.Dynamically optimal weight-balanced binary search trees
In STOC 1972, J{ü}rg Nievergelt and Edward M.~Reingold introduced the $BB[α]$-tree, also known as a \emph{weight-balanced} tree, which for any $α\in (0,\frac{1}{2}]$ is a binary search tree where…A Tight Space Lower Bound for Pivot-Based Distance Oracles
An approximate distance oracle (ADO) is a compact data structure that answers distance queries within a multiplicative \emph{stretch} $k$.Fully Dynamic Triangle and 4-Vertex Subgraph Counting: From Theory to Practice and Back Again
Counting small patterns is a core primitive in large-scale graph analytics, with numerous applications in data management and network analysis.An experimental evaluation of static k-center clustering algorithms on graphs
The $k$-center problem is one of the most fundamental clustering problems and has applications in a wide range of areas, including facility location, network design, data mining, and machine learning.Asymmetric Likelihood-Free Hypothesis Testing
In likelihood-free hypothesis testing (LFHT), given samples from two unknown distributions $P,Q$ on $[n]$ with $\mathrm{d_{TV}}(P,Q)\geq\varepsilon$, and from a third distribution $D\in\{P,Q\}$, the…A Sharp Dynamic Haussler Lemma
Haussler's covering lemma (JCTA 1995) gives the sharp $(C/δ)^d$ metric-entropy bound for binary VC classes under normalized $\ell_1$ distance.Pre-emptive Carbon Aware Scheduling for Edge Workloads
Power grids use a constantly changing mix of fossil fuels and clean renewables like solar and wind.Approximation and Inapproximability of Non-Preemptive Dial-a-Ride
The non-preemptive dial-a-ride problem (DaRP) asks for a minimum-cost route of a capacitated vehicle that serves a collection of pickup-and-delivery requests, without allowing objects to be…Temporal Exploration and Rendezvous via Weisfeiler-Leman Colorings
Temporal graphs are graphs whose edge relation changes in discrete time steps.Tight Bounds for Paging with Time Windows and Joint Replenishment with Varying Opening Costs
We study the paging with time windows problem, a natural generalization of classical paging, in which each request must be served within a specified time interval.Polynomial pathwidth for graphs vertex-coverable by few shortest paths and algorithms for quasi-shortest path covers
We study how covering a graph by a small number of shortest or approximately shortest paths/walks constrains its treewidth and pathwidth.The Cost of Missed States: Online Tracking with Current-Observation Resets
An online tracker retains one state and may reset only to the current observation, although its complete observed history is available.Approximating Directed Telephone Multicast
In the telephone model a message starts at a source vertex, and in every round each informed vertex may call one neighbour.A 55-Addition Rank-23 Scheme for $3\times3$ Matrix Multiplication via Exact Two-Sided Minimization
We give a scheme that multiplies two $3\times3$ matrices with 23 multiplications and 55 additions over any ring, one addition below the previous record of 56 (Sun, 2026) and the first below 56 for…Improved rapid phase ordering for Ising dynamics on random regular graphs
We study Glauber dynamics for the Ising model on random $d$-regular graphs with $n$ vertices at low temperature, in the regime $β\geq C/d$ where $C,d$ are sufficiently large constants.A 2/3-Approximation Algorithm for the Residual Maximum Matching Problem in General Graphs
The residual maximum matching problem asks for a maximum matching whose deletion leaves a graph with the largest possible matching number.