| No. | Title | Author | Year |
|---|---|---|---|
| 1 | FPT Algorithms for Finding Near-Cliques in c-Closed Graphs | Behera, Balaram et al. | 2022 |
| 2 | How Computer Science Informs Modern Auction Design (Invited Talk) | Roughgarden, Tim | 2019 |
| 3 | Finding Cliques in Social Networks: A New Distribution-Free Model | Fox, Jacob et al. | 2018 |
| 4 | Stability and Recovery for Independence Systems | Chatziafratis, Vaggos et al. | 2017 |
| 5 | When Are Welfare Guarantees Robust? | Roughgarden, Tim et al. | 2017 |
| 6 | The Complexity of the k-means Method | Roughgarden, Tim et al. | 2016 |
| 7 | Analysis of Algorithms Beyond the Worst Case (Dagstuhl Seminar 14372) | Balcan, Marina-Florina et al. | 2015 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 7 |