| 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 |
| Average-Case Subset Balancing Problems
|
2022 |
Chen, Xi |
| The Sparse Parity Matrix
|
2022 |
Coja-Oghlan, Amin |
| Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension
|
2022 |
Jayaprakash, Aditya |
| Approximate Hypergraph Vertex Cover and Generalized Tuza's Conjecture
|
2022 |
Guruswami, Venkatesan |
| A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to Decision
|
2022 |
Ghosh, Sumanta |
| Twin- Widith VI: The Lens of Contraction Sequences
|
2022 |
Bonnet, Edouard |
| Single-Sample Prophet Inequalities via Greedy-Ordered Selection
|
2022 |
Caramanis, Constantine |
| Algorithmic Trade-offs for Girth Approximation in Undirected Graphs
|
2022 |
Kadaria, Avi |
| Polynomial-Time Algorithm for Maximum Independent Set in Bounded-Degree Graphs With No Long Induced Claws
|
2022 |
Abrishami, Tara |
| A 3-Approximation Algorithm for Maximum Independent Set of Rectangles
|
2022 |
Galvez, Waldo |
| Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces
|
2022 |
Chen, Xi |
| 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 |
Tag hinzufügen