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 23
Approximating the Girth of an Undirected, Weighted Graph for Larger Approximation Factors
The girth of a weighted undirected graph is defined as the length of a shortest cycle in the graph.Dynamic Load Balancing under Restricting Updates
We study the problem of load balancing in the dynamic setting.Polytope Sampling at the Speed of Isoperimetry
We give faster algorithms for sampling from the uniform distribution over a polytope.Rapid mixing within a phase for Ising models
We study Glauber dynamics for Ising measures conditioned to have a sufficiently large majority of $+1$ spins.Online Graph Coloring with Random Arrivals
We study online graph coloring in the random-arrival model, where the vertices are presented in a uniformly random order.Constant-Factor Local Approximation for Bipartite Densest Subgraph
Given a vertex $v$ in a large bipartite graph $G$, can one quickly find a small densely connected region near $v$?Budgeted Bayesian Bandits for Future Utilization
The multi-armed bandit problem models the trade-off between exploration and exploitation.Implicit Hitting Set Enumeration for Power Dominating Sets
The Transversal Hypergraph problem asks to enumerate (list) all inclusion-minimal hitting sets of a hypergraph.Batch range mode in O(n+Q)^1.395
We give a deterministic worst-case algorithm for exact Batched Range Mode on an arbitrary array of length n and a batch of Q intervals.Vertex Ordering for Exact Triangle Listing: Concave Geometry and Certified Rounding
Exact forward triangle listers orient each edge of a graph by a vertex order.Efficient Agnostic Learning of Univariate Densities Under Local Differential Privacy
We propose a general framework for non-interactive locally differentially private (LDP) learning of structured univariate distributions that can be approximated by piece-wise polynomials.A 0.4584-approximation for DR-submodular maximization over down-closed convex sets
We obtain a $0.4584$-approximation for nonnegative, non-monotone, $L$-smooth DR-submodular maximization over compact convex down-closed subsets of the unit cube, improving the $4/9\approx0.4444$…A General Framework for Matching with Delays
We present a simple deterministic $O(\log n)$-competitive algorithm for the online minimum-cost perfect matching with delays (MPMD) problem on arbitrary, unknown metric spaces, where $n$ is the…Testing Connectedness and Edge Connectedness
We revisit the classical problem of testing connectedness of graphs represented in the adjacency lists model and obtain optimal bounds.Geometric Hashing in MPC with Applications to Clustering and Stochastic Embeddings
In this paper we study consistent hashing (a.k.a. sparse partitions) for doubling metrics in the Massively Parallel Computation (MPC) model.Decoding Failure Biases IBLT Count Measurements: A Gaussian-Selection Law at the Peeling Threshold
In a self-sizing set-reconciliation protocol, a small first-round Invertible Bloom Lookup Table (IBLT) sketch attempts peeling decoding; after failure, the protocol estimates the difference count…Incremental Exact Vertex Connectivity
We study the problem of maintaining the vertex connectivity $κ$ of a graph under edge insertions.Restless Guards: Robust Guarding of Polyominoes
The art gallery problem is a fundamental problem whose practical applications have inspired numerous variants.Preprocessed 3SUM: From Reals to Integers
The Preprocessed 3SUM problem asks to preprocess a set $A$ of $n$ numbers so that we can quickly decide whether a query subset $A' \subseteq A$ contains a solution $a+b=c$.Parameterized Complexity of Isometric Path Cover: Treewidth and Diameter
We study the fixed-parameter tractability of the \textsc{Isometric Path Cover} problem where, given an integer $k$ and a simple, undirected, and unweighted graph $G$, the objective is to decide…