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 26
Jumbled Simon's Equivalence and Embeddings
\emph{Jumbled scattered factors} are a generalisation of scattered factors (or subsequences) where a jumbled scattered factor is obtained from another word by deleting and rearranging letters.Mining Correlated Motifs with Wildcards in PPI Networks: Exact and Optimal
A protein-protein interaction (PPI) network is a graph whose nodes are protein sequences and whose edges represent physical interactions between proteins.Exact power indices for plurality-voting ensembles
Plurality-voting ensembles aggregate the predictions of multiple base classifiers and output the most voted class, with ties typically broken at random.Inclusion-wise extremal knapsack problems are (mostly) hard to approximate
We study two inclusion-wise extremal variants of the 0-1 Knapsack Problem (KP).On the Parameterized Complexity of Capacitated Stack and Queue Layouts with Colored Edges
Stack and queue layouts are two extensively studied and complementary linear representations of graphs.A Better-than-2 Approximation for k-Median Part I: The Power of General Bids
The Greedy algorithm of Jain, Mahdian, Markakis, Saberi, and Vazirani was the best Lagrangian-multiplier-preserving (LMP) approximation algorithm for facility location, and thus the engine behind…No Truly Sublogarithmic-Round Algorithm for Distributed MIS in the LOCAL Model
We prove that $o(\frac{\log n}{\log\log n})$-round randomized LOCAL algorithms find a maximal independent set (MIS) with subconstant probability on some input.The Complexity of Hamiltonian Cycles and Paths with Prescribed Walk Lengths
Fix a set $S$ of positive integers.A Practical Combinatorial Interior Point Method for Minimum-Cost Flow
In a recent breakthrough, Chen, Kyng, Liu, Peng, Probst Gutenberg, and Sachdeva (arXiv:2203.00671) designed the first almost-linear-time algorithm for minimum-cost flow.A Deterministic Near-Linear Time Approximation Algorithm for Restricted Shortest Paths in Directed Graphs
In the restricted shortest paths problem, we are given an $n$-vertex $m$-edge directed graph $G$ whose edges are assigned two non-negative weights (or resources) called lengths and costs, a source…Almost Optimal Relative Error Streaming Quantiles with Full Mergeability
Quantile summaries provide a scalable way to estimate the distribution of individual attributes in large datasets that are often distributed across multiple machines or generated by sensor networks.Solving SAT via Treewidth Backdoors in Linear Time: Beyond Sparsity
The Boolean Satisfiability (SAT) problem is a remarkably expressive computational problem, serving both as a cornerstone of complexity theory and as a unifying language for a wide range of search…Subgaussian Vector Balancing by an Ising Model
We show that the guaranties of the Gram-Schmidt Walk Algorithm of Bansal, Dadush, Garg, and Lovett can be achieved by an Ising model.A Randomized Approximation Algorithm for Doubly Free-Boundary Macdonald Processes
We construct an approximate sampler for finite doubly free-boundary Macdonald rail-yard processes with Macdonald, boundary, and edge parameters in $(0,1)$.Sublinear-Time and Semi-Streaming Algorithms for Path Cover and TSP
We give improved sublinear-time and semi-streaming approximation algorithms for maximum path cover, $(1,2)$-TSP, and Max-TSP.Semi-Streaming Estimation of the Held--Karp Bound and Graph-Metric TSP Cost
The Held--Karp bound is a linear-programming lower bound for the metric traveling salesperson problem (TSP).Exploring Minimal Blocking Sets for Kernelization Lower Bounds for $\mathcal{F}$-Minor Deletion
For Vertex Cover, a minimal blocking set of a graph $G$ is an inclusion-wise minimal vertex set contained in no minimum vertex cover of $G$.Optimal Support Size Testing
We present an optimal tester for support size that determines whether an unknown probability distribution is supported on $n$ elements or $\varepsilon$-far away (in total variation distance) with…Selecting the 7th Smallest of 16 Elements Takes Exactly 28 Comparisons
Let $V_i(n)$ denote the minimum worst-case number of comparisons needed to find the $i$-th smallest of $n$ distinct elements.Two Holes Make a Difference: Deterministic Paging with Delay and Deadlines
In this paper, we study online paging with delay or deadlines.