| No. |
Title |
Author |
Year |
| 1 |
Algorithms and Adaptivity Gaps for Stochastic k-TSP |
Jiang, Haotian et al. |
2020 |
| 2 |
Approximation Algorithms for Clustering with Dynamic Points |
Deng, Shichuan et al. |
2020 |
| 3 |
A PTAS for a Class of Stochastic Dynamic Programs |
Fu, Hao et al. |
2018 |
| 4 |
Odd Yao-Yao Graphs are Not Spanners |
Jin, Yifei et al. |
2018 |
| 5 |
SVM via Saddle Point Optimization: New Bounds and Distributed Algorithms |
Huang, Lingxiao et al. |
2018 |
| 6 |
k-Regret Minimizing Set: Efficient Algorithms and Hardness |
Cao, Wei et al. |
2017 |
| 7 |
Almost All Even Yao-Yao Graphs Are Spanners |
Li, Jian et al. |
2016 |
| 8 |
epsilon-Kernel Coresets for Stochastic Points |
Huang, Lingxiao et al. |
2016 |
| 9 |
Termination of Dependently Typed Rewrite Rules |
Jouannaud, Jean-Pierre et al. |
2015 |
| 10 |
Ranking with Diverse Intents and Correlated Contents |
Li, Jian et al. |
2013 |
| 11 |
Church-Rosser Properties of Normal Rewriting |
Jouannaud, Jean-Pierre et al. |
2012 |
| 12 |
Energy Efficient Scheduling via Partial Shutdown |
Khuller, Samir et al. |
2010 |
