Kamesh Munagala's Research Interests

My main research interest is discrete optimization.
A complete list of my papers is available via DBLP. Below, I have placed a few representative papers that give a sampling of my research interests.

Approximation and Online Algorithms

SelfishMigrate: A scalable algorithm for non-clairvoyantly scheduling heterogeneous processors (with S. Im, J. Kulkarni and K. Pruhs), CoRR '14.
Competitive algorithms from competitive equilibria (with Sungjin Im and Janardhan Kulkarni) STOC '14.
Approximation algorithms for Bayesian multi-armed bandit problems  (with Sudipto Guha), CoRR '13 (in STOC '07, ICALP '09, and APPROX '13).
Approximation algorithms for restless bandit problems (with Sudipto Guha and Peng Shi) J. ACM, 58(1), 2010 (also in FOCS '07 and SODA '09).
Exceeding expectations and clustering uncertain data (with Sudipto Guha) PODS '09.
Adaptive uncertainty resolution in Bayesian combinatorial optimization (with Sudipto Guha) TALG 8(1), 2012 (also in SODA '07).
Local search heuristics for k-medians and facility location problems (with V. Arya, N. Garg, R. Khandekar, A. Meyerson, and V. Pandit) STOC '01.
Constant factor approximation for the single sink edge installation problem (with Sudipto Guha and Adam Meyerson) STOC '01.
Cost-Distance: Two metric network design (with Adam Meyerson and Serge Plotkin) FOCS '00.

Game Theory, Auctions, Social Networks

Coordination mechanisms from (almost) all scheduling policies (with Sayan Bhattacharya, Sungjin Im, and Janardhan Kulkarni) ITCS '14.
Modeling opinion dynamics in social networks (with Abhimanyu Das and Sreenivas Gollapudi), WSDM '14.
Coevolutionary opinion formation games (with Kshipra Bhawalkar and Sreenivas Gollapudi), STOC '13.
On the precision of social and information networks (with Reza Bosagh Zadeh, Ashish Goel, and Aneesh Sharma), COSN '13.
Optimal auctions via the multiplicative weight method (with Anand Bhalgat and Sreenivas Gollapudi), EC '13.
Mechanisms and allocations with positive network externalities (with Anand Bhalgat and Sreenivas Gollapudi) EC '12.
Optimal auctions with positive network externalities  (with Nima Haghpanah, Nicole Immorlica, and Vahab Mirrokni)  EC '11.
Budget constrained auctions with heterogeneous items (with Sayan Bhattacharya, Gagan Goel, and Sreenivas Gollapudi) STOC '10.
Incentive compatible budget elicitation in multi-unit auctions (with Sayan Bhattacharya, Vincent Conitzer, and Lirong Xia) SODA '10.
Hybrid keyword search auctions (with Ashish Goel) WWW '09.    (Winner of best paper award)

Query Optimization and Data Processing

Optimization of continuous queries with shared expensive filters (with Utkarsh Srivastava and Jennifer Widom) PODS '07.
Suppression and failures in sensor networks: A Bayesian approach (with A. Silberstein, G. Puggioni, A. Gelfand and Jun Yang) VLDB '07.
Energy efficient monitoring of extreme values in sensor networks (with Adam Silberstein and Jun Yang) SIGMOD '06.
Query optimization over web services (with Utkarsh Srivastava, Rajeev Motwani, and Jennifer Widom) VLDB '06.
A sampling-based approach to optimizing top-K queries in sensor networks (with A. Silberstein, R. Braynard, C. Ellis, and Jun Yang) ICDE '06.
Operator placement for in-network stream processing (with Utkarsh Srivastava and Jennifer Widom) PODS '05.
Adaptive ordering of pipelined stream filters (with Shivnath Babu, Rajeev Motwani, Itaru Nishizawa, and Jennifer Widom) SIGMOD '04.
Cancer characterization and feature set extraction via discriminative margin clustering (with R. Tibshirani and P. O. Brown) BMC Bioinformatics 5:21, 2004.


Copyright Notice: Since most of these papers are published, the copyright has been transferred to the respective publishers. The following is ACM's copyright notice; other publishers have similar ones.

Copyright 20xx by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that new copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted.