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 25
FPTAS for Polygonal Multi-Robot Motion Planning
We study multi-robot motion planning in a polygonal environment with polygonal robots.Subexponential Parameterized Approximation for Group-Fair Euclidean $k$-Center
Clustering is a basic tool for grouping data into meaningful classes, but in many applications the resulting clusters must also respect the fairness conditions among different groups.Simple, Faster (min, +) Matrix Multiplication and APSP
In this note, we provide a deterministic algorithm that computes the $(\min, +)$-Matrix Product $C = A * B$ of two $N \times N$ matrices $A$ and $B$ with polynomially bounded integer entries in…Hypothesis Selection via Weighted Medians
Given $n$ distributions (hypotheses) $\mathcal H=\{H_1,\ldots,H_n\}$ and samples from an unknown target distribution $P$, proper hypothesis selection seeks a distribution whose total variation…Bounded-Density Vertex Deletion Beyond Vertex Cover
We study \textsc{Bounded-Density Vertex Deletion} (BDVD), where one asks whether at most \(k\) vertices can be deleted so that every remaining subgraph has density at most a rational input threshold…Claw-Free and Line Graph Edge Deletion on Block Graphs
Edge deletion problems ask for the fewest edges whose deletion gives a graph with a specified property.Subset Sum in Almost-Linear Time
We give a deterministic algorithm for finding a subset of the input integers $1\le a_1,\ldots,a_n \le Δ$ that sums to the target $t$ in $\mathcal{O}(n+Δ^{1+o(1)})$ time.Eccentricity Shortest Path: the structural parameter landscape
The Eccentricity Shortest Path problem asks, given a connected graph and a nonnegative integer $R$, whether some shortest path is within distance $R$ of every vertex.Tolerant Testers for Subgraph-Freeness
In this paper we study the problem of tolerantly testing the property of being $H$-free (which also implies distance approximation from being $H$-free).Near-Linear Preprocessing for Range Weighted Longest Increasing Subsequence Queries
We give a deterministic data structure for range weighted longest increasing subsequence (LIS) queries on $n$ values with positive weights.The Komlós Problem in Matrix-Multiplication Time
We give a randomized algorithm that, for an $m\times n$ matrix whose columns have Euclidean norm at most one, finds a signing with discrepancy below $99$ in expected $\widetilde…Improved Combinatorial Auctions with and without Samples
We give new mechanisms for combinatorial auctions in the offline, secretary, and prophet-with-samples models.Certifying Capacity and Gaps of the Rank-Dependent Gain-Sharing Framework for Ranking
The randomized primal-dual framework of Devanur, Jain, and Kleinberg (SODA 2013) splits each unit matching gain between endpoint dual variables according to the matched offline rank.Query Complexity of Densest Sub(hyper)graph Problems
Rubinstein et al. introduce the study of connectivity and minimum cut problems in the cut query model, where an algorithm can only access the edges of a graph through CUT queries.Nearly Optimal Quantum Sample Complexity of Learning Fourier-Sparse Boolean Functions
We study the number of uniform quantum examples needed to exactly learn a Boolean function with at most $k$ nonzero Fourier coefficients.Hitting Minors: Stronger Lower Bounds
For a fixed finite collection of graphs $\mathcal{F}$, the $\mathcal{F}$-Minor-Free Deletion problem asks, given a graph $G$ and an integer $k$, whether there is a set $S\subseteq V(G)$ with…Fully Dynamic Random-Walk Quantities on Undirected Expanders and $κ$-Uniform Directed Graphs
We study fully dynamic data structures for random-walk quantities on undirected expanders and fast-mixing directed graphs.Sampling from the Sherrington-Kirkpatrick Model up to Criticality
We prove that the simulated annealing algorithm efficiently samples from the Sherrington-Kirkpatrick model at inverse temperature $β< 1$ to an arbitrary inverse polynomial accuracy in total variation.A Matroid Generalization of Weighted Popular Matching: Characterization and Algorithm
We study a problem that unifies two major generalizations of popular matchings in the one-sided preference model.PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
We present PHastR, a minimal perfect hash function of the PHast family.