💀 The Wall of Shame

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

Page 4, showing 50 papers

# Paper Cause of Death Category Citations Published
151 Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee
Shivam Garg, Geevarghese Philip
👻 Ghosted cs.DS 39 10 years ago
152 A faster subquadratic algorithm for finding outlier correlations
Matti Karppa, Petteri Kaski, Jukka Kohonen
👻 Ghosted cs.DS 39 10 years ago
153 Core congestion is inherent in hyperbolic networks
Victor Chepoi, Feodor F. Dragan, Yann Vaxès
👻 Ghosted cs.DS 39 10 years ago
154 $O(\mbox{depth})$-Competitive Algorithm for Online Multi-level Aggregation
Niv Buchbinder, Moran Feldman, ... (+2 more)
👻 Ghosted cs.DS 39 9 years ago
155 On the Performance of Reed-Muller Codes with respect to Random Errors and Erasures
Ori Sberlo, Amir Shpilka
👻 Ghosted cs.IT 39 7 years ago
156 Local Search for Max-Sum Diversification
Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen
👻 Ghosted cs.DS 38 9 years ago
157 Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons
Adrian Kosowski, Laurent Viennot
👻 Ghosted cs.DS 38 9 years ago
158 Lower Bounds for Oblivious Data Structures
Riko Jacob, Kasper Green Larsen, Jesper Buus Nielsen
👻 Ghosted cs.DS 38 7 years ago
159 Covering a tree with rooted subtrees
Lin Chen, Daniel Marx
👻 Ghosted cs.DS 38 7 years ago
160 The Two-Sided Game of Googol and Sample-Based Prophet Inequalities
José Correa, Andrés Cristi, ... (+2 more)
👻 Ghosted cs.DS 38 6 years ago
161 Competitive analysis of the top-K ranking problem
Xi Chen, Sivakanth Gopi, ... (+2 more)
👻 Ghosted cs.DS 37 10 years ago
162 Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism
Eric Blais, Clément L. Canonne, ... (+3 more)
👻 Ghosted cs.DS 37 9 years ago
163 Lopsidependency in the Moser-Tardos framework: Beyond the Lopsided Lovasz Local Lemma
David G. Harris
👻 Ghosted cs.DS 37 9 years ago
164 Optimal Vertex Fault Tolerant Spanners (for fixed stretch)
Greg Bodwin, Michael Dinitz, ... (+2 more)
👻 Ghosted cs.DS 37 8 years ago
165 Faster Deterministic Distributed Coloring Through Recursive List Coloring
Fabian Kuhn
👻 Ghosted cs.DS 37 6 years ago
166 Sparse Approximation via Generating Point Sets
Avrim Blum, Sariel Har-Peled, Benjamin Raichel
👻 Ghosted cs.CG 36 10 years ago
167 Adaptive Hierarchical Clustering Using Ordinal Queries
Ehsan Emamjomeh-Zadeh, David Kempe
👻 Ghosted cs.DS 36 8 years ago
168 A Subquadratic Approximation Scheme for Partition
Marcin Mucha, Karol Węgrzycki, Michał Włodarczyk
👻 Ghosted cs.DS 36 8 years ago
169 Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds
Maximilian Probst Gutenberg, Christian Wulff-Nilsen
👻 Ghosted cs.DS 36 6 years ago
170 Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler
Maximilian Probst Gutenberg, Christian Wulff-Nilsen
👻 Ghosted cs.DS 36 6 years ago
171 A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for General Graphs
Michael Elkin, Seth Pettie
👻 Ghosted cs.DS 35 10 years ago
172 Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting
Robert Ganian, M. S. Ramanujan, Stefan Szeider
👻 Ghosted cs.DS 35 10 years ago
173 Connectivity Oracles for Graphs Subject to Vertex Failures
Ran Duan, Seth Pettie
👻 Ghosted cs.DS 35 9 years ago
174 A Fast Approximation Scheme for Low-Dimensional $k$-Means
Vincent Cohen-Addad
👻 Ghosted cs.DS 35 8 years ago
175 An FPT Algorithm Beating 2-Approximation for $k$-Cut
Anupam Gupta, Euiwoong Lee, Jason Li
👻 Ghosted cs.DS 35 8 years ago
176 Counting independent sets in unbalanced bipartite graphs
Sarah Cannon, Will Perkins
👻 Ghosted cs.DS 35 7 years ago
177 The Communication Complexity of Optimization
Santosh S. Vempala, Ruosong Wang, David P. Woodruff
👻 Ghosted cs.DS 35 6 years ago
178 Shorter Labeling Schemes for Planar Graphs
Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk
👻 Ghosted cs.DS 35 6 years ago
179 Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform
Mahdi Cheraghchi, Piotr Indyk
👻 Ghosted cs.IT 34 11 years ago
180 Locally Consistent Parsing for Text Indexing in Small Space
Or Birenzwige, Shay Golan, Ely Porat
👻 Ghosted cs.DS 34 7 years ago
181 Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds
David Durfee, Laxman Dhulipala, ... (+4 more)
👻 Ghosted cs.DS 34 6 years ago
182 Shortest Paths in a Hybrid Network Model
John Augustine, Kristian Hinnenthal, ... (+3 more)
👻 Ghosted cs.DC 34 6 years ago
183 Efficient Linear and Affine Codes for Correcting Insertions/Deletions
Kuan Cheng, Venkatesan Guruswami, ... (+2 more)
👻 Ghosted cs.IT 34 5 years ago
184 Semi-Streaming Bipartite Matching in Fewer Passes and Optimal Space
Sepehr Assadi, Arun Jambulapati, ... (+3 more)
👻 Ghosted cs.DS 34 5 years ago
185 The Secretary Problem with Independent Sampling
José Correa, Andrés Cristi, ... (+3 more)
👻 Ghosted cs.GT 34 5 years ago
186 On the Configuration-LP of the Restricted Assignment Problem
Klaus Jansen, Lars Rohwedder
👻 Ghosted cs.DS 33 9 years ago
187 Minor-matching hypertree width
Nikola Yolov
👻 Ghosted cs.DS 33 9 years ago
188 Approximately counting and sampling small witnesses using a colourful decision oracle
Holger Dell, John Lapinskas, Kitty Meeks
👻 Ghosted cs.DS 33 6 years ago
189 Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition
Julia Chuzhoy, Thatchaphol Saranurak
👻 Ghosted cs.DS 33 5 years ago
190 Independence and Efficient Domination on $P_6$-free Graphs
Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen
👻 Ghosted cs.DS 32 10 years ago
191 Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds
Eden Chlamtáč, Michael Dinitz, ... (+2 more)
👻 Ghosted cs.DS 32 9 years ago
192 A Nearly-Linear Bound for Chasing Nested Convex Bodies
C. J. Argue, Sébastien Bubeck, ... (+3 more)
👻 Ghosted cs.DS 32 7 years ago
193 Towards Instance-Optimal Private Query Release
Jaroslaw Blasiok, Mark Bun, ... (+2 more)
👻 Ghosted cs.DS 32 7 years ago
194 Average Sensitivity of Graph Algorithms
Nithin Varma, Yuichi Yoshida
👻 Ghosted cs.DS 32 7 years ago
195 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 6 years ago
196 Truly Subcubic Min-Plus Product for Less Structured Matrices, with Applications
Virginia Vassilevska Williams, Yinzhan Xu
👻 Ghosted cs.DS 32 6 years ago
197 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
198 Approximate Maximum Matching in Random Streams
Alireza Farhadi, MohammadTaghi Hajiaghayi, ... (+3 more)
👻 Ghosted cs.DS 32 6 years ago
199 Online Edge Coloring Algorithms via the Nibble Method
Sayan Bhattacharya, Fabrizio Grandoni, David Wajc
👻 Ghosted cs.DS 32 5 years ago
200 Simpler, faster and shorter labels for distances in graphs
Stephen Alstrup, Cyril Gavoille, ... (+2 more)
👻 Ghosted cs.DS 31 11 years ago