| Strong Recovery of Geometric Planted Matchings
|
2022 |
Kunisky, Dmitriy |
| CLAP: A New Algorithm for Promise CSPs
|
2022 |
Ciardo, Lorenzo |
| Combinatorial Gap Theorem and Reductions between Promise CSPs
|
2022 |
Barto, Libor |
| Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à La Nash-Williams
|
2022 |
Ito, Takehiro |
| Faster Algorithms for Bounded-Difference Min-Plus Product
|
2022 |
Chi, Shucheng |
| On Complete Classes of Valuated Matroids
|
2022 |
Husic, Edin |
| High Dimensional Expanders: Eigenstripping, Pseudorandomness, and Unique Games
|
2022 |
Bafna, Mitali |
| Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic Knapsack
|
2022 |
Jiang, Jiashuo |
| Online Weighted Matching with a Sample
|
2022 |
Kaplan, Haim |
| Inline Discrepancy with Recourse for Vectors and Graphs
|
2022 |
Gupta, Anupam |
| Recognizing k-leaf Powers in Polynomial Time, for Constant k
|
2022 |
Lafond, Manuel |
| Isomorphism Testing for Graphs Excluding Small Topological Subgraphs
|
2022 |
Neuen, Daniel |
| New Diameter-Reducing Shortcuts and Directed Hopsets: Breaking the O(√n) Barrier
|
2022 |
Kogan, Shimon |
| Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in lp-metrics
|
2022 |
Cohen-Addad, Vincent |
| A Sublinear Bound on the Page Number of Upward Planar Graphs
|
2022 |
Jungeblut, Paul |
| Promise Constraint Satisfaction and Width
|
2022 |
Atserias, Albert |
| Algorithmic Thresholds for Refuting Random Polynomial Systems
|
2022 |
Hsieh, Jun-Ting |
| Unsplittable Flow on a Path: The Game!
|
2022 |
Grandoni, Fabrizio |
| Perfect Matching in Random Graphs is as Hard as Tseitin
|
2022 |
Austrin, Per |
| Robust Secretary and Prophet Algorithms for Packing Integer Programs
|
2022 |
Argue, C. J. |
Tag hinzufügen