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 10
Three-phase time minimization transportation problem with non-idle phases: a polynomial two-witness algorithm
The three-phase time minimization transportation problem partitions the origin-terminal links into three sets used in consecutive phases and minimizes the sum of the phase shipment times.Deterministic $n^{O(\log n)}$ Graph Isomorphism Algorithm via Inherited Decompositions
We give a deterministic $n^{O(\log n)}$-time algorithm for graph isomorphism.A Deterministic O(log m)-Competitive Algorithm for Online Minimum Cost Bipartite Matching with Delays
In the online Minimum cost Bipartite Perfect Matching with Delays (MBPMD) problem, $m$ requests and $m$ servers arrive over time in a metric space.A logarithm-free subexponential algorithm for minimum quartet inconsistency
We give a deterministic algorithm for complete, unweighted minimum quartet inconsistency (MQI) with time and space $2^{O(k^{1/4})}+n^{O(1)}$, where $n$ is the number of taxa and~$k$ is the allowed…Smoothed analysis of stability radii for the assignment problem
Every linear program can tolerate small changes to its costs and still yield a solution of the original problem.Fresh-Priority Eviction for Cuckoo Filters: Exploiting Latent Randomness Under XOR Hashing
Cuckoo filters are a widely adopted approximate membership query (AMQ) data structure that supports insertions, lookups, and deletions with low memory overhead.Monotone Local Search with Sample-Dependent Running Times
Monotone Local Search turns an algorithm that extends a given partial solution into an algorithm that finds a solution from scratch: sample a few elements, hope that they lie in an unknown solution…Exact Tie-Breaking and Tight Degree Bounds for Minimum-Degree Greedy on Interval Graphs
We study tie-breaking in the minimum-degree greedy algorithm (MDG) for maximum independent set on interval graphs.Efficient Lempel-Ziv Prediction with the Run-Length BWT
Lempel-Ziv Plurality (LZP) is an algorithm of Kosoy that predicts the next symbol of a string by using its Lempel-Ziv factorization, and makes at most $O(z\log n)$ mistakes on every string of length…Approximation Algorithms for Maximum-Weight Degree-Bounded Forests
In the maximum-weight degree-bounded forest problem, we are given a graph with nonnegative edge weights and a degree upper bound on each vertex.Multiplicative Weights for Mixed Block Constraints and Maximum Multicommodity Flow
We study multiplicative-weights (MWU) algorithms for block-separable feasibility problems containing both packing and covering constraints.Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts
We present a general framework for deterministic constant-round approximation of covering problems in sparse networks in the broadcast CONGEST model, where every vertex broadcasts the same $O(\log…Faster Semi-Streaming and Dynamic Approximate Maximum Weight Matchings in General Graphs: A Unified Framework
We study the $(1-\varepsilon)$-approximate maximum weight matching problem in general graphs with $n$ vertices and integer edge weights in $[1,W]$.Faster Algorithms for Disjoint Paths in DAGs and Two Disjoint Shortest Paths
For $k$ vertex-disjoint paths with prescribed endpoints in a directed acyclic graph (DAG), the $O(mn^{k-1})$-time pebbling algorithm of Fortune, Hopcroft, and Wyllie [TCS 1980] has remained the…Near-Quadratic Error-Free Graph Matching above Otter's Threshold via Approximate Local Tree Correlation Testing
This paper presents a near-quadratic-time algorithm that correctly matches almost all nodes of two correlated Erdős-Rényi graphs without any incorrect matches.Faster graphic matroid parity: Breaking the $nm$ time complexity barrier
In the graphic matroid parity problem, we are given an undirected multigraph $G=(V,E)$ with $n$ vertices, together with a partition of $E$ into $m$ pairs of distinct edges, and the goal is to find a…Limits and Constants of OpenAI's Claimed ETH Refutation
A recent OpenAI preprint claims a deterministic algorithm that counts the satisfying assignments of a $k$-CNF formula in time $2^{O_k(n\log\log n/\sqrt{\log n})}$, and $2^{O(n/\sqrt{\log n})}$ at…Facility Location with Customer Incompatibilities
We study metric facility location with customer incompatibilities, where the clients assigned to each facility must satisfy prescribed independence constraints.Compressed Oracle Duality: A simple framework for knowing what quantum adversaries know
Given a quantum adversary that queries a random oracle, how do we characterize the information that they "know"?Testing MAX-CUT in the Adjacency Matrix Model: Tight Non-Adaptive Bounds and a Cubic Adaptive Lower Bound
We study the query complexity of approximating the MAX-CUT value to additive error $\varepsilon n^2$ in the adjacency matrix model.