Senior Research Associate, Network Dynamics and Simulation Science Laboratory, VBI
Assistant Professor, Department of Computer Science, Virginia Tech


Professional Preparation
Los Alamos National Laboratory, Basic and Applied Simulation Science, Postdoctoral Research Associate, 2003
Max-Planck Institut Informatik, Saarbrücken, Germany, Algorithms and Complexity, Postdoctoral Research Associate, 2001
Indian Institute of Science, Bangalore, India, Computer Science, Ph.D., 1999
Indian Institute of Technology, Kanpur, India, Computer Science and Engineering, Bachelor of Technology, 1993

Research Interests

Algorithms, discrete mathematics, combinatorial optimization, randomized algorithms and distributed computation, and their application to problems in wireless networks, epidemiology and social networks.

Professional Activities

  • On the Technical Program Committee of the 28th IEEE Conference on Computer Communications (INFOCOM), 2009.
  • On the Technical Program Committee of the 5th International Workshop on Foundations of Mobile Computing (DIAL M-POMC), 2008.
  • On the Technical Program Committee of the 10th International Conference on Distributed Computing and Networking (ICDCN), 2009.
  • On the Technical Program Committee of the 3rd International Conference on Bio-Inspired Models of Network, Information, and Computing Systems (BIONETICS), 2008.
  • On the Technical Program Committee of the 3rd IEEE International Symposium on Pervasive Computing and Ad Hoc Communications (PCAC) 2008.
  • On the Technical Program Committee of the Fifth International Conference on Ad-Hoc, Mobile and Wireless Networks (Adhoc-Now), 2006.
  • Co-organizer of the NDSSL Seminar Series on Complex Networks
  • Co-organized the 1st Max-Planck Advanced Course on the Foundations of Computer Science, ADFOCS 2000
  • Speaker at BERLUSCONI (Battery-Efficient, Robust, Lightweight, Ubiquitous Sensors for COst-effective Network Infrastructures), at Bertinoro, August 2007.
  • Speaker at the Infectious Disease Epidemiology Spring Seminar Series, Harvard School of Public Health, May 2007.
  • Tutorial titled "Coupled co-evolving social and communication networks" at the Virginia Tech Symposium on Wireless Personal Communications, Virginia Tech, Blacksburg, 2007.
  • Speaker at the Workshop on Algorithms in Networking, Dec 2005, co-organized with FST&TCS 2005.

  • Selected Publications
    (Note: Name appears as V.S. Anil Kumar on most publications)
  • M. E Halloran, N. M. Ferguson, S. Eubank, I. M. Longini Jr., D.A.T. Cummings, B. Lewis, S. Xu, C. Fraser, A. Vullikanti, T. C. Germann, D. Wagener, R. Beckman, K. Kadau, C. Barrett, C. A. Macken, D. S. Burke, and P. Cooley. Modeling targeted layered containment of an influenza pandemic in the United States. In PNAS, March 10, 2008.
  • D. Chafekar, D. Levin, V.S. Anil Kumar, M. Marathe, S. Parthasarathy and A. Srinivasan. Capacity of asynchronous Random-Access Scheduling in Wireless Networks. To appear in Proc. of INFOCOM, 2008.
  • D. Chafekar, V.S. Anil Kumar, M. Marathe, S. Parthasarathy and A. Srinivasan. Approximation Algorithms for Computing of Wireless Networks with SINR constraints. To appear in Proc. of INFOCOM, 2008.
  • D. Chafekar, V.S. Anil Kumar, M. Marathe, S. Parathasarathy and A. Srinivasan. Cross-Latency Minimization for Wireless Networks using SINR constraints. Proc. of MobiHoc, 2007.
  • V.S. Anil Kumar, S Parthasarathy, M.V. Marathe, A. Srinivasan, and S. Zust. Provable algorithms for parallel generalized sweep scheduling for unstructured meshes. Journal of Parallel and Distributed Computing, 66:, 2006:807-821.
  • V.S. Anil Kumar, M. Marathe, S. Parthasarathy, and A. Srinivasan. Scheduling on unrelated machines under tree-like precedence constraints. in special issue of Algorithmica containing selected papers from RANDOM, 2007.
  • C. Duncan, S. Kobourov and V.S. Anil Kumar. Optimal Constrained Graph Exploration. ACM Transactions of Algorithms, 2, 2006:380-402.
  • S. Eidenbenz, V.S. Anil Kumar, and S. Zust. Equilibria in Topology control games for ad hoc networks. Mobile Networks and Applications, 11, 2006:143-159.
  • S. Eubank, VS Anil Kumar, M. Marathe, A. Srinivasan, and N. Wang. Structure of social contact networks and their impact on epidemics. In Discrete Methods in Epidemiology, Abello J, Cormode, G (ed.). DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 70, 2006:179-185.
  • V.S. Anil Kumar, M.V. Marathe, S.Parthasarathy and A. Srinivasan. Algorithmic aspects of capacity in wireless. Proceedings of the International Conference on Measurements and Modeling of Computer Systems (Sigmetrics), 2005:133-144.
  • V.S. Anil Kumar, M.V. Marathe, S. Parthasarathy and A. Srinivasan. Approximation algorithms for scheduling on multiple machines. 46th Annual IEEE Symposium on Foundations of Computer Science, 2005:254-263.
  • S. Eubank, H. Guclu, V.S. Anil Kumar, MV Marathe, A Srinivasan, Z Toroczkai, and N Wang. Modelling disease outbreaks in realistic urban social networks. Nature, 429(6998), 2004:180-184.
  • V.S. Anil Kumar and R. Hariharan. Covering rectilinear polygons with axis-parallel rectangles. SIAM Journal of Computing, 32(6), 2003:1509-1541.
  • V.S. Anil Kumar and R. Hariharan. (2001) Markovian coupling v/s conductance for the Jerrum-Sinclair chain. Random Structures and Algorithms, 18(1), 2001:1-17.
  • Copyright Virginia Bioinformatics Institute © 2005