NDSSL People > Anil Vullikanti

Anil Vullikanti

Associate Professor, Department of Computer Science, and
Virginia Bioinformatics Institute, Virginia Tech

Short Bio

Professional Preparation

  • Postdoctoral Associate, Los Alamos National Laboratory.
  • Postdoctoral Associate, Max-Planck Institute for Computer Science, Saarbrücken, Germany.
  • PhD, Indian Institute of Science, Bangalore, India, Computer Science, 1999.
  • Bachelor of Technology, Indian Institute of Technology Kanpur, India, Computer Science and Engineering, 1993.

Research Interests

  • Randomized and approximation algorithms
  • Theoretical aspects of wireless networks
  • Distributed algorithms
  • Algorithmic game theory
  • Modeling and simulation of social and infrastructure systems
  • Computational Epidemiology

Selected Publications

(Please note that my name appears as V.S. Anil Kumar on most publications)
  • Z. Zhao, G. Wang, A. Butt, M. Khan, V.S. Anil Kumar, M. Marathe (2012). SAHad: Subgraph analysis in massive networks using hadoop. In The Proceedings of 26th IEEE International Parallel & Distributed Processing Symposium (IPDPS), May 21-25, Shanghai, 2012.
  • G. Pei, V.S. Anil Kumar, S. Parthasarathy, A. Srinivasan (2011). Approximation algorithms for throughput maximization in wireless networks with delay constraints. In Proceedings of IEEE INFOCOM. Shanghai, China, April 10-15, 2011.
  • Amitabha Ghosh, Ozlem Durmaz Incel, V. S. Anil Kumar, and Bhaskar Krishnamachari. Multi-Channel Scheduling and Spanning Trees: Throughput-Delay Trade-off for Fast Data Collection in Sensor Networks, IEEE/ACM Transactions on Networking, vol. 19, no. 6, pp. 1731--1744, 2011.
  • K. Channakeshava, K. Bisset, M. Marathe, V.S. Anil Kumar, S. Yardi (2011). High Performance Scalable and Expressive Modeling Environment to Study Mobile Malware in Large Dynamic Networks. In Proceedings of 25th IEEE International Parallel & Distributed Processing Symposium (IPDPS). Anchorage, Alaska, May 16-20, 2011.
  • C. Kuhlman, V.S. Anil Kumar, M. Marathe, S.S. Ravi, D. Rosenkrantz. Finding critical nodes for inhibiting diffusion of complex contagions in social networks. In Proceedings of European Conference on Machine Learning and Principles and Practice in Knowledge of Discovery in Databases, Barcelona, Spain, 2010.
  • V.S. Anil Kumar, M. Marathe, S. Parthasarathy and A. Srinivasan A unified approach to scheduling on unrelated parallel machines. Journal of Journal of the Association of Computing Machinery (JACM) , 56(5), 2009.
  • S. Eubank, H. Guclu, V.S. Anil Kumar, M. Marathe, A. Srinivasan, Z. Toroczkai and N. Wang Modelling disease outbreaks in realistic urban social networks. Nature, 429(6998): 180-184, 2004.
  • V.S. Anil Kumar, M. Marathe, S. Parthasarathy and A. Srinivasan. Algorithmic aspects of capacity in wireless networks, Proceedings of the ACM International Conference on Measurements and Modeling of Computer Systems (SIGMETRICS), 33: 133-144, 2005.
  • M. Khan, G. Pandurangan, V.S. Anil Kumar. Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks, Proceedings of IEEE Transactions on Parallel and Distributed Systems,, 20(1): 124-139, 2009.
  • Y. Choi, M. Khan, V.S. Anil Kumar, G. Pandurangan. Energy-Optimal Distributed Algorithms for Minimum Spanning Trees. Journal of Selected Areas in Communications Vol 27(6): 188-190, 2009.
  • K. Bisset, J. Chen, X. Feng, V.S. Anil Kumar, M. Marathe, EpiFast: A fast algorithm for large scale realistic epidemic simulations on distributed memory systems In Proceedings of 23rd ACM International Conference on Supercomputing (ICS'09) , Austin, Texas, 2009.
  • C. Barrett, R. Beckman, M. Khan, V.S. Anil Kumar, M. Marathe, P. Stretz, T. Dutta, B. Lewis. Generation and Analysis of Large Synthetic Social Contact Networks. In Proceedings of the Winter Simulation Conference, Austin, Texas, 2009.
  • M. Khan, V.S. Anil Kumar, M. Marathe, G. Pandurangan and S.S. Ravi. Bi-Criteria approximation algorithms for power-efficient and low-interference topology control in unreliable ad hoc networks 28th IEEE International Conference on Computer Communications (INFOCOM)> , Rio De Janeiro, Brazil
  • D. Chafekar, D. Levin, V.S. Anil Kumar, M. Marathe, S. Parthasarathy, A. Srinivasan. Capacity of asynchronous random-access scheduling in wireless networks. In Proceedings of 27th IEEE International Conference on Computer Communications (INFOCOM), pp 1148-1156, Phoneix, Arizona.
    • li> D. Chafekar, V.S. Anil Kumar, M. Marathe, S. Parthasarathy and A. Srinivasan. Approximating the capacity of wireless networks with SINR constraints. In Proceedings of the 27th IEEE International Conference on Computer Communications (INFOCOM), 1166-1174, Phoenix, Arizona, 2008.
  • Y. Choi, M. Khan, V.S. Anil Kumar, G. Pandurangan. Energy-Optimal Distributed Algorithm for Minimum Spanning Tree. 20th ACM Symposium on Parallelism in Algorithms and Architectures ; Munich, Germany, 2008 (Brief Announcement).
  • M. Halloran, N. Ferguson, S. Eubank, I. Longini Jr, D. Cummings, B. Lewis, S. Xu, C. Fraser, A. Vullikanti, T. Germann, D. Wagener, R. Beckman, K. Kadau, C. Barrett, C. Macken, D. Burke, P. Cooley, Modeling targeted layered containment of an influenza pandemic in the United States. In PNAS, March 10, 2008.
  • V.S. Anil Kumar, M. Marathe, S. Parthasarathy and A. Srinivasan, Scheduling on unrelated machines under tree-like precedence constraints. Algorithmica, 55(1): 205-206, 2009.
  • D.Chafekar, V.S. Anil Kumar, M. Marathe, S. Parthasarathy and A. Srinivasan. Cross-layer latency minimization in wireless networks with SINR constraints. . In Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing,pp 110-119, Montreal, Quebec, Canada, 2007.