V. S. Anil Kumar

Publication Activity (10 Years)

Years Active: 1999-2016
Publications (10 Years): 4

Top Topics

Minimum Spanning Trees

Manual Labeling

Social Networks

Top Venues

IEEE Trans. Mob. Comput.

ACM Trans. Algorithms

Publications

V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
Distributed Algorithms for End-to-End Packet Scheduling in Wireless Ad Hoc Networks. ACM Trans. Algorithms 12 (3) (2016)
Tridib Dutta, Lenwood S. Heath, V. S. Anil Kumar, Madhav V. Marathe
Labeled cuts in graphs. Theor. Comput. Sci. 648 (2016)
Jiangzhuo Chen, V. S. Anil Kumar, Madhav V. Marathe, Ravi Sundaram, Mayur Thakur, Sunil Thulasidasan
A study of the structure and vulnerabilities of metropolitan area networks. COMSNETS (2016)
Chris J. Kuhlman, V. S. Anil Kumar, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz
Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results. Data Min. Knowl. Discov. 29 (2) (2015)
Chris J. Kuhlman, V. S. Anil Kumar, S. S. Ravi
Controlling opinion propagation in online networks. Comput. Networks 57 (10) (2013)
Chris J. Kuhlman, V. S. Anil Kumar, S. S. Ravi
Controlling opinion bias in online social networks. WebSci (2012)
Maleq Khan, V. S. Anil Kumar, Gopal Pandurangan, Guanhong Pei
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model CoRR (2012)
Bo Han, Pan Hui, V. S. Anil Kumar, Madhav V. Marathe, Jianhua Shao, Aravind Srinivasan
Mobile Data Offloading through Opportunistic Communications and Social Participation. IEEE Trans. Mob. Comput. 11 (5) (2012)
Christopher L. Barrett, Richard J. Beckman, Keith R. Bisset, Jiangzhuo Chen, Thomas M. DuBois, Stephen G. Eubank, V. S. Anil Kumar, Bryan L. Lewis, Madhav V. Marathe, Aravind Srinivasan, Paula Elaine Stretz
Optimizing epidemic protection for socially essential workers. IHI (2012)
Zhao Zhao, Guanying Wang, Ali Raza Butt, Maleq Khan, V. S. Anil Kumar, Madhav V. Marathe
SAHAD: Subgraph Analysis in Massive Networks Using Hadoop. IPDPS (2012)
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
Capacity of wireless networks under SINR interference constraints. Wirel. Networks 17 (7) (2011)
Keith R. Bisset, Jiangzhuo Chen, Chris J. Kuhlman, V. S. Anil Kumar, Madhav V. Marathe
Interaction-based HPC modeling of social, biological, and economic contagions over large networks. WSC (2011)
Christopher James Kuhlman, V. S. Anil Kumar, Madhav V. Marathe, Samarth Swarup, Gaurav Tuli, S. S. Ravi, Daniel J. Rosenkrantz
Inhibiting the Diffusion of Contagions in Bi-Threshold Systems: Analytical and Experimental Results. AAAI Fall Symposium: Complex Adaptive Systems (2011)
Chris J. Kuhlman, Henning S. Mortveit, David Murrugarra, V. S. Anil Kumar
Bifurcations in Boolean Networks. Automata (2011)
Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar
On strategy improvement algorithms for simple stochastic games. J. Discrete Algorithms 9 (3) (2011)
Karthik Channakeshava, Keith R. Bisset, V. S. Anil Kumar, Madhav V. Marathe, Shrirang M. Yardi
High Performance Scalable and Expressive Modeling Environment to Study Mobile Malware in Large Dynamic Networks. IPDPS (2011)
Chris J. Kuhlman, V. S. Anil Kumar, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz
Effects of Opposition on the Diffusion of Complex Contagions in Social Networks: An Empirical Study. SBP (2011)
Chris J. Kuhlman, V. S. Anil Kumar, Madhav V. Marathe, Henning S. Mortveit, Samarth Swarup, Gaurav Tuli, S. S. Ravi, Daniel J. Rosenkrantz
A general-purpose graph dynamical system modeling framework. WSC (2011)
Christopher L. Barrett, Karthik Channakeshava, Stephen G. Eubank, V. S. Anil Kumar, Madhav V. Marathe
From biological and social network metaphors to coupled bio-social wireless networks. Int. J. Auton. Adapt. Commun. Syst. 4 (2) (2011)
Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar
On Strategy Improvement Algorithms for Simple Stochastic Games. CIAC (2010)
Chris J. Kuhlman, V. S. Anil Kumar, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz
Finding Critical Nodes for Inhibiting Diffusion of Complex Contagions in Social Networks. ECML/PKDD (2) (2010)
Bo Han, Pan Hui, V. S. Anil Kumar, Madhav V. Marathe, Guanhong Pei, Aravind Srinivasan
Cellular traffic offloading through opportunistic communications: a case study. CHANTS@MobiCom (2010)
Zhao Zhao, Maleq Khan, V. S. Anil Kumar, Madhav V. Marathe
Subgraph Enumeration in Large Social Contact Networks Using Parallel Color Coding and Streaming. ICPP (2010)
Bo Han, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks. INFOCOM (2009)
Karthik Channakeshava, Deepti Chafekar, Keith R. Bisset, V. S. Anil Kumar, Madhav V. Marathe
EpiNet: a simulation framework to study the spread of malware in wireless networks. SimuTools (2009)
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
Scheduling on Unrelated Machines under Tree-Like Precedence Constraints. Algorithmica 55 (1) (2009)
Yongwook Choi, Gopal Pandurangan, Maleq Khan, V. S. Anil Kumar
Energy-Optimal Distributed Algorithms for Minimum Spanning Trees. IEEE J. Sel. Areas Commun. 27 (7) (2009)
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
A unified approach to scheduling on unrelated parallel machines. J. ACM 56 (5) (2009)
Maleq Khan, V. S. Anil Kumar, Madhav V. Marathe, Gopal Pandurangan, S. S. Ravi
Bi-Criteria Approximation Algorithms for Power-Efficient and Low-Interference Topology Control in Unreliable Ad Hoc Networks. INFOCOM (2009)
Keith R. Bisset, Jiangzhuo Chen, Xizhou Feng, V. S. Anil Kumar, Madhav V. Marathe
EpiFast: a fast algorithm for large scale realistic epidemic simulations on distributed memory systems. ICS (2009)
Christopher L. Barrett, Richard J. Beckman, Maleq Khan, V. S. Anil Kumar, Madhav V. Marathe, Paula Elaine Stretz, Tridib Dutta, Bryan L. Lewis
Generation and Analysis of Large Synthetic Social Contact Networks. WSC (2009)
Maleq Khan, Gopal Pandurangan, V. S. Anil Kumar
Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks. IEEE Trans. Parallel Distributed Syst. 20 (1) (2009)
Andrea Apolloni, V. S. Anil Kumar, Madhav V. Marathe, Samarth Swarup
Computational Epidemiology in a Connected World. Computer 42 (11) (2009)
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints. INFOCOM (2008)
Deepti Chafekar, Dave Levin, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
Capacity of Asynchronous Random-Access Scheduling in Wireless Networks. INFOCOM (2008)
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy
Power Efficient Throughput Maximization in Multi-Hop Wireless Networks. GLOBECOM (2008)
Yongwook Choi, Maleq Khan, V. S. Anil Kumar, Gopal Pandurangan
Energy-optimal distributed algorithms for minimum spanning trees. SPAA (2008)
Maleq Khan, Gopal Pandurangan, V. S. Anil Kumar
A simple randomized scheme for constructing low-weight k-connected spanning subgraphs with applications to distributed algorithms. Theor. Comput. Sci. 385 (1-3) (2007)
Stephen G. Eubank, V. S. Anil Kumar, Madhav V. Marathe
Epidemiology and Wireless Communication: Tight Analogy or Loose Metaphor?. BIOWIRE (2007)
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
Cross-layer latency minimization in wireless networks with SINR constraints. MobiHoc (2007)
Christian A. Duncan, Stephen G. Kobourov, V. S. Anil Kumar
Optimal constrained graph exploration. ACM Trans. Algorithms 2 (3) (2006)
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan, Sibylle Zust
Provable algorithms for parallel generalized sweep scheduling. J. Parallel Distributed Comput. 66 (6) (2006)
Christopher L. Barrett, V. S. Anil Kumar, Madhav V. Marathe, Shripad Thite, Gabriel Istrate
Strong Edge Coloring for Channel Assignment in Wireless Radio Networks. PerCom Workshops (2006)
Christopher L. Barrett, Martin Drozda, D. Charles Engelhart, V. S. Anil Kumar, Madhav V. Marathe, Monique Morin, S. S. Ravi, James P. Smith
Understanding protocol performance and robustness of ad hoc networks through structural analysis. WiMob (3) (2005)
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
Approximation Algorithms for Scheduling on Multiple Machines. FOCS (2005)
V. S. Anil Kumar, Srinivasan Parthasarathy, Madhav V. Marathe, Aravind Srinivasan, Sibylle Zust
Provable Algorithms for Parallel Sweep Scheduling on Unstructured Meshes. IPDPS (2005)
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints. APPROX-RANDOM (2005)
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
Algorithmic aspects of capacity in wireless networks. SIGMETRICS (2005)
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
End-to-end packet-scheduling in wireless ad-hoc networks. SODA (2004)
Hari Balakrishnan, Christopher L. Barrett, V. S. Anil Kumar, Madhav V. Marathe, Shripad Thite
The distance-2 matching problem and its relationship to the MAC-Layer capacity of ad hoc wireless networks. IEEE J. Sel. Areas Commun. 22 (6) (2004)
Stephen G. Eubank, V. S. Anil Kumar, Madhav V. Marathe, Aravind Srinivasan, Nan Wang
Structural and algorithmic aspects of massive social networks. SODA (2004)
Stephen G. Eubank, V. S. Anil Kumar, Madhav V. Marathe, Aravind Srinivasan, Nan Wang
Structure of Social Contact Networks and Their Impact on Epidemics. Discrete Methods in Epidemiology (2004)
V. S. Anil Kumar, H. Ramesh
Covering Rectilinear Polygons with Axis-Parallel Rectangles. SIAM J. Comput. 32 (6) (2003)
V. S. Anil Kumar, Madhav V. Marathe
Improved Results for Stackelberg Scheduling Strategies. ICALP (2002)
Christian A. Duncan, Stephen G. Kobourov, V. S. Anil Kumar
Optimal constrained graph exploration. SODA (2001)
V. S. Anil Kumar, H. Ramesh
Coupling vs. conductance for the Jerrum-Sinclair chain. Random Struct. Algorithms 18 (1) (2001)
V. S. Anil Kumar, Sunil Arya, H. Ramesh
Hardness of Set Cover with Intersection 1. ICALP (2000)
V. S. Anil Kumar, H. Ramesh
Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain. FOCS (1999)
V. S. Anil Kumar, H. Ramesh
Covering Rectilinear Polygons with Axis-Parallel Rectangles. STOC (1999)