V. S. Anil Kumar - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

2010

Finding Critical Nodes for Inhibiting Diffusion of Complex Contagions in Social NetworksChris J. Kuhlman, V. S. Anil Kumar, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz. pkdd 2010: 111-127 [doi]

Existence Theorems and Approximation Algorithms for Generalized Network Security GamesV. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun, Ravi Sundaram. icdcs 2010: 348-357 [doi]

Wireless Algorithms, Systems, and Applications, 5th International Conference, WASA 2010, Beijing, China, August 15-17, 2010. ProceedingsGopal Pandurangan, V. S. Anil Kumar, Gu Ming, Yunhao Liu, Yingshu Li, editors, Volume 6221 of Lecture Notes in Computer Science, Springer, 2010. [doi]

On Strategy Improvement Algorithms for Simple Stochastic GamesRahul Tripathi, Elena Valkanova, V. S. Anil Kumar. ciac 2010: 240-251 [doi]

Subgraph Enumeration in Large Social Contact Networks Using Parallel Color Coding and StreamingZhao Zhao, Maleq Khan, V. S. Anil Kumar, Madhav V. Marathe. icpp 2010: 594-603 [doi]

2009

Computational Epidemiology in a Connected WorldAndrea Apolloni, V. S. Anil Kumar, Madhav V. Marathe, Samarth Swarup. Computer, 42(11):83-86, 2009. [doi]

The structure of electrical networks: a graph theory based analysisKarla Atkins, Jiangzhuo Chen, V. S. Anil Kumar, Achla Marathe. ijcritis, 5(3):265-284, 2009. [doi]

Generation and Analysis of Large Synthetic Social Contact NetworksChristopher L. Barrett, Richard J. Beckman, Maleq Khan, V. S. Anil Kumar, Madhav V. Marathe, Paula Elaine Stretz, Tridib Dutta, Bryan Lewis. wsc 2009: 1003-1014 [doi]

EpiFast: a fast algorithm for large scale realistic epidemic simulations on distributed memory systemsKeith R. Bisset, Jiangzhuo Chen, Xizhou Feng, V. S. Anil Kumar, Madhav V. Marathe. ics 2009: 430-439 [doi]

EpiNet: a simulation framework to study the spread of malware in wireless networksKarthik Channakeshava, Deepti Chafekar, Keith R. Bisset, V. S. Anil Kumar, Madhav V. Marathe. simutools 2009: 6 [doi]

Energy-Optimal Distributed Algorithms for Minimum Spanning TreesYongwook Choi, Gopal Pandurangan, Maleq Khan, V. S. Anil Kumar. jsac, 27(7):1297-1304, 2009. [doi]

Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio NetworksBo Han, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Anand Srinivasan. infocom 2009: 1521-1529 [doi]

Bi-Criteria Approximation Algorithms for Power-Efficient and Low-Interference Topology Control in Unreliable Ad Hoc NetworksMaleq Khan, V. S. Anil Kumar, Madhav V. Marathe, Gopal Pandurangan, S. S. Ravi. infocom 2009: 370-378 [doi]

Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor NetworksMaleq Khan, Gopal Pandurangan, V. S. Anil Kumar. tpds, 20(1):124-139, 2009. [doi]

Scheduling on Unrelated Machines under Tree-Like Precedence ConstraintsV. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan. algorithmica, 55(1):205-226, 2009. [doi]

Limit Set Reachability in Asynchronous Graph Dynamical SystemsV. S. Anil Kumar, Matt Macauley, Henning S. Mortveit. rp 2009: 217-232 [doi]

A unified approach to scheduling on unrelated parallel machinesV. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan. JACM, 56(5), 2009. [doi]

2008

2007

2006

2005

2004

2003

The algorithmics of folding proteins on latticesVijay Chandru, Abhi Dattasharma, V. S. Anil Kumar. DAM, 127(1):145-161, 2003.

Equilibria in topology control games for ad hoc networksStephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust. dialm 2003: 2-11 [doi]

Covering Rectilinear Polygons with Axis-Parallel RectanglesV. S. Anil Kumar, H. Ramesh. siamcomp, 32(6):1509-1541, 2003. [doi]

2002

Improved Results for Stackelberg Scheduling StrategiesV. S. Anil Kumar, Madhav V. Marathe. icalp 2002: 776-787 [doi]

2001

Optimal constrained graph explorationChristian A. Duncan, Stephen G. Kobourov, V. S. Anil Kumar. soda 2001: 807-814 [doi]

Approximation Algorithms for Minimum Size 2-Connectivity ProblemsPiotr Krysta, V. S. Anil Kumar. STACS 2001: 431-442 [doi]

Coupling vs. conductance for the Jerrum-Sinclair chainV. S. Anil Kumar, H. Ramesh. rsa, 18(1):1-17, 2001.

2000

Hardness of Set Cover with Intersection 1V. S. Anil Kumar, Sunil Arya, H. Ramesh. icalp 2000: 624-635 [doi]

1999

Covering Rectilinear Polygons with Axis-Parallel RectanglesV. S. Anil Kumar, H. Ramesh. stoc 1999: 445-454 [doi]

Markovian Coupling vs. Conductance for the Jerrum-Sinclair ChainV. S. Anil Kumar, H. Ramesh. focs 1999: 241-252 [doi]