💀 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 Find Your Place: Simple Distributed Algorithms for Community Detection
Luca Becchetti, Andrea Clementi, ... (+3 more)
👻 Ghosted cs.DC 31 10 years ago
202 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
203 Reachability Preservers: New Extremal Bounds and Approximation Algorithms
Amir Abboud, Greg Bodwin
👻 Ghosted cs.DS 31 8 years ago
204 Strong Algorithms for the Ordinal Matroid Secretary Problem
José A. Soto, Abner Turkieltaub, Victor Verdugo
👻 Ghosted cs.DS 31 8 years ago
205 Streaming Submodular Matching Meets the Primal-Dual Method
Roie Levin, David Wajc
👻 Ghosted cs.DS 31 5 years ago
206 Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization
Mohsen Ghaffari, Christoph Grunau, ... (+3 more)
👻 Ghosted cs.DS 31 3 years ago
207 Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion
Akanksha Agrawal, Daniel Lokshtanov, ... (+3 more)
👻 Ghosted cs.DS 30 8 years ago
208 A Tale of Santa Claus, Hypergraphs and Matroids
Sami Davies, Thomas Rothvoss, Yihao Zhang
👻 Ghosted cs.DS 30 7 years ago
209 Near-optimal Approximate Discrete and Continuous Submodular Function Minimization
Brian Axelrod, Yang P. Liu, Aaron Sidford
👻 Ghosted cs.DS 30 6 years ago
210 Faster p-norm minimizing flows, via smoothed q-norm problems
Deeksha Adil, Sushant Sachdeva
👻 Ghosted cs.DS 30 6 years ago
211 Fully Dynamic Matching: Beating 2-Approximation in $Δ^ε$ Update Time
Soheil Behnezhad, Jakub Łącki, Vahab Mirrokni
👻 Ghosted cs.DS 30 6 years ago
212 Induced subgraphs of bounded treewidth and the container method
Tara Abrishami, Maria Chudnovsky, ... (+3 more)
👻 Ghosted cs.DS 30 6 years ago
213 Approximating LCS in Linear Time: Beating the $\sqrt{n}$ Barrier
MohammadTaghi Hajiaghayi, Masoud Seddighin, ... (+2 more)
👻 Ghosted cs.DS 30 6 years ago
214 Algorithmic Complexity of Power Law Networks
Paweł Brach, Marek Cygan, ... (+2 more)
👻 Ghosted cs.DS 29 10 years ago
215 Individual Sensitivity Preprocessing for Data Privacy
Rachel Cummings, David Durfee
👻 Ghosted cs.DS 29 8 years ago
216 Counting Small Permutation Patterns
Chaim Even-Zohar, Calvin Leng
👻 Ghosted cs.DS 29 6 years ago
217 On Near-Linear-Time Algorithms for Dense Subset Sum
Karl Bringmann, Philip Wellnitz
👻 Ghosted cs.DS 29 5 years ago
218 List Decoding of Direct Sum Codes
Vedat Levi Alev, Fernando Granha Jeronimo, ... (+3 more)
👻 Ghosted cs.DS 29 5 years ago
219 Learning-Augmented Weighted Paging
Nikhil Bansal, Christian Coester, ... (+3 more)
👻 Ghosted cs.DS 29 5 years ago
220 Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time
Sayan Bhattacharya, Peter Kiss, ... (+2 more)
👻 Ghosted cs.DS 29 3 years ago
221 Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond
Salwa Faour, Mohsen Ghaffari, ... (+3 more)
👻 Ghosted cs.DS 29 3 years ago
222 On the switch Markov chain for perfect matchings
Martin Dyer, Mark Jerrum, Haiko Müller
👻 Ghosted cs.DS 28 11 years ago
223 Online and Random-order Load Balancing Simultaneously
Marco Molinaro
👻 Ghosted cs.DS 28 9 years ago
224 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
225 The streaming $k$-mismatch problem
Raphaël Clifford, Tomasz Kociumaka, Ely Porat
👻 Ghosted cs.DS 28 8 years ago
226 Assignment Mechanisms under Distributional Constraints
Itai Ashlagi, Amin Saberi, Ali Shameli
👻 Ghosted cs.DS 28 7 years ago
227 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
228 Polynomial-time trace reconstruction in the smoothed complexity model
Xi Chen, Anindya De, ... (+3 more)
👻 Ghosted cs.DS 28 5 years ago
229 Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier
Sepehr Assadi, Thomas Kesselheim, Sahil Singla
👻 Ghosted cs.GT 28 5 years ago
230 New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners
Thiago Bergamaschi, Monika Henzinger, ... (+3 more)
👻 Ghosted cs.DS 28 5 years ago
231 Dynamic Algorithms for Maximum Matching Size
Soheil Behnezhad
👻 Ghosted cs.DS 28 3 years ago
232 Optimal Fully Dynamic $k$-Center Clustering for Adaptive and Oblivious Adversaries
MohammadHossein Bateni, Hossein Esfandiari, ... (+5 more)
👻 Ghosted cs.DS 28 3 years ago
233 Computing minimum cuts in hypergraphs
Chandra Chekuri, Chao Xu
👻 Ghosted cs.DS 27 9 years ago
234 A Framework for Analyzing Resparsification Algorithms
Rasmus Kyng, Jakub Pachocki, ... (+2 more)
👻 Ghosted cs.DS 27 9 years ago
235 Steiner Point Removal with Distortion $O(\log k)$
Arnold Filtser
👻 Ghosted cs.DS 27 8 years ago
236 Dynamic Bridge-Finding in $\tilde{O}(\log ^2 n)$ Amortized Time
Jacob Holm, Eva Rotenberg, Mikkel Thorup
👻 Ghosted cs.DS 27 8 years ago
237 Recognizing Weak Embeddings of Graphs
Hugo A. Akitaya, Radoslav Fulek, Csaba D. Tóth
👻 Ghosted cs.CG 27 8 years ago
238 Losing Treewidth by Separating Subsets
Anupam Gupta, Euiwoong Lee, ... (+3 more)
👻 Ghosted cs.DS 27 8 years ago
239 Fast Modular Subset Sum using Linear Sketching
Kyriakos Axiotis, Arturs Backurs, Christos Tzamos
👻 Ghosted cs.DS 27 7 years ago
240 $k$-Servers with a Smile: Online Algorithms via Projections
Niv Buchbinder, Anupam Gupta, ... (+3 more)
👻 Ghosted cs.DS 27 7 years ago
241 New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs
Amir Abboud, Robert Krauthgamer, Ohad Trabelsi
👻 Ghosted cs.DS 27 7 years ago
242 Reducing approximate Longest Common Subsequence to approximate Edit Distance
Aviad Rubinstein, Zhao Song
👻 Ghosted cs.DS 27 7 years ago
243 Hitting minors on bounded treewidth graphs. IV. An optimal algorithm
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
👻 Ghosted cs.DS 27 6 years ago
244 Analysis of Ward's Method
Anna Großwendt, Heiko Röglin, Melanie Schmidt
👻 Ghosted cs.DS 27 6 years ago
245 Local Statistics, Semidefinite Programming, and Community Detection
Jess Banks, Sidhanth Mohanty, Prasad Raghavendra
👻 Ghosted cs.DS 27 6 years ago
246 Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications
Sebastian Forster, Gramoz Goranci, Monika Henzinger
👻 Ghosted cs.DS 27 6 years ago
247 Pricing Online Decisions: Beyond Auctions
Ilan Reuven Cohen, Alon Eden, ... (+2 more)
👻 Ghosted cs.GT 26 11 years ago
248 Building a Good Team: Secretary Problems and the Supermodular Degree
Moran Feldman, Rani Izsak
👻 Ghosted cs.DS 26 10 years ago
249 Approximate Distance Oracles for Planar Graphs with Improved Query Time-Space Tradeoff
Christian Wulff-Nilsen
👻 Ghosted cs.DS 26 10 years ago
250 A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank
Radu Curticapean, Nathan Lindzey, Jesper Nederlof
👻 Ghosted cs.DS 26 8 years ago