| No. | Title | Author | Year |
|---|---|---|---|
| 1 | How to Hide a Clique? | Feige, Uriel et al. | 2020 |
| 2 | Max-Min Greedy Matching | Eden, Alon et al. | 2019 |
| 3 | On the Probe Complexity of Local Computation Algorithms | Feige, Uriel et al. | 2018 |
| 4 | Oblivious Rounding and the Integrality Gap | Feige, Uriel et al. | 2016 |
| 5 | Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241) | Dyer, Martin et al. | 2011 |
| 6 | On Estimation Algorithms vs Approximation Algorithms | Feige, Uriel | 2008 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 6 |