🏛️ The Data Structures & Algorithms Crypt
cs.DS: Where Data Structures & Algorithms papers rest without their code.
13016
Total Papers
12053
No Code
76
Twilight
887
Has Code
6.8%
Survival Rate
R.I.P.
👻
Ghosted
R.I.P.
👻
Ghosted
A Parameterized Perspective on Uniquely Restricted Matchings
R.I.P.
👻
Ghosted
Face-hitting dominating sets in planar graphs: Alternative proof and linear-time algorithm
R.I.P.
👻
Ghosted
A Gentle Wakeup Call: Symmetry Breaking with Less Collision Cost
R.I.P.
👻
Ghosted
Competitively Consistent Clustering
R.I.P.
👻
Ghosted
On Fixed-Parameter Tractability of Weighted 0-1 Timed Matching Problem on Temporal Graphs
R.I.P.
👻
Ghosted
Lower Bounds on Tree Covers
R.I.P.
👻
Ghosted
Output-Sparse Matrix Multiplication Using Compressed Sensing
R.I.P.
👻
Ghosted
Retroactive Monotonic Priority Queues via Range Searching
R.I.P.
👻
Ghosted
An improved local search based algorithm for $k^-$-star partition
R.I.P.
👻
Ghosted
Robust Scheduling on Uniform Machines -- New Results Using a Relaxed Approximation Guarantee
R.I.P.
👻
Ghosted
Sparsifying Sums of Positive Semidefinite Matrices
R.I.P.
👻
Ghosted
Optimizing Districting Plans to Maximize Majority-Minority Districts via IPs and Local Search
R.I.P.
👻
Ghosted
A near-linear time approximation scheme for $(k,\ell)$-median clustering under discrete Fréchet distance
R.I.P.
👻
Ghosted
Controlling tail risk in two-slope ski rental
R.I.P.
👻
Ghosted
Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair
R.I.P.
👻
Ghosted
A Tight Lower Bound for the Approximation Guarantee of Higher-Order Singular Value Decomposition
R.I.P.
👻
Ghosted
On the Parallel Complexity of Identifying Groups and Quasigroups via Decompositions
R.I.P.
👻
Ghosted
A Simple PTAS for Weighted $k$-means and Sensor Coverage
R.I.P.
👻
Ghosted
The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations
R.I.P.
👻
Ghosted
A Structural Linear-Time Algorithm for Computing the Tutte Decomposition
R.I.P.
👻
Ghosted
Debiasing Polynomial and Fourier Regression
R.I.P.
👻
Ghosted
An Improved Approximation Algorithm for the Capacitated Arc Routing Problem
R.I.P.
👻
Ghosted