| 401 |
Tight Bounds for Online Graph Partitioning
Monika Henzinger, Stefan Neumann, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
14 |
5 years ago |
| 402 |
From algorithms to connectivity and back: finding a giant component in random k-SAT
Zongchen Chen, Nitya Mani, Ankur Moitra
|
👻
Ghosted
|
cs.DS
|
14 |
4 years ago |
| 403 |
Adaptive Out-Orientations with Applications
Aleksander B. G. Christiansen, Jacob Holm, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
14 |
3 years ago |
| 404 |
A Framework for Approximation Schemes on Disk Graphs
Daniel Lokshtanov, Fahad Panolan, ... (+3 more)
|
👻
Ghosted
|
cs.CG
|
14 |
3 years ago |
| 405 |
A Cut-Matching Game for Constant-Hop Expanders
Bernhard Haeupler, Jonas Huebotter, Mohsen Ghaffari
|
👻
Ghosted
|
cs.DS
|
14 |
3 years ago |
| 406 |
On Deterministically Approximating Total Variation Distance
Weiming Feng, Liqiang Liu, Tianren Liu
|
👻
Ghosted
|
cs.DS
|
14 |
2 years ago |
| 407 |
Tight Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs
Sam Chiu-wai Wong
|
👻
Ghosted
|
cs.DS
|
13 |
10 years ago |
| 408 |
Distance Sensitive Bloom Filters Without False Negatives
Mayank Goswami, Rasmus Pagh, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
13 |
10 years ago |
| 409 |
Playing Anonymous Games using Simple Strategies
Yu Cheng, Ilias Diakonikolas, Alistair Stewart
|
👻
Ghosted
|
cs.GT
|
13 |
10 years ago |
| 410 |
The $(h,k)$-Server Problem on Bounded Depth Trees
Nikhil Bansal, Marek Eliáš, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
13 |
10 years ago |
| 411 |
A PTAS for Euclidean TSP with Hyperplane Neighborhoods
Antonios Antoniadis, Krzysztof Fleszar, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
13 |
8 years ago |
| 412 |
Flow-Cut Gaps and Face Covers in Planar Graphs
Robert Krauthgamer, James R. Lee, Havana Rika
|
👻
Ghosted
|
cs.DS
|
13 |
7 years ago |
| 413 |
Set Cover in Sub-linear Time
Piotr Indyk, Sepideh Mahabadi, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
13 |
7 years ago |
| 414 |
Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model
Krzysztof Nowicki, Krzysztof Onak
|
👻
Ghosted
|
cs.DS
|
13 |
6 years ago |
| 415 |
Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover
Nikhil Bansal, Jatin Batra, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
13 |
6 years ago |
| 416 |
Approximating the Median under the Ulam Metric
Diptarka Chakraborty, Debarati Das, Robert Krauthgamer
|
👻
Ghosted
|
cs.DS
|
13 |
5 years ago |
| 417 |
Fast Low-Space Algorithms for Subset Sum
Ce Jin, Nikhil Vyas, Ryan Williams
|
👻
Ghosted
|
cs.DS
|
13 |
5 years ago |
| 418 |
Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time
Sally Dong, Yu Gao, ... (+5 more)
|
👻
Ghosted
|
cs.DS
|
13 |
4 years ago |
| 419 |
Fixed-Parameter Tractability of Maximum Colored Path and Beyond
Fedor V. Fomin, Petr A. Golovach, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
13 |
4 years ago |
| 420 |
Curve Simplification and Clustering under Fréchet Distance
Siu-Wing Cheng, Haoqiang Huang
|
👻
Ghosted
|
cs.CG
|
13 |
4 years ago |
| 421 |
Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds
Nairen Cao, Shang-En Huang, Hsin-Hao Su
|
👻
Ghosted
|
cs.DS
|
13 |
3 years ago |
| 422 |
Faster Vizing and Near-Vizing Edge Coloring Algorithms
Sepehr Assadi
|
👻
Ghosted
|
cs.DS
|
13 |
2 years ago |
| 423 |
Maximum Scatter TSP in Doubling Metrics
László Kozma, Tobias Mömke
|
👻
Ghosted
|
cs.DS
|
12 |
10 years ago |
| 424 |
LR-Drawings of Ordered Rooted Binary Trees and Near-Linear Area Drawings of Outerplanar Graphs
Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli
|
👻
Ghosted
|
cs.CG
|
12 |
9 years ago |
| 425 |
LAST but not Least: Online Spanners for Buy-at-Bulk
Anupam Gupta, R. Ravi, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
12 |
9 years ago |
| 426 |
Oblivious resampling oracles and parallel algorithms for the Lopsided Lovasz Local Lemma
David G. Harris
|
👻
Ghosted
|
cs.DS
|
12 |
9 years ago |
| 427 |
Approximating the Largest Root and Applications to Interlacing Families
Nima Anari, Shayan Oveis Gharan, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
12 |
9 years ago |
| 428 |
Incremental DFS algorithms: a theoretical and experimental study
Surender Baswana, Ayush Goel, Shahbaz Khan
|
👻
Ghosted
|
cs.DS
|
12 |
9 years ago |
| 429 |
Improved Bounds for Testing Forbidden Order Patterns
Omri Ben-Eliezer, Clément L. Canonne
|
👻
Ghosted
|
cs.DS
|
12 |
8 years ago |
| 430 |
Algorithms to Approximate Column-Sparse Packing Problems
Brian Brubach, Karthik Abinav Sankararaman, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
12 |
8 years ago |
| 431 |
A Faster External Memory Priority Queue with DecreaseKeys
Shunhua Jiang, Kasper Green Larsen
|
👻
Ghosted
|
cs.DS
|
12 |
8 years ago |
| 432 |
Optimal Las Vegas Approximate Near Neighbors in $\ell_p$
Alexander Wei
|
👻
Ghosted
|
cs.DS
|
12 |
8 years ago |
| 433 |
Efficiently Approximating Edit Distance Between Pseudorandom Strings
William Kuszmaul
|
👻
Ghosted
|
cs.DS
|
12 |
7 years ago |
| 434 |
Finding a Bounded-Degree Expander Inside a Dense One
Luca Becchetti, Andrea Clementi, ... (+3 more)
|
👻
Ghosted
|
cs.DC
|
12 |
7 years ago |
| 435 |
Linear Size Sparsifier and the Geometry of the Operator Norm Ball
Victor Reis, Thomas Rothvoss
|
👻
Ghosted
|
cs.DS
|
12 |
7 years ago |
| 436 |
The Power of the Combined Basic LP and Affine Relaxation for Promise CSPs
Joshua Brakensiek, Venkatesan Guruswami, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
12 |
7 years ago |
| 437 |
Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution
Sungjin Im, Maryam Shadloo
|
👻
Ghosted
|
cs.DS
|
12 |
6 years ago |
| 438 |
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics
Jesper Nederlof, Jakub Pawlewicz, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
12 |
6 years ago |
| 439 |
All-Pairs LCA in DAGs: Breaking through the $O(n^{2.5})$ barrier
Fabrizio Grandoni, Giuseppe F. Italiano, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
12 |
6 years ago |
| 440 |
New Data Structures for Orthogonal Range Reporting and Range Minima Queries
Yakov Nekrich
|
👻
Ghosted
|
cs.DS
|
12 |
6 years ago |
| 441 |
Generalized Unrelated Machine Scheduling Problem
Shichuan Deng, Jian Li, Yuval Rabani
|
👻
Ghosted
|
cs.DS
|
12 |
4 years ago |
| 442 |
Near-Linear Time Approximations for Cut Problems via Fair Cuts
Jason Li, Danupon Nanongkai, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
12 |
4 years ago |
| 443 |
A tight quasi-polynomial bound for Global Label Min-Cut
Lars Jaffke, Paloma T. Lima, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
12 |
4 years ago |
| 444 |
Improved Bounds for Sampling Solutions of Random CNF Formulas
Kun He, Kewen Wu, Kuan Yang
|
👻
Ghosted
|
cs.DS
|
12 |
4 years ago |
| 445 |
On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs
Kim-Manuel Klein, Adam Polak, Lars Rohwedder
|
👻
Ghosted
|
cs.DS
|
12 |
3 years ago |
| 446 |
Discrepancy Minimization via Regularization
Lucas Pesenti, Adrian Vladu
|
👻
Ghosted
|
cs.DS
|
12 |
3 years ago |
| 447 |
Fully Dynamic Exact Edge Connectivity in Sublinear Time
Gramoz Goranci, Monika Henzinger, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
12 |
3 years ago |
| 448 |
On the Unreasonable Effectiveness of Single Vector Krylov Methods for Low-Rank Approximation
Raphael A. Meyer, Cameron Musco, Christopher Musco
|
👻
Ghosted
|
cs.DS
|
12 |
3 years ago |
| 449 |
Fair Price Discrimination
Siddhartha Banerjee, Kamesh Munagala, ... (+2 more)
|
👻
Ghosted
|
cs.GT
|
12 |
3 years ago |
| 450 |
The Time Complexity of Fully Sparse Matrix Multiplication
Amir Abboud, Karl Bringmann, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
12 |
3 years ago |