| An Improved Procedure for Colouring Graphs of Bounded Local Density
|
2021 |
Hurley, Eoin |
| Rolling Backwards can Move you Forward: On Embedding Problems in Sparse Expanders
|
2021 |
Draganié, Nemanja |
| Strong Connectivity Augmentation is FPT
|
2021 |
Klinkby, Kristine Vitting |
| A Refined Laser Method and Faster Matrix Multiplication
|
2021 |
Alman, Josh |
| Ultrasparse Ultrasparsifiers and Faster Laplacian System Solvers
|
2021 |
Jambulapati, Arun |
| On a Combinatorial Generation Problem of Knuth
|
2021 |
Merino, Arturo |
| Explicit Two-deletion Codes with Redundancy Matching the Existential Bound
|
2021 |
Guruswami, Venkatesan |
| Solving Hard Cut Problems via Flow-Augmentation
|
2021 |
Kim, Eun Jung |
| FPT-Approximation for FPT Problems
|
2021 |
Lokshtanov, Daniel |
| Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting
|
2021 |
Lokshtanov, Daniel |
| All-Pairs LCA in DAGs: Breaking through the O(n2.5) barrier
|
2021 |
Grandoni, Fabrizio |
| Random Restrictions of High Dimensional Distributions and Uniformity Testing with Subcube Conditioning
|
2021 |
Canonne, Clément L. |
| SoS Degree Reduction with Applications to Clustering and Robust Moment Estimation
|
2021 |
Steurer, David |
| Uncertainty about Uncertainty: Optimal Adaptive Algorithms for Estimating Mixtures of Unknown Coins
|
2021 |
Lee, Jasper C. H. |
| Treewidth-Pliability and PTAS for Max-CSPs
|
2021 |
Romero, Miguel |
| Optimal ℓ1 Column Subset Selection and a Fast PTAS for Low Rank Approximation
|
2021 |
Mahankali, Arvind V. |
| Branch-and-Bound Solves Random Binary IPs in Polytime
|
2021 |
Dey, Santanu S. |
| Infinite-Duration AlI-Pay Bidding Games
|
2021 |
Avni, Guy |
| Algorithms for Persuasion with Limited Communication
|
2021 |
Gradwohl, Ronen |
| Average Sensitivity of Graph Algorithms
|
2021 |
Varma, Nithin |
Tag hinzufügen