Saurav Pandit

Approximation Algorithms for Domatic Partitions ∗

Kasturi R. Varadarajan, S. Pemmaraju, Saurav Pandit, 2009 .

Approximation Algorithms for Domatic Partitions of Unit Disk Graphs

Sriram V. Pemmaraju, Kasturi R. Varadarajan, Saurav Pandit, 2009, APPROX-RANDOM.

Red Black Network: Temporal and Topological Analysis of Two Intertwined Social Networks

Nitesh V. Chawla, Yang Yang, Brian Uzzi, 2013, MILCOM 2013 - 2013 IEEE Military Communications Conference.

Is Objective Function the Silver Bullet? A Case Study of Community Detection Algorithms on Social Networks

Nitesh V. Chawla, Yizhou Sun, Jiawei Han, 2011, 2011 International Conference on Advances in Social Networks Analysis and Mining.

Perspective on Measurement Metrics for Community Detection Algorithms

Nitesh V. Chawla, Yizhou Sun, Jiawei Han, 2013, Mining Social Networks and Security Informatics.

Rapid randomized pruning for fast greedy distributed algorithms

Sriram V. Pemmaraju, Saurav Pandit, S. Pemmaraju, 2010, PODC.

Return of the primal-dual: distributed metric facilitylocation

Sriram V. Pemmaraju, Saurav Pandit, S. Pemmaraju, 2009, PODC '09.

Approximation algorithms for distributed systems

Sriram V. Pemmaraju, Saurav Pandit, S. Pemmaraju, 2010 .

Local approximation schemes for topology control pdf

Sriram V. Pemmaraju, Mirela Damian, Saurav Pandit, 2006, PODC '06.

Detecting communities in time-evolving proximity networks

Nitesh V. Chawla, Yang Yang, Saurav Pandit, 2011, 2011 IEEE Network Science Workshop.