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 8
Do Language Models Know Which Constraints Belong Together?
Dantzig-Wolfe reformulation strengthens the linear relaxation of a mixed-integer program by convexifying a chosen set of constraint families, and every candidate costs a column generation run.Flow-Optimal Separators for Minor-Free and Induced-Minor-Free Graphs in Linear Time via Follow the Regularized Leader
We give a new algorithm for finding balanced separators in minor-free and induced-minor-free graphs.A Sharp Additive Bound for the Threshold Rule in Repeated Rent-or-Buy
Motivated by context management in LLM agents, we study a repeated rent-or-buy model with schedule-independent history growth and a fixed reset price $K$, a discrete form of dynamic TCP…An Integrality-Gap Lower Bound of 1.2325 for Minimum Multiway Cut
We prove that the integrality gap of the Călinescu-Karloff-Rabani relaxation for Minimum Multiway Cut is at least $1.2325$ when the number of terminals is large.Efficient Proper Agnostic Learning of Halfspaces
We give a proper membership-query algorithm for agnostically learning halfspaces under the uniform distribution on $\{\pm1\}^n$.Submodularity Is Barely Testable
In 2010, Seshadhri and Vondrák asked: is submodularity testable?Generalized Flows over Time: Complexity, Structure and Algorithm
Generalized flows over time constitute a general network flow model that incorporates both transit times and flow losses or gains.Large independent sets via neighborhood block dynamics, Glauber dynamics, and local occupancy
Local occupancy can be used to bound the expected size of a hard-core independent set.Counting Feedback Vertex Sets of All Sizes in Subexponential Time, Conditionally
Assuming a Boolean tensor contraction hypothesis (Theorem D.1 of OpenAI's recent preprint refuting the Exponential Time Hypothesis), we study exact feedback vertex set counting in general graphs.Circuit Lower Bounds for Extended Gate Bases from Subexponential Counting
We study circuit lower bounds for extended gate bases using exact CNF counting and an extension-ring form of the contraction theorem of OpenAI.Fine-Grained Complexity Across the Computational Phase Transition
How does a computational problem transition from easy to hard?Sketching in Regression: Sketchy in Practice?
The Johnson-Lindenstrauss (JL) lemma and its extensions provide tools for solving the $L_2$ regression problem in high-dimensional settings with $n>d$, by transforming a subspace of $\mathbb{R}^{n}$…Hardness Results for Approximate Distance Labeling in Sparse Graphs
Distance labeling schemes assign short labels to the vertices of a graph so that distances between pairs of vertices can be recovered, exactly or approximately, from the two corresponding labels…Full-Rank Constructions of Explicit Lossless Expanders and Good Small-Set qLTCs
We construct explicit two-sided lossless expanders whose binary adjacency matrices have full rank, and use them to obtain explicit asymptotically good quantum LDPC codes whose specified X- and…Revisiting (Bijective) Burrows-Wheeler Transform Space-Time Trade-Off Constructions
The bijective Burrows-Wheeler transform (BBWT) replaces the delimiter of the ordinary BWT by a Lyndon factorization and sorts factor conjugates in $ω$-order.Worst-Case to Average-Case Reductions for Basic Linear Algebra
We study worst-case to average-case reductions for basic linear-algebraic problems over finite fields.Finding and Certifying Weighted Minimum Cuts with Cut Queries
We study the deterministic and nondeterministic cut query complexity of minimum cut in undirected graphs with arbitrary nonnegative edge weights.Faster Exact Algorithms for 3- and 4-Coloring: Deterministic Improvements and Further Randomized Speedups
We study exact exponential-time algorithms for 3- and 4-coloring.Asymptotically Optimal Weighted Edge Colorings via Local Bin Packing
We study weighted edge coloring, where each edge of a graph $G$ has a weight in $(0,1]$, and colors are assigned so that the incident weight of each color at every vertex is at most one.Optimal Sample Complexity for Max-Cut
We determine the optimal sample size for constructing value coresets for Max-Cut via uniform vertex sampling.