Approximation algorithms for prize collecting forest problems with submodular penalty functions. - Yogeshwer Sharma; Chaitanya Swamy; David P. Williamson (SODA, 2007)

Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements. - Chandrashekhar Nagarajan; Yogeshwer Sharma; David P. Williamson (WAOA, 2008)

Characterizing truthful multi-armed bandit mechanisms: extended abstract. - Moshe Babaioff; Yogeshwer Sharma; Aleksandrs Slivkins (EC, 2009)

Stackelberg thresholds in network routing games or the value of altruism. - Yogeshwer Sharma; David P. Williamson (Games Econ. Behav., 2009)

Regret bounds for sleeping experts and bandits. - Robert Kleinberg; Alexandru Niculescu-Mizil; Yogeshwer Sharma (Mach. Learn., 2010)

Expressive models in online learning. - Yogeshwer Sharma (2010)

Characterizing Truthful Multi-armed Bandit Mechanisms. - Moshe Babaioff; Yogeshwer Sharma; Aleksandrs Slivkins (SIAM J. Comput., 2014)

Wormhole: Reliable Pub-Sub to Support Geo-replicated Internet Services. - Yogeshwer Sharma; Philippe Ajoux; Petchean Ang; David Callies; Abhishek Choudhary; Laurent Demailly; Thomas Fersch; Liat Atsmon Guz; Andrzej Kotulski; Sachin Kulkarni; Sanjeev Kumar; Harry C. Li; et al. (NSDI, 2015)