💀 The Wall of Shame

The most cited papers with no code. Sorted by the weight of their sins.

Page 5, showing 50 papers

# Paper Cause of Death Category Citations Published
201 On the Configuration-LP of the Restricted Assignment Problem
Klaus Jansen, Lars Rohwedder
👻 Ghosted cs.DS 33 9 years ago
202 Online Edge Coloring Algorithms via the Nibble Method
Sayan Bhattacharya, Fabrizio Grandoni, David Wajc
👻 Ghosted cs.DS 32 5 years ago
203 Approximate Maximum Matching in Random Streams
Alireza Farhadi, MohammadTaghi Hajiaghayi, ... (+3 more)
👻 Ghosted cs.DS 32 6 years ago
204 Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)
Rajesh Chitnis, Andreas Emil Feldmann, ... (+2 more)
👻 Ghosted cs.DS 32 6 years ago
205 Truly Subcubic Min-Plus Product for Less Structured Matrices, with Applications
Virginia Vassilevska Williams, Yinzhan Xu
👻 Ghosted cs.DS 32 6 years ago
206 Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs
Maria Chudnovsky, Marcin Pilipczuk, ... (+2 more)
👻 Ghosted cs.DS 32 7 years ago
207 Average Sensitivity of Graph Algorithms
Nithin Varma, Yuichi Yoshida
👻 Ghosted cs.DS 32 7 years ago
208 Towards Instance-Optimal Private Query Release
Jaroslaw Blasiok, Mark Bun, ... (+2 more)
👻 Ghosted cs.DS 32 7 years ago
209 A Nearly-Linear Bound for Chasing Nested Convex Bodies
C. J. Argue, Sébastien Bubeck, ... (+3 more)
👻 Ghosted cs.DS 32 8 years ago
210 Online Submodular Maximization with Free Disposal: Randomization Beats 0.25 for Partition Matroids
T-H. Hubert Chan, Zhiyi Huang, ... (+3 more)
🔮 The Ethereal cs.DM 32 9 years ago
211 Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds
Eden Chlamtáč, Michael Dinitz, ... (+2 more)
👻 Ghosted cs.DS 32 10 years ago
212 Independence and Efficient Domination on $P_6$-free Graphs
Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen
👻 Ghosted cs.DS 32 11 years ago
213 Streaming Submodular Matching Meets the Primal-Dual Method
Roie Levin, David Wajc
👻 Ghosted cs.DS 31 5 years ago
214 Strong Algorithms for the Ordinal Matroid Secretary Problem
José A. Soto, Abner Turkieltaub, Victor Verdugo
👻 Ghosted cs.DS 31 8 years ago
215 Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing
Gábor Ivanyos, Youming Qiao
👻 Ghosted cs.DS 31 8 years ago
216 Reachability Preservers: New Extremal Bounds and Approximation Algorithms
Amir Abboud, Greg Bodwin
👻 Ghosted cs.DS 31 8 years ago
217 Find Your Place: Simple Distributed Algorithms for Community Detection
Luca Becchetti, Andrea Clementi, ... (+3 more)
👻 Ghosted cs.DC 31 10 years ago
218 Simpler, faster and shorter labels for distances in graphs
Stephen Alstrup, Cyril Gavoille, ... (+2 more)
👻 Ghosted cs.DS 31 11 years ago
219 Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization
Mohsen Ghaffari, Christoph Grunau, ... (+3 more)
👻 Ghosted cs.DS 31 3 years ago
220 Approximating LCS in Linear Time: Beating the $\sqrt{n}$ Barrier
MohammadTaghi Hajiaghayi, Masoud Seddighin, ... (+2 more)
👻 Ghosted cs.DS 30 6 years ago
221 Induced subgraphs of bounded treewidth and the container method
Tara Abrishami, Maria Chudnovsky, ... (+3 more)
👻 Ghosted cs.DS 30 6 years ago
222 Fine-grained hardness of CVP(P) -- Everything that we can prove (and nothing else)
Divesh Aggarwal, Huck Bennett, ... (+2 more)
🔮 The Ethereal cs.CC 30 6 years ago
223 Fully Dynamic Matching: Beating 2-Approximation in $Δ^ε$ Update Time
Soheil Behnezhad, Jakub Łącki, Vahab Mirrokni
👻 Ghosted cs.DS 30 6 years ago
224 Faster p-norm minimizing flows, via smoothed q-norm problems
Deeksha Adil, Sushant Sachdeva
👻 Ghosted cs.DS 30 6 years ago
225 Near-optimal Approximate Discrete and Continuous Submodular Function Minimization
Brian Axelrod, Yang P. Liu, Aaron Sidford
👻 Ghosted cs.DS 30 6 years ago
226 A Tale of Santa Claus, Hypergraphs and Matroids
Sami Davies, Thomas Rothvoss, Yihao Zhang
👻 Ghosted cs.DS 30 8 years ago
227 Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion
Akanksha Agrawal, Daniel Lokshtanov, ... (+3 more)
👻 Ghosted cs.DS 30 9 years ago
228 Learning-Augmented Weighted Paging
Nikhil Bansal, Christian Coester, ... (+3 more)
👻 Ghosted cs.DS 29 5 years ago
229 List Decoding of Direct Sum Codes
Vedat Levi Alev, Fernando Granha Jeronimo, ... (+3 more)
👻 Ghosted cs.DS 29 5 years ago
230 On Near-Linear-Time Algorithms for Dense Subset Sum
Karl Bringmann, Philip Wellnitz
👻 Ghosted cs.DS 29 5 years ago
231 Counting Small Permutation Patterns
Chaim Even-Zohar, Calvin Leng
👻 Ghosted cs.DS 29 6 years ago
232 Individual Sensitivity Preprocessing for Data Privacy
Rachel Cummings, David Durfee
👻 Ghosted cs.DS 29 8 years ago
233 Algorithmic Complexity of Power Law Networks
Paweł Brach, Marek Cygan, ... (+2 more)
👻 Ghosted cs.DS 29 11 years ago
234 Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond
Salwa Faour, Mohsen Ghaffari, ... (+3 more)
👻 Ghosted cs.DS 29 3 years ago
235 Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time
Sayan Bhattacharya, Peter Kiss, ... (+2 more)
👻 Ghosted cs.DS 29 4 years ago
236 Optimal Fully Dynamic $k$-Center Clustering for Adaptive and Oblivious Adversaries
MohammadHossein Bateni, Hossein Esfandiari, ... (+5 more)
👻 Ghosted cs.DS 28 3 years ago
237 New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners
Thiago Bergamaschi, Monika Henzinger, ... (+3 more)
👻 Ghosted cs.DS 28 5 years ago
238 Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier
Sepehr Assadi, Thomas Kesselheim, Sahil Singla
👻 Ghosted cs.GT 28 5 years ago
239 On Approximability of Clustering Problems Without Candidate Centers
Vincent Cohen-Addad, Karthik C. S., Euiwoong Lee
🔮 The Ethereal cs.CC 28 5 years ago
240 Polynomial-time trace reconstruction in the smoothed complexity model
Xi Chen, Anindya De, ... (+3 more)
👻 Ghosted cs.DS 28 5 years ago
241 Graph Spanners by Sketching in Dynamic Streams and the Simultaneous Communication Model
Arnold Filtser, Michael Kapralov, Navid Nouri
👻 Ghosted cs.DS 28 5 years ago
242 Assignment Mechanisms under Distributional Constraints
Itai Ashlagi, Amin Saberi, Ali Shameli
👻 Ghosted cs.DS 28 7 years ago
243 The streaming $k$-mismatch problem
Raphaël Clifford, Tomasz Kociumaka, Ely Porat
👻 Ghosted cs.DS 28 8 years ago
244 Non interactive simulation of correlated distributions is decidable
Anindya De, Elchanan Mossel, Joe Neeman
🔮 The Ethereal cs.CC 28 9 years ago
245 Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners
Jakub Pachocki, Liam Roditty, ... (+3 more)
👻 Ghosted cs.DS 28 9 years ago
246 Online and Random-order Load Balancing Simultaneously
Marco Molinaro
👻 Ghosted cs.DS 28 9 years ago
247 On the switch Markov chain for perfect matchings
Martin Dyer, Mark Jerrum, Haiko Müller
👻 Ghosted cs.DS 28 11 years ago
248 Dynamic Algorithms for Maximum Matching Size
Soheil Behnezhad
👻 Ghosted cs.DS 28 4 years ago
249 Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications
Sebastian Forster, Gramoz Goranci, Monika Henzinger
👻 Ghosted cs.DS 27 6 years ago
250 Local Statistics, Semidefinite Programming, and Community Detection
Jess Banks, Sidhanth Mohanty, Prasad Raghavendra
👻 Ghosted cs.DS 27 6 years ago