💀 The Wall of Shame

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

Page 11, showing 50 papers

# Paper Cause of Death Category Citations Published
501 Nearly ETH-Tight Algorithms for Planar Steiner Tree with Terminals on Few Faces
Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen
👻 Ghosted cs.DS 9 7 years ago
502 Finding a latent k-simplex in O(k . nnz(data)) time via Subset Smoothing
Chiranjib Bhattacharyya, Ravindran Kannan
👻 Ghosted cs.LG 9 7 years ago
503 Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs
Pan Peng
👻 Ghosted cs.DS 9 7 years ago
504 Approximating $(k,\ell)$-Median Clustering for Polygonal Curves
Maike Buchin, Anne Driemel, Dennis Rohde
👻 Ghosted cs.CG 9 6 years ago
505 Shortest Paths Among Obstacles in the Plane Revisited
Haitao Wang
👻 Ghosted cs.CG 9 5 years ago
506 Sensitivity Oracles for All-Pairs Mincuts
Surender Baswana, Abhyuday Pandey
👻 Ghosted cs.DS 9 5 years ago
507 Maintaining Expander Decompositions via Sparse Cuts
Yiding Hua, Rasmus Kyng, ... (+2 more)
👻 Ghosted cs.DS 9 4 years ago
508 Closing the Gap Between Directed Hopsets and Shortcut Sets
Aaron Bernstein, Nicole Wein
👻 Ghosted cs.DS 9 4 years ago
509 Exact Flow Sparsification Requires Unbounded Size
Robert Krauthgamer, Ron Mosenzon
👻 Ghosted cs.DS 9 4 years ago
510 Secretary Problems: The Power of a Single Sample
Pranav Nuti, Jan Vondrák
👻 Ghosted cs.DS 9 4 years ago
511 A New Approach to Estimating Effective Resistances and Counting Spanning Trees in Expander Graphs
Lawrence Li, Sushant Sachdeva
👻 Ghosted cs.DS 9 3 years ago
512 Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition
Parinya Chalermsook, Manoj Gupta, ... (+4 more)
👻 Ghosted cs.DS 9 3 years ago
513 Streaming algorithms for the missing item finding problem
Manuel Stoeckl
👻 Ghosted cs.DS 9 3 years ago
514 Controlling Tail Risk in Online Ski-Rental
Michael Dinitz, Sungjin Im, ... (+3 more)
👻 Ghosted cs.DS 9 3 years ago
515 Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth
Arpit Agarwal, Sanjeev Khanna, ... (+5 more)
👻 Ghosted cs.DS 9 2 years ago
516 Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered Graphs
Aditi Dudeja, Rashmika Goswami, Michael Saks
👻 Ghosted cs.DS 9 2 years ago
517 Deterministic Online Bipartite Edge Coloring
Joakim Blikstad, Ola Svensson, ... (+2 more)
👻 Ghosted cs.DS 9 2 years ago
518 Lempel-Ziv: a "one-bit catastrophe" but not a tragedy
Guillaume Lagarde, Sylvain Perifel
👻 Ghosted cs.DS 8 9 years ago
519 On the complexity of optimal homotopies
Erin Wolf Chambers, Arnaud de Mesmay, Tim Ophelders
👻 Ghosted cs.CG 8 8 years ago
520 A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs
Nathaniel Lahn, Sharath Raghvendra
👻 Ghosted cs.DS 8 8 years ago
521 Normalizers and permutational isomorphisms in simply-exponential time
Daniel Wiebking
👻 Ghosted cs.DS 8 7 years ago
522 A Tight Analysis of Greedy Yields Subexponential Time Approximation for Uniform Decision Tree
Ray Li, Percy Liang, Stephen Mussmann
👻 Ghosted cs.DS 8 7 years ago
523 Learning from satisfying assignments under continuous distributions
Clément L. Canonne, Anindya De, Rocco A. Servedio
👻 Ghosted cs.DS 8 7 years ago
524 Sorting Short Keys in Circuits of Size o(n log n)
Gilad Asharov, Wei-Kai Lin, Elaine Shi
👻 Ghosted cs.DS 8 5 years ago
525 Counting Homomorphic Cycles in Degenerate Graphs
Lior Gishboliner, Yevgeny Levanzov, ... (+2 more)
👻 Ghosted cs.DS 8 5 years ago
526 Isomorphism Testing for Graphs Excluding Small Topological Subgraphs
Daniel Neuen
👻 Ghosted cs.DS 8 5 years ago
527 Constant Approximating Parameterized $k$-SetCover is W[2]-hard
Bingkai Lin, Xuandi Ren, ... (+2 more)
👻 Ghosted cs.DS 8 4 years ago
528 Subexponential mixing for partition chains on grid-like graphs
Alan Frieze, Wesley Pegden
👻 Ghosted math.PR 8 4 years ago
529 Approximation algorithms for Steiner Tree Augmentation Problems
R. Ravi, Weizhong Zhang, Michael Zlatin
👻 Ghosted cs.DS 8 4 years ago
530 Shrunk subspaces via operator Sinkhorn iteration
Cole Franks, Tasuku Soma, Michel X. Goemans
👻 Ghosted cs.DS 8 4 years ago
531 Tight Bounds for Monotone Minimal Perfect Hashing
Sepehr Assadi, Martin Farach-Colton, William Kuszmaul
👻 Ghosted cs.DS 8 4 years ago
532 Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time
Yeshwanth Cherapanamjeri, Sandeep Silwal, ... (+2 more)
👻 Ghosted cs.DS 8 3 years ago
533 A Distributed Palette Sparsification Theorem
Maxime Flin, Mohsen Ghaffari, ... (+3 more)
👻 Ghosted cs.DC 8 3 years ago
534 Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free
Greg Bodwin, Bernhard Haeupler, Merav Parter
👻 Ghosted cs.DS 8 3 years ago
535 Near-Optimal Min-Sum Motion Planning for Two Square Robots in a Polygonal Environment
Pankaj K. Agarwal, Dan Halperin, ... (+2 more)
👻 Ghosted cs.RO 8 2 years ago
536 Combinatorial Stationary Prophet Inequalities
Neel Patel, David Wajc
👻 Ghosted cs.GT 8 2 years ago
537 A Quasi-Monte Carlo Data Structure for Smooth Kernel Evaluations
Moses Charikar, Michael Kapralov, Erik Waingarten
👻 Ghosted cs.DS 8 2 years ago
538 Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time
Wenyu Jin, Xiaorui Sun, Mikkel Thorup
👻 Ghosted cs.DS 8 2 years ago
539 Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemeredi Graphs
Sepehr Assadi, Sanjeev Khanna, Peter Kiss
👻 Ghosted cs.DS 8 2 years ago
540 Fréchet Distance in Subquadratic Time
Siu-Wing Cheng, Haoqiang Huang
👻 Ghosted cs.CG 8 2 years ago
541 On the Economic Efficiency of the Combinatorial Clock Auction
Nicolas Bousquet, Yang Cai, ... (+2 more)
👻 Ghosted cs.GT 7 11 years ago
542 An Improved Approximation Guarantee for the Maximum Budgeted Allocation Problem
Christos Kalaitzis
👻 Ghosted cs.DS 7 10 years ago
543 Spanning Circuits in Regular Matroids
Fedor V. Fomin, Petr A. Golovach, ... (+2 more)
👻 Ghosted cs.DS 7 10 years ago
544 Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios
Christos Kalaitzis, Ola Svensson, Jakub Tarnawski
👻 Ghosted cs.DS 7 10 years ago
545 Deterministic parallel algorithms for fooling polylogarithmic juntas and the Lovasz Local Lemma
David G. Harris
👻 Ghosted cs.DS 7 9 years ago
546 Online Degree-Bounded Steiner Network Design
Sina Dahghani, Soheil Ehsani, ... (+3 more)
👻 Ghosted cs.DS 7 9 years ago
547 Improved bounds for testing Dyck languages
Eldar Fischer, Frédéric Magniez, Tatiana Starikovskaya
👻 Ghosted cs.DS 7 9 years ago
548 Faster sublinear approximations of $k$-cliques for low arboricity graphs
Talya Eden, Dana Ron, C. Seshadhri
👻 Ghosted cs.DS 7 7 years ago
549 Sampling Equilibria: Fast No-Regret Learning in Structured Games
Daniel Beaglehole, Max Hopkins, ... (+3 more)
👻 Ghosted cs.GT 7 4 years ago
550 Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation
Meike Hatzel, Lars Jaffke, ... (+5 more)
👻 Ghosted cs.DS 7 4 years ago