| Shortest Paths Among Obstacles in the Plane Revisited
|
2021 |
Wang, Haitao |
| Efficient Fully Dynamic Elimination Forests with Applications to Detecting Long Paths and Cycles
|
2021 |
Chen, Jiehua |
| A Constant Factor Approximation for Navigating through Connected Obstacles in the Plane
|
2021 |
Kumar, Neeraj |
| Hamiltonicity of random subgraphs of the hypercube
|
2021 |
Condon, Padraig |
| A Tight Condition for Triangle Factors in Pseudorandom Graphs
|
2021 |
Morris, Patrick |
| Beyond Submodular Maximization via One-Sided Smoothness
|
2021 |
Ghadiri, Mehrdad |
| On Multi-Dimensional Gains from Trade Maximization
|
2021 |
Cai, Yang |
| Beating Greedy for Approximating Reserve Prices in Multi-Unit VCG Auctions
|
2021 |
Derakhshan, Mahsa |
| Online Combinatorial Auctions
|
2021 |
Deng, Yuan |
| Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications
|
2021 |
Forster, Sebastian |
| Improved Algorithms for Population Recovery from the Deletion Channel
|
2021 |
Narayanan, Shyam |
| List-Decodable Subspace Recovery: Dimension Independent Error in Polynomial Time
|
2021 |
Bakshi, Ainesh |
| Decomposing the Complement of the Union of Cubes in Three Dimensions
|
2021 |
Agarwal, Pankaj K. |
| Near-Optimal Randomized Algorithms for Selection in Totally Monotone Matrices
|
2021 |
Chan, Timothy M. |
| Lee-Yang Zeros and the complexity of the Ferromagnetic Ising Model on Bounded-Degree Graphs
|
2021 |
Buys, Pjotr |
| An O(n5/4) Time ∊-Approximation Algorithm for RMS Matching in a Plane
|
2021 |
Lahn, Nathaniel |
| Coloring and Maximum Weight Independent Set of Rectangles
|
2021 |
Chalermsook, Parinya |
| PTAS for Minimum Cost Multi-covering with Disks
|
2021 |
Huang, Ziyun |
| Quantum Algorithms for Graph Problems with Cut Queries
|
2021 |
Lee, Troy |
| Approximating Permanent of Random Matrices with Vanishing Mean: Made Better and Simpler
|
2021 |
Ji, Zhengfeng |
Tag hinzufügen