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 44
Geometric Optimization Parameterized by Piercing Complexity
Packing and covering problems for geometric regions have been studied under many notions of complexity, including VC-dimension, union complexity, shallow-cell complexity, and fatness.Faster Linear Programming with $\sqrt{\mathrm{rank}}$ Linear System Solves
Lee and Sidford [LS19] showed that the linear program $\min\{c^\top x\ :\ A^\top x=b,\ l\leq x\leq u\}$ over $x\in\mathbb{R}^m$, where $A\in\mathbb{R}^{m\times n}$, can be solved to accuracy $ε$…Odd Cycle Transversal on $H$-free graphs
\textsc{Odd Cycle Transversal} is a classic $\mathsf{NP}$-hard graph optimization problem asking for a minimum-weight set of vertices whose deletion makes the input graph bipartite, or equivalently…Deterministic Linear-Time Modular Subset Sum
We give a deterministic $O(m)$-time algorithm for exact modular subset sum over every modulus $m$ on compact input: distinct residues with multiplicities.Moment Ambiguity and the Limits of Robust Stochastic Optimization
We study fundamental information-theoretic limits of robust stochastic optimization when the distribution is known only through its exact moment sequence.Collision-free Movement on Grids and Beyond
We study collision-free movement problems on graphs, where the task is to coordinate a set of robots so that they reach a target formation satisfying a desired property while minimizing the total…The planted tensor problem over finite fields: algorithms and cryptography
Inspired by the planted clique problem for random graphs, we introduce the planted totally-isotropic space problem for random tensors as follows.An Optimal Structure for All-Pairs Nearest Mincuts and Sensitivity Oracles for Edge Insertions
Given an undirected weighted graph $G=(V,E)$ on $n$ vertices, the classical Gomory-Hu tree of $G$ is a structure that encodes an arbitrary minimum $s,t$-cut for every $s,t\in V$ using just $O(n)$…An ETH-Tight, Constructive FPT Algorithm for the Cone and Polytope Intersection Problem
In a landmark paper, Goemans and Rothvoss (2020) established an XP algorithm running in time $\text{enc}(P)^{2^{O(d)}} \cdot \text{enc}(Q)^{O(1)}$ for the Cone and Polytope Intersection problem…Gap-free Differentially Private PCA for Gaussian Data
We give a gap-free $(ε,δ)$-differentially private algorithm for the principal component analysis (PCA) problem with Gaussian data.Pathwidth-One Vertex Explosion and Co-Path Problems
In the Bipartite One-sided Vertex Explosion problem (BOVE), the input is a bipartite graph $G = (T, B, E)$ and a nonnegative integer $k$.Tight Convergence Bounds for the Classical Kaczmarz Method
The classical method of Kaczmarz, introduced in 1937, is a textbook iterative method for solving linear systems $A x = b.$ Despite its widespread use, particularly in the context of solving inverse…The Tight Upper Bound on the Number of Distinct Squares in Circular Words
A square is a word $xx$, where $x$ is nonempty.A Deterministic Polynomial Kernel for Odd Cycle Transversal
We give a deterministic polynomial kernel for Odd Cycle Transversal, derandomizing the randomized kernel of Kratsch and Wahlström (TALG 2014).Parameterized Complexity of Spanner Problems with Independent Weights and Lengths
In this paper, the parameterized complexity of the multiplicative $α$-spanner problem with independent weights and lengths on undirected graphs is considered for the first time.A Faster Algorithm for Fewer Vertex-Disjoint Paths Parameterized by Treewidth
The $k$ vertex-disjoint paths problem asks whether, given a graph $G$ and $k$ pairs of vertices $(s_1,t_1)$, \ldots, $(s_k,t_k)$, $G$ has $k$ pairwise vertex-disjoint paths connecting $s_i$ and…Linear-Time FPT Algorithm for Surface Disjoint Paths via Surface Cutting
We study the \textsc{$k$-Disjoint Paths} problem on a graph embedded on a surface with bounded Euler genus.On Kernels and Leaves: Searching for Bare and Lush Trees
We study a variation of the classical Maximum (Minimum) Leaf Spanning Tree problem.A New Gap Sequence for Shellsort: RL-Driven Algorithm Discovery Beyond $N^{4/3}$
Choosing Shellsort gaps is a well-known open problem.From FPT to W[P]: Classifying Zero Forcing, Power Domination and Their Variants
Zero Forcing (ZF) and Power Dominating Set (PDS) mark vertices in a graph based on a common forcing process starting from a problem-specific set of initially marked vertices.