Anil Vullikanti
Assistant Professor, Department of Computer Science, and Senior Research Associate, Virginia Bioinformatics Institute, Virginia TechProfessional Preparation
- Postdoctoral Associate, Los Alamos National Laboratory, 2003
- Postdoctoral Associate, Max-Planck Institute for Computer Science, Saarbrücken, Germany, 2001
- 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
- Modeling and simulation of social and infrastructure systems
- Epidemiology
- Distributed and mobile computing
- Combinatorial optimization
- Combinatorial algorithms
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
(Name appears as V.S. Anil Kumar on publications)- K. Channakeshava, D. Chafekar, K. Bisset, VS Anil Kumar, and M. Marathe EpiNet:A Simulation Framework to Study the Spread of Malware in Wirless Networks In Proceedings 2nd International Conference on Simulation Tools & Techniques (SIMUTools'09), 2009.
- K. Atkins, J. Chen, A. Kumar and A. Marathe. The Structure of Electrical Networks: a Graph Theory Based Analysis. International Journal of Critical Infrastructures , 5, 2009:265-284.
- K. Atkins, J. Chen, A. Kumar, M.. Macauley and A. Marathe. Locational Market Power in Network Constrained Markets Journal of Economic Behavior and Organization, 70 (1-2) 2009:416-430.
- M. Khan, G. Pandurangan, and A. Kumar. Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks, Proceedings of IEEE Transactions on Parallel and Distributed Systems,, 20(1) pp 124-139, 2009.
- Y. Choi, M. Khan, A. Kumar and G. Pandurangan. Energy-Optimal Distributed Algorithms for Minimum Spanning Trees. Journal of Selected Areas in Communications Vol 27(6), 2009:188-190.
- C. Barrett, B. Lewis, J. Chen, V.S. Anil Kumar, S. Eubank and M. Marathe. Interactions among human behavior, social networks, and societal infrastructures: A case study in computational epidemiology. In Ravi, S. and Shukla, S. (eds.), Fundamental Problems in Computing: Essays in Honor of Professor Daniel J. Rosenkrantz. Springer Verlag, Vol.XXII 2009.
- K. Bisset, J. Chen, X. Feng, VS Anil Kumar and 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) , 2009:430-439.
- M. Khan, VS Kumar, M. Marthe, G. Pandurangan and SS Ravi.
Approximation Algorithms for Power-Efficient and Low-Interference Topology Control in Unreliable Ad hoc Networks
In 28th Conference on Computer Communications (INFOCOM), In press 2009.
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. Proceedings of INFOCOM, 2008, 27th Conference of Computer Communications, 1148-1156.
- D. Chafekar, V.S. Anil Kumar, M. Marathe, S. Parthasarathy and A. Srinivasan. Approximation Algorithms for Computing Capacity of Wireless Networks with SINR constraints. Proceedings of INFOCOM, 2008, 27th Conference of Computer Communications, 1166-1174.
- Y. Chi Y, M. Khan, VS. Anil Kumar, G. Endurances(2008). Energy-Optimal Distributed Algorithm for Minimum Spanning Tree. 20th ACM Symposium on Parallelism in Algorithms and Architectures ; June 14-16, 2008; Munich, Germany.
- K. Atkins, C.L. Barrett, R. Beckman, K. Bisset, J. Chen, S. Eubank, A. Feng, X. Feng, S. Harris, B. Lewis, AVS Kumar, M. Marathe, A. Marathe, H. Mortveit, and P. Stretz. An Interaction Based Composable Architecture for Building Scalable Models of Large Social, Biological, Information and Technical Systems. CT Watch, 4, 2008:46-53.
- 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.
- VSA Kumar, M. Marathe, S. Parthasarathy, and A. Srinivasan. Minimum weighted completion time. Encyclopedia of Algorithms, 2008:1-99, Springer.
- D. Chafekar, D. Levin, V.S. Anil Kumar, M. Marathe, S. Parthasarathy and A. Srinivasan. Capacity of asynchronous Random-Access Scheduling in Wireless Networks. Proceedings of INFOCOM, 2008, 27th Conference of Computer Communications, 1148-1156.
- D. Chafekar, V.S. Anil Kumar, M. Marathe, S. Parthasarathy and A. Srinivasan.
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR constraints.
Proceedings of INFOCOM, 2008, 27th Conference of Computer Communications, 1166-1174.
2007
- D. Chafekar, V.S. Anil Kumar, M. Marathe, S. Parathasarathy and A. Srinivasan. Cross-Layer latency minimization for wireless networks with SINR constraints. Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing, 2007:110-119.
- 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.
2006
- 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.
- 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.
2005
- 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.
2004
- 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.
2003
- V.S. Anil Kumar and R. Hariharan.
Covering rectilinear polygons with axis-parallel rectangles.
SIAM Journal of Computing, 32(6), 2003:1509-1541.
2001
- 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.