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 48
The Inverse Lyndon Array
The Lyndon array stores, at each position of a word, the length of the longest Lyndon factor starting at that position and plays an important role in combinatorics on words, for example, in the…An Arboricity-Sensitive Algorithm for the $K_r-e$-Free Graph Sandwich Problem
For a fixed integer $r\geq4$, the $K_r-e$-free graph sandwich problem asks whether, given graphs $G_1\subseteq G_2$ on the same vertex set, there is an induced-$K_r-e$-free graph $H$ between them.Single-Pass Estimation of the Clustering Coefficient Distribution in Graph Streams
Triangle counting is one of the most fundamental problems in network analysis.Vector Balancing in Polynomial Time
We present a spectral signing algorithm solving the Komlós problem with a constant discrepancy in polynomial time.Budget-Independent Influence Maximization in Nearly Linear Time
Influence maximization asks for $k$ seed vertices that maximize the expected spread of a diffusion process in a network.A Polynomial Kernel for Planar Directed Feedback Vertex Set
The Directed Feedback Vertex Set problem (DFVS) asks whether a digraph can be made acyclic by deleting at most $k$ vertices.A general counting and sampling Lovász local lemma
Consider a constraint satisfaction problem $\mathbf{C}$ on finitely many independent random variables with dependency graph $G$.Smoothed Analysis of Inconsistent A*
The A* search is a fundamental path-finding algorithm in artificial intelligence.A Fixed-Parameter Algorithm for 4-Block Integer Programming
We give a fixed parameter tractable (FPT) algorithm with running time $f(k,Δ)\cdot {|I|}^{O(1)}$ for integer linear programs with 4-block structure, parameterized by the maximum block dimension $k$…A Simpler and Faster Min-Cost Flow Solver via Min-Ratio Cycles from Distance Oracles
The first almost-linear time maximum and minimum cost flow algorithm of Chen-Kyng-Liu-Peng-Probst Gutenberg-Sachdeva (FOCS 2022), reduced these flow objectives to a sequence of min-ratio cycle…Kadison--Singer partitions and Bilu--Linial graph signings in polynomial time
We prove two main algorithmic results in spectral discrepancy.Optimal Analysis of Greedy for Stochastic Online Euclidean Matching
We study Greedy for online metric matching with $n$ servers and $n$ requests sampled independently and uniformly from $[0,1]^d$.Stable Regularity Lemmas: Efficient Algorithms and Essentially Tight Littlestone Bounds
In this paper, we determine the precise asymptotics of the number of parts of stable regularity equipartitions in terms of the Littlestone dimension: every graph $G$ of Littlestone dimension…Algorithmic Collusion and the Complexity of Information-Value-Free Equilibria
A (coarse) correlated equilibrium (CE) is information-value-free (IVF) if a player can match the payoff obtained from recommendations by committing to a fixed action.Union-Find with Constant-Time Deletions Across the Optimal Worst-Case Tradeoff
We consider union-find with deletions, where the representation and the cost of a query must depend on the current number of live elements rather than on the number of elements ever created.Local Representatives and Shortest Completions for Next-to-Shortest Paths in Directed Graphs
Given a directed graph with positive edge weights and two vertices s,t, a next-to-shortest s-t path is a shortest simple s-t path among those whose length is strictly larger than the shortest-path…Moving Geometric Objects to Render Their Intersection Graph Connected or Locally Dense
In this paper, we study graph editing problems on geometric intersection graphs.Busy Time Minimization with Preemption, Migration, and One Resource Requirement
We study the Busy Machine Time with Preemption and Migration and One Resource Requirement problem, motivated by energy minimization in cloud data centers.Succinct Representation of Search Trees on Trees
A search tree on trees (STT) is a data structure for performing a search for a target vertex in a reference tree.The Complexity of Computing Class Probabilities in BID Probabilistic Databases
We study the problem of computing class probabilities in block-independent disjoint (BID) probabilistic databases.