| 601 |
Approximation Algorithms and Hardness for Strong Unique Games
Suprovat Ghoshal, Anand Louis
|
👻
Ghosted
|
cs.DS
|
5 |
6 years ago |
| 602 |
Spencer's theorem in nearly input-sparsity time
Vishesh Jain, Ashwin Sah, Mehtaab Sawhney
|
👻
Ghosted
|
cs.DS
|
5 |
4 years ago |
| 603 |
Sublinear-Time Algorithms for Max Cut, Max E2Lin$(q)$, and Unique Label Cover on Expanders
Pan Peng, Yuichi Yoshida
|
👻
Ghosted
|
cs.DS
|
5 |
3 years ago |
| 604 |
A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond
Martin Nägele, Rico Zenklusen
|
👻
Ghosted
|
cs.DS
|
5 |
3 years ago |
| 605 |
Uniformity Testing over Hypergrids with Subcube Conditioning
Xi Chen, Cassandra Marcussen
|
👻
Ghosted
|
cs.DS
|
5 |
3 years ago |
| 606 |
Smoothed Complexity of SWAP in Local Graph Partitioning
Xi Chen, Chenghao Guo, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
5 |
3 years ago |
| 607 |
Sparse induced subgraphs in P_6-free graphs
Maria Chudnovsky, Rose McCarty, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
5 |
3 years ago |
| 608 |
On the hardness of finding balanced independent sets in random bipartite graphs
Will Perkins, Yuzhou Wang
|
👻
Ghosted
|
cs.DS
|
5 |
3 years ago |
| 609 |
Dependent rounding with strong negative-correlation, and scheduling on unrelated machines to minimize completion time
David G. Harris
|
👻
Ghosted
|
cs.DS
|
5 |
3 years ago |
| 610 |
Adversarial Low Degree Testing
Dor Minzer, Kai Zhe Zheng
|
👻
Ghosted
|
cs.DS
|
5 |
3 years ago |
| 611 |
Breaking the k/log k Barrier in Collective Tree Exploration via Tree-Mining
Romain Cosson
|
👻
Ghosted
|
cs.DS
|
5 |
3 years ago |
| 612 |
Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings
Sujoy Bhore, Arnold Filtser, Csaba D. Tóth
|
👻
Ghosted
|
cs.DS
|
5 |
2 years ago |
| 613 |
Untangling Graphs on Surfaces
Éric Colin de Verdière, Vincent Despré, Loïc Dubois
|
👻
Ghosted
|
cs.CG
|
5 |
2 years ago |
| 614 |
Approximating Unrelated Machine Weighted Completion Time Using Iterative Rounding and Computer Assisted Proofs
Shi Li
|
👻
Ghosted
|
cs.DS
|
5 |
2 years ago |
| 615 |
Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
Sujoy Bhore, Balázs Keszegh, ... (+5 more)
|
👻
Ghosted
|
cs.CG
|
5 |
2 years ago |
| 616 |
An efficient uniqueness theorem for overcomplete tensor decomposition
Pascal Koiran
|
👻
Ghosted
|
cs.DS
|
5 |
2 years ago |
| 617 |
Universal Perfect Samplers for Incremental Streams
Seth Pettie, Dingyu Wang
|
👻
Ghosted
|
cs.DS
|
5 |
2 years ago |
| 618 |
Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching
Sujoy Bhore, Timothy M. Chan
|
👻
Ghosted
|
cs.CG
|
5 |
2 years ago |
| 619 |
Random Walks and Evolving Sets: Faster Convergences and Limitations
Siu On Chan, Tsz Chiu Kwok, Lap Chi Lau
|
👻
Ghosted
|
cs.DS
|
4 |
11 years ago |
| 620 |
A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of Terminals
Vincent Cohen-Addad, Éric Colin de Verdière, Arnaud de Mesmay
|
👻
Ghosted
|
cs.DS
|
4 |
9 years ago |
| 621 |
Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields
Swastik Kopparty, Aditya Potukuchi
|
👻
Ghosted
|
cs.IT
|
4 |
8 years ago |
| 622 |
Algorithms for #BIS-hard problems on expander graphs
Matthew Jenssen, Peter Keevash, Will Perkins
|
👻
Ghosted
|
cs.DS
|
4 |
8 years ago |
| 623 |
Better Sample -- Random Subset Sum in $2^{0.255n}$ and its Impact on Decoding Random Linear Codes
Andre Esser, Alexander May
|
👻
Ghosted
|
cs.DS
|
4 |
7 years ago |
| 624 |
Finding irrelevant vertices in linear time on bounded-genus graphs
Petr A. Golovach, Stavros G. Kolliopoulos, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
4 |
7 years ago |
| 625 |
Computing Circle Packing Representations of Planar Graphs
Sally Dong, Yin Tat Lee, Kent Quanrud
|
👻
Ghosted
|
cs.CG
|
4 |
6 years ago |
| 626 |
Approximating Permanent of Random Matrices with Vanishing Mean: Made Better and Simpler
Zhengfeng Ji, Zhihan Jin, Pinyan Lu
|
👻
Ghosted
|
cs.DS
|
4 |
6 years ago |
| 627 |
Optimal Discretization is Fixed-parameter Tractable
Stefan Kratsch, Tomáš Masařík, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
4 |
6 years ago |
| 628 |
A Parameterized Family of Meta-Submodular Functions
Mehrdad Ghadiri, Richard Santiago, Bruce Shepherd
|
👻
Ghosted
|
cs.DS
|
4 |
6 years ago |
| 629 |
Query strategies for priced information, revisited
Guy Blanc, Jane Lange, Li-Yang Tan
|
👻
Ghosted
|
cs.DS
|
4 |
5 years ago |
| 630 |
Robust Algorithms for Online Convex Problems via Primal-Dual
Marco Molinaro
|
👻
Ghosted
|
cs.DS
|
4 |
5 years ago |
| 631 |
Competitive Data-Structure Dynamization
Claire Mathieu, Rajmohan Rajaraman, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
4 |
5 years ago |
| 632 |
Approximate Distance Oracles for Planar Graphs with Subpolynomial Error Dependency
Hung Le
|
👻
Ghosted
|
cs.DS
|
4 |
4 years ago |
| 633 |
Minimizing Completion Times for Stochastic Jobs via Batched Free Times
Anupam Gupta, Benjamin Moseley, Rudy Zhou
|
👻
Ghosted
|
cs.DS
|
4 |
4 years ago |
| 634 |
Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours
François Dross, Krzysztof Fleszar, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
4 |
4 years ago |
| 635 |
Simplex Range Searching Revisited: How to Shave Logs in Multi-Level Data Structures
Timothy M. Chan, Da Wei Zheng
|
👻
Ghosted
|
cs.CG
|
4 |
3 years ago |
| 636 |
Smaller Low-Depth Circuits for Kronecker Powers
Josh Alman, Yunfeng Guan, Ashwin Padaki
|
👻
Ghosted
|
cs.DS
|
4 |
3 years ago |
| 637 |
Maximal $k$-Edge-Connected Subgraphs in Weighted Graphs via Local Random Contraction
Chaitanya Nalam, Thatchaphol Saranurak
|
👻
Ghosted
|
cs.DS
|
4 |
3 years ago |
| 638 |
Fully Dynamic Shortest Path Reporting Against an Adaptive Adversary
Anastasiia Alokhina, Jan van den Brand
|
👻
Ghosted
|
cs.DS
|
4 |
3 years ago |
| 639 |
Representative set statements for delta-matroids and the Mader delta-matroid
Magnus Wahlström
|
👻
Ghosted
|
cs.DS
|
4 |
3 years ago |
| 640 |
Edge-Coloring Algorithms for Bounded Degree Multigraphs
Abhishek Dhawan
|
👻
Ghosted
|
cs.DS
|
4 |
3 years ago |
| 641 |
Combinatorial Approach for Factorization of Variance and Entropy in Spin Systems
Zongchen Chen
|
👻
Ghosted
|
cs.DS
|
4 |
3 years ago |
| 642 |
Lipschitz Continuous Algorithms for Covering Problems
Soh Kumabe, Yuichi Yoshida
|
👻
Ghosted
|
cs.DS
|
4 |
3 years ago |
| 643 |
Single-Source Unsplittable Flows in Planar Graphs
Vera Traub, Laura Vargas Koch, Rico Zenklusen
|
👻
Ghosted
|
cs.DS
|
4 |
3 years ago |
| 644 |
Deterministic Sparse Pattern Matching via the Baur-Strassen Theorem
Nick Fischer
|
👻
Ghosted
|
cs.DS
|
4 |
2 years ago |
| 645 |
Online Robust Mean Estimation
Daniel M. Kane, Ilias Diakonikolas, ... (+2 more)
|
👻
Ghosted
|
cs.LG
|
4 |
2 years ago |
| 646 |
Robust Sparsification for Matroid Intersection with Applications
Chien-Chung Huang, François Sellier
|
👻
Ghosted
|
cs.DS
|
4 |
2 years ago |
| 647 |
Improved Roundtrip Spanners, Emulators, and Directed Girth Approximation
Alina Harbuzova, Ce Jin, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
4 |
2 years ago |
| 648 |
Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts
Zhongtian He, Shang-En Huang, Thatchaphol Saranurak
|
👻
Ghosted
|
cs.DS
|
4 |
2 years ago |
| 649 |
Bin Packing under Random-Order: Breaking the Barrier of 3/2
Anish Hebbar, Arindam Khan, K. V. N. Sreenivas
|
👻
Ghosted
|
cs.DS
|
4 |
2 years ago |
| 650 |
Cactus Representation of Minimum Cuts: Derandomize and Speed up
Zhongtian He, Shang-En Huang, Thatchaphol Saranurak
|
👻
Ghosted
|
cs.DS
|
4 |
2 years ago |