R.I.P.
👻
Ghosted
🏛️ The Data Structures & Algorithms Crypt
cs.DS: Where Data Structures & Algorithms papers rest without their code.
12794
Total Papers
12053
No Code
76
Twilight
665
Has Code
5.2%
Survival Rate
R.I.P.
👻
Ghosted
Simulating Random Walks on Graphs in the Streaming Model
R.I.P.
👻
Ghosted
Tunneling on Wheeler Graphs
R.I.P.
👻
Ghosted
Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability
R.I.P.
👻
Ghosted
Xorshift1024*, Xorshift1024+, Xorshift128+ and Xoroshiro128+ Fail Statistical Tests for Linearity
R.I.P.
👻
Ghosted
Dynamic Resource Allocation in the Cloud with Near-Optimal Efficiency
R.I.P.
👻
Ghosted
The Online $k$-Taxi Problem
R.I.P.
👻
Ghosted
Near-Optimal Distance Emulator for Planar Graphs
R.I.P.
👻
Ghosted
Zip Trees
🌅
🌅
Old Age
copMEM: Finding maximal exact matches via sampling both genomes
R.I.P.
👻
Ghosted
Subset Feedback Vertex Set on Graphs of Bounded Independent Set Size
R.I.P.
👻
Ghosted
On the Parameterized Complexity of Graph Modification to First-Order Logic Properties
R.I.P.
👻
Ghosted
Restricted Max-Min Fair Allocation
R.I.P.
👻
Ghosted
A time- and space-optimal algorithm for the many-visits TSP
R.I.P.
👻
Ghosted
A 3/2-approximation algorithm for the Student-Project Allocation problem
R.I.P.
👻
Ghosted
A PTAS for subset TSP in minor-free graphs
R.I.P.
👻
Ghosted
Optimal Distributed Coloring Algorithms for Planar Graphs in the LOCAL model
R.I.P.
👻
Ghosted
Reconfiguring spanning and induced subgraphs
R.I.P.
👻
Ghosted
Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity
R.I.P.
👻
Ghosted
Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with Strongly Sublinear Memory
R.I.P.
👻
Ghosted
On Counting Perfect Matchings in General Graphs
R.I.P.
👻
Ghosted
Gene tree reconciliation including transfers with replacement is hard and FPT
R.I.P.
👻
Ghosted
On Low-Risk Heavy Hitters and Sparse Recovery Schemes
R.I.P.
👻
Ghosted