![]() | ![]() |
| 2012 | ||
|---|---|---|
| 58 | Christopher L. Barrett, Richard J. Beckman, Keith R. Bisset, Jiangzhuo Chen, Thomas DuBois, Stephen Eubank, V. S. Anil Kumar, Bryan Lewis, Madhav V. Marathe, Aravind Srinivasan, Paula Elaine Stretz: Optimizing epidemic protection for socially essential workers. IHI 2012: 31-40 | |
| 57 | 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): 821-834 (2012) | |
| 2011 | ||
| 56 | Guanhong Pei, V. S. Anil Kumar, Srinivasan Parthasarathy, Aravind Srinivasan: Approximation algorithms for throughput maximization in wireless networks with delay constraints. INFOCOM 2011: 1116-1124 | |
| 55 | 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: 770-781 | |
| 54 | 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: 188-196 | |
| 53 | Maleq Khan, V. S. Anil Kumar, Madhav V. Marathe, Paula Elaine Stretz: Social Networks. Encyclopedia of Parallel Computing 2011: 1842-1848 | |
| 52 | Amitabha Ghosh, Özlem Durmaz Incel, V. S. Anil Kumar, Bhaskar Krishnamachari: Multichannel Scheduling and Spanning Trees: Throughput-Delay Tradeoff for Fast Data Collection in Sensor Networks. IEEE/ACM Trans. Netw. 19(6): 1731-1744 (2011) | |
| 51 | Christopher L. Barrett, Karthik Channakeshava, Stephen Eubank, V. S. Anil Kumar, Madhav V. Marathe: From biological and social network metaphors to coupled bio-social wireless networks. IJAACS 4(2): 122-144 (2011) | |
| 50 | Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar: On strategy improvement algorithms for simple stochastic games. J. Discrete Algorithms 9(3): 263-278 (2011) | |
| 49 | Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: Capacity of wireless networks under SINR interference constraints. Wireless Networks 17(7): 1605-1624 (2011) | |
| 2010 | ||
| 48 | Gopal Pandurangan, V. S. Anil Kumar, Gu Ming, Yunhao Liu, Yingshu Li: Wireless Algorithms, Systems, and Applications, 5th International Conference, WASA 2010, Beijing, China, August 15-17, 2010. Proceedings Springer 2010 | |
| 47 | Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar: On Strategy Improvement Algorithms for Simple Stochastic Games. CIAC 2010: 240-251 | |
| 46 | 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: 111-127 | |
| 45 | V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun, Ravi Sundaram: Existence Theorems and Approximation Algorithms for Generalized Network Security Games. ICDCS 2010: 348-357 | |
| 44 | 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: 594-603 | |
| 43 | Pai-Han Huang, Ying Chen, Bhaskar Krishnamachari, V. S. Anil Kumar: Link Scheduling in a Single Broadcast Domain Underwater Networks. SUTC/UMC 2010: 205-212 | |
| 2009 | ||
| 42 | 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: 430-439 | |
| 41 | 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: 1521-1529 | |
| 40 | 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: 370-378 | |
| 39 | V. S. Anil Kumar, Matthew Macauley, Henning S. Mortveit: Limit Set Reachability in Asynchronous Graph Dynamical Systems. RP 2009: 217-232 | |
| 38 | 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: 6 | |
| 37 | Christopher L. Barrett, Richard J. Beckman, Maleq Khan, V. S. Anil Kumar, Madhav V. Marathe, Paula Elaine Stretz, Tridib Dutta, Bryan Lewis: Generation and Analysis of Large Synthetic Social Contact Networks. Winter Simulation Conference 2009: 1003-1014 | |
| 36 | V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: Scheduling on Unrelated Machines under Tree-Like Precedence Constraints. Algorithmica 55(1): 205-226 (2009) | |
| 35 | Andrea Apolloni, V. S. Anil Kumar, Madhav V. Marathe, Samarth Swarup: Computational Epidemiology in a Connected World. IEEE Computer 42(11): 83-86 (2009) | |
| 34 | Yongwook Choi, Gopal Pandurangan, Maleq Khan, V. S. Anil Kumar: Energy-Optimal Distributed Algorithms for Minimum Spanning Trees. IEEE Journal on Selected Areas in Communications 27(7): 1297-1304 (2009) | |
| 33 | Maleq Khan, Gopal Pandurangan, V. S. Anil Kumar: Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks. IEEE Trans. Parallel Distrib. Syst. 20(1): 124-139 (2009) | |
| 32 | Karla Atkins, Jiangzhuo Chen, V. S. Anil Kumar, Achla Marathe: The structure of electrical networks: a graph theory based analysis. IJCIS 5(3): 265-284 (2009) | |
| 31 | 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) | |
| 2008 | ||
| 30 | Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy: Power Efficient Throughput Maximization in Multi-Hop Wireless Networks. GLOBECOM 2008: 4895-4900 | |
| 29 | 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: 1148-1156 | |
| 28 | 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: 1166-1174 | |
| 27 | Yongwook Choi, Maleq Khan, V. S. Anil Kumar, Gopal Pandurangan: Energy-optimal distributed algorithms for minimum spanning trees. SPAA 2008: 188-190 | |
| 26 | V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: Minimum Weighted Completion Time. Encyclopedia of Algorithms 2008 | |
| 2007 | ||
| 25 | Stephen Eubank, V. S. Anil Kumar, Madhav V. Marathe: Epidemiology and Wireless Communication: Tight Analogy or Loose Metaphor?. BIOWIRE 2007: 91-104 | |
| 24 | 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: 110-119 | |
| 23 | 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): 101-114 (2007) | |
| 2006 | ||
| 22 | 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: 106-110 | |
| 21 | Christian A. Duncan, Stephen G. Kobourov, V. S. Anil Kumar: Optimal constrained graph exploration. ACM Transactions on Algorithms 2(3): 380-402 (2006) | |
| 20 | V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan, Sibylle Zust: Provable algorithms for parallel generalized sweep scheduling. J. Parallel Distrib. Comput. 66(6): 807-821 (2006) | |
| 19 | Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust: Equilibria in Topology Control Games for Ad Hoc Networks. MONET 11(2): 143-159 (2006) | |
| 2005 | ||
| 18 | V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints. APPROX-RANDOM 2005: 146-157 | |
| 17 | V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: Approximation Algorithms for Scheduling on Multiple Machines. FOCS 2005: 254-263 | |
| 16 | V. S. Anil Kumar, Srinivasan Parthasarathy, Madhav V. Marathe, Aravind Srinivasan, Sibylle Zust: Provable Algorithms for Parallel Sweep Scheduling on Unstructured Meshes. IPDPS 2005 | |
| 15 | V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: Algorithmic aspects of capacity in wireless networks. SIGMETRICS 2005: 133-144 | |
| 14 | 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: 65-72 | |
| 2004 | ||
| 13 | V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: End-to-end packet-scheduling in wireless ad-hoc networks. SODA 2004: 1021-1030 | |
| 12 | Stephen Eubank, V. S. Anil Kumar, Madhav V. Marathe, Aravind Srinivasan, Nan Wang: Structural and algorithmic aspects of massive social networks. SODA 2004: 718-727 | |
| 11 | 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 Journal on Selected Areas in Communications 22(6): 1069-1079 (2004) | |
| 2003 | ||
| 10 | Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust: Equilibria in topology control games for ad hoc networks. DIALM-POMC 2003: 2-11 | |
| 9 | Vijay Chandru, Abhi Dattasharma, V. S. Anil Kumar: The algorithmics of folding proteins on lattices. Discrete Applied Mathematics 127(1): 145-161 (2003) | |
| 8 | V. S. Anil Kumar, H. Ramesh: Covering Rectilinear Polygons with Axis-Parallel Rectangles. SIAM J. Comput. 32(6): 1509-1541 (2003) | |
| 2002 | ||
| 7 | V. S. Anil Kumar, Madhav V. Marathe: Improved Results for Stackelberg Scheduling Strategies. ICALP 2002: 776-787 | |
| 2001 | ||
| 6 | Christian A. Duncan, Stephen G. Kobourov, V. S. Anil Kumar: Optimal constrained graph exploration. SODA 2001: 807-814 | |
| 5 | Piotr Krysta, V. S. Anil Kumar: Approximation Algorithms for Minimum Size 2-Connectivity Problems. STACS 2001: 431-442 | |
| 4 | V. S. Anil Kumar, H. Ramesh: Coupling vs. conductance for the Jerrum-Sinclair chain. Random Struct. Algorithms 18(1): 1-17 (2001) | |
| 2000 | ||
| 3 | V. S. Anil Kumar, Sunil Arya, H. Ramesh: Hardness of Set Cover with Intersection 1. ICALP 2000: 624-635 | |
| 1999 | ||
| 2 | V. S. Anil Kumar, H. Ramesh: Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain. FOCS 1999: 241-252 | |
| 1 | V. S. Anil Kumar, H. Ramesh: Covering Rectilinear Polygons with Axis-Parallel Rectangles. STOC 1999: 445-454 | |
Colors in the list of coauthors
Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page