| 501 |
Perron-Frobenius Theory in Nearly Linear Time: Positive Eigenvectors, M-matrices, Graph Kernels, and Other Applications
AmirMahdi Ahmadinejad, Arun Jambulapati, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
11 |
7 years ago |
| 502 |
Boolean function analysis meets stochastic optimization: An approximation scheme for stochastic knapsack
Anindya De
|
👻
Ghosted
|
cs.DS
|
11 |
8 years ago |
| 503 |
A Framework for the Secretary Problem on the Intersection of Matroids
Moran Feldman, Ola Svensson, Rico Zenklusen
|
👻
Ghosted
|
cs.DS
|
11 |
9 years ago |
| 504 |
Algorithmic and Hardness Results for the Hub Labeling Problem
Haris Angelidakis, Yury Makarychev, Vsevolod Oparin
|
👻
Ghosted
|
cs.DS
|
11 |
9 years ago |
| 505 |
Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut
Chandra Chekuri, Vivek Madan
|
👻
Ghosted
|
cs.DS
|
11 |
11 years ago |
| 506 |
Near-Linear Sample Complexity for $L_p$ Polynomial Regression
Raphael A. Meyer, Cameron Musco, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
11 |
3 years ago |
| 507 |
Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection
Shang-En Huang, Seth Pettie, Leqi Zhu
|
👻
Ghosted
|
cs.DC
|
11 |
4 years ago |
| 508 |
Tree Independence Number IV. Even-hole-free Graphs
Maria Chudnovsky, Peter Gartland, ... (+3 more)
|
🔮
The Ethereal
|
math.CO
|
10 |
2 years ago |
| 509 |
Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization
Daniel Gibney, Ce Jin, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
10 |
2 years ago |
| 510 |
2-Approximation for Prize-Collecting Steiner Forest
Ali Ahmadi, Iman Gholami, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
10 |
2 years ago |
| 511 |
Almost Tight Bounds for Differentially Private Densest Subgraph
Michael Dinitz, Satyen Kale, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
10 |
2 years ago |
| 512 |
Linear-Sized Sparsifiers via Near-Linear Time Discrepancy Theory
Arun Jambulapati, Victor Reis, Kevin Tian
|
👻
Ghosted
|
cs.DS
|
10 |
3 years ago |
| 513 |
Testing Convex Truncation
Anindya De, Shivam Nadimpalli, Rocco A. Servedio
|
👻
Ghosted
|
cs.DS
|
10 |
3 years ago |
| 514 |
On Two-Handed Planar Assembly Partitioning with Connectivity Constraints
Pankaj K. Agarwal, Boris Aronov, ... (+2 more)
|
👻
Ghosted
|
cs.CG
|
10 |
5 years ago |
| 515 |
EPTAS for $k$-means Clustering of Affine Subspaces
Eduard Eiben, Fedor V. Fomin, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
10 |
5 years ago |
| 516 |
Tight Distributed Sketching Lower Bound for Connectivity
Huacheng Yu
|
👻
Ghosted
|
cs.DS
|
10 |
5 years ago |
| 517 |
On Distribution Testing in the Conditional Sampling Model
Shyam Narayanan
|
👻
Ghosted
|
cs.DS
|
10 |
6 years ago |
| 518 |
Tightening Curves on Surfaces Monotonically with Applications
Hsien-Chih Chang, Arnaud de Mesmay
|
👻
Ghosted
|
math.GT
|
10 |
6 years ago |
| 519 |
Approximate Distance Oracles Subject to Multiple Vertex Failures
Ran Duan, Yong Gu, Hanlin Ren
|
👻
Ghosted
|
cs.DS
|
10 |
6 years ago |
| 520 |
Efficient Document Exchange and Error Correcting Codes with Asymmetric Information
Kuan Cheng, Xin Li
|
🔮
The Ethereal
|
cs.CC
|
10 |
6 years ago |
| 521 |
Improved Local Computation Algorithm for Set Cover via Sparsification
Christoph Grunau, Slobodan Mitrović, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
10 |
6 years ago |
| 522 |
Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol
Xiaohui Bei, Xiaoming Sun, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
10 |
7 years ago |
| 523 |
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
|
👻
Ghosted
|
cs.DS
|
10 |
7 years ago |
| 524 |
Algorithms for weighted independent transversals and strong colouring
Alessandra Graf, David G. Harris, Penny Haxell
|
👻
Ghosted
|
cs.DS
|
10 |
7 years ago |
| 525 |
Lower bounds for text indexing with mismatches and differences
Vincent Cohen-Addad, Laurent Feuilloley, Tatiana Starikovskaya
|
👻
Ghosted
|
cs.DS
|
10 |
7 years ago |
| 526 |
Optimal Ball Recycling
Michael A. Bender, Jake Christensen, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
10 |
8 years ago |
| 527 |
Instance-Optimality in the Noisy Value-and Comparison-Model --- Accept, Accept, Strong Accept: Which Papers get in?
Vincent Cohen-Addad, Frederik Mallmann-Trenn, Claire Mathieu
|
👻
Ghosted
|
cs.DS
|
10 |
8 years ago |
| 528 |
Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter
Krishnendu Chatterjee, Wolfgang Dvořák, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
10 |
8 years ago |
| 529 |
Exact Computation of a Manifold Metric, via Lipschitz Embeddings and Shortest Paths on a Graph
Timothy Chu, Gary Miller, Donald Sheehy
|
👻
Ghosted
|
cs.CG
|
10 |
8 years ago |
| 530 |
An Alon-Boppana Type Bound for Weighted Graphs and Lowerbounds for Spectral Sparsification
Nikhil Srivastava, Luca Trevisan
|
🔮
The Ethereal
|
cs.DM
|
10 |
9 years ago |
| 531 |
Faster Sublinear Algorithms using Conditional Sampling
Themistoklis Gouleakis, Christos Tzamos, Manolis Zampetakis
|
👻
Ghosted
|
cs.DS
|
10 |
9 years ago |
| 532 |
Approximation of non-boolean 2CSP
Guy Kindler, Alexandra Kolla, Luca Trevisan
|
👻
Ghosted
|
cs.DS
|
10 |
11 years ago |
| 533 |
Communication Complexity of Permutation-Invariant Functions
Badih Ghazi, Pritish Kamath, Madhu Sudan
|
🔮
The Ethereal
|
cs.CC
|
10 |
11 years ago |
| 534 |
Higher degree sum-of-squares relaxations robust against oblivious outliers
Tommaso d'Orsi, Rajai Nasser, ... (+2 more)
|
👻
Ghosted
|
cs.LG
|
10 |
3 years ago |
| 535 |
Improved Approximations for Unrelated Machine Scheduling
Sungjin Im, Shi Li
|
👻
Ghosted
|
cs.DS
|
10 |
3 years ago |
| 536 |
Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows
Ruoxu Cen, William He, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
10 |
3 years ago |
| 537 |
Superpolynomial Lower Bounds for Decision Tree Learning and Testing
Caleb Koch, Carmen Strassle, Li-Yang Tan
|
🔮
The Ethereal
|
cs.CC
|
10 |
3 years ago |
| 538 |
Almost Tight Bounds for Online Facility Location in the Random-Order Model
Haim Kaplan, David Naori, Danny Raz
|
👻
Ghosted
|
cs.DS
|
10 |
4 years ago |
| 539 |
Kernelization for Graph Packing Problems via Rainbow Matching
Stéphane Bessy, Marin Bougeret, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
10 |
4 years ago |
| 540 |
Polynomial formulations as a barrier for reduction-based hardness proofs
Tatiana Belova, Alexander Golovnev, ... (+3 more)
|
🔮
The Ethereal
|
cs.CC
|
10 |
4 years ago |
| 541 |
Deterministic Online Bipartite Edge Coloring
Joakim Blikstad, Ola Svensson, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
9 |
1 year ago |
| 542 |
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 |
| 543 |
Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth
Arpit Agarwal, Sanjeev Khanna, ... (+5 more)
|
👻
Ghosted
|
cs.DS
|
9 |
2 years ago |
| 544 |
Controlling Tail Risk in Online Ski-Rental
Michael Dinitz, Sungjin Im, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
9 |
2 years ago |
| 545 |
Randomized Communication and Implicit Representations for Matrices and Graphs of Small Sign-Rank
Nathaniel Harms, Viktor Zamaraev
|
🔮
The Ethereal
|
cs.CC
|
9 |
3 years ago |
| 546 |
Sensitivity Oracles for All-Pairs Mincuts
Surender Baswana, Abhyuday Pandey
|
👻
Ghosted
|
cs.DS
|
9 |
5 years ago |
| 547 |
Shortest Paths Among Obstacles in the Plane Revisited
Haitao Wang
|
👻
Ghosted
|
cs.CG
|
9 |
5 years ago |
| 548 |
On the Mysteries of MAX NAE-SAT
Joshua Brakensiek, Neng Huang, ... (+2 more)
|
🔮
The Ethereal
|
cs.CC
|
9 |
5 years ago |
| 549 |
Approximating $(k,\ell)$-Median Clustering for Polygonal Curves
Maike Buchin, Anne Driemel, Dennis Rohde
|
👻
Ghosted
|
cs.CG
|
9 |
5 years ago |
| 550 |
On Efficient Distance Approximation for Graph Properties
Nimrod Fiat, Dana Ron
|
🔮
The Ethereal
|
math.CO
|
9 |
6 years ago |