V. S. Anil Kumar Vis

*	2009
36	EE	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
35	EE	V. S. Anil Kumar, Matt Macauley, Henning S. Mortveit: Limit Set Reachability in Asynchronous Graph Dynamical Systems. RP 2009: 217-232
34	EE	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
33	EE	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)
32	EE	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)
31	EE	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)
30	EE	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
29	EE	Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy: Power Efficient Throughput Maximization in Multi-Hop Wireless Networks. GLOBECOM 2008: 4895-4900
28	EE	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
27	EE	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
26	EE	Yongwook Choi, Maleq Khan, V. S. Anil Kumar, Gopal Pandurangan: Energy-optimal distributed algorithms for minimum spanning trees. SPAA 2008: 188-190
25	EE	V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: Minimum Weighted Completion Time. Encyclopedia of Algorithms 2008
	2007
24	EE	Stephen Eubank, V. S. Anil Kumar, Madhav V. Marathe: Epidemiology and Wireless Communication: Tight Analogy or Loose Metaphor?. BIOWIRE 2007: 91-104
23	EE	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
22	EE	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
21	EE	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
20	EE	Christian A. Duncan, Stephen G. Kobourov, V. S. Anil Kumar: Optimal constrained graph exploration. ACM Transactions on Algorithms 2(3): 380-402 (2006)
19	EE	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)
18	EE	Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust: Equilibria in Topology Control Games for Ad Hoc Networks. MONET 11(2): 143-159 (2006)
	2005
17	EE	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
16	EE	V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: Approximation Algorithms for Scheduling on Multiple Machines. FOCS 2005: 254-263
15	EE	V. S. Anil Kumar, Srinivasan Parthasarathy, Madhav V. Marathe, Aravind Srinivasan, Sibylle Zust: Provable Algorithms for Parallel Sweep Scheduling on Unstructured Meshes. IPDPS 2005
14	EE	V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan: Algorithmic aspects of capacity in wireless networks. SIGMETRICS 2005: 133-144
	2004
13	EE	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	EE	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	EE	H. 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	EE	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	EE	V. S. Anil Kumar, H. Ramesh: Covering Rectilinear Polygons with Axis-Parallel Rectangles. SIAM J. Comput. 32(6): 1509-1541 (2003)
	2002
7	EE	V. S. Anil Kumar, Madhav V. Marathe: Improved Results for Stackelberg Scheduling Strategies. ICALP 2002: 776-787
	2001
6	EE	Christian A. Duncan, Stephen G. Kobourov, V. S. Anil Kumar: Optimal constrained graph exploration. SODA 2001: 807-814
5	EE	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	EE	V. S. Anil Kumar, Sunil Arya, H. Ramesh: Hardness of Set Cover with Intersection 1. ICALP 2000: 624-635
	1999
2	EE	V. S. Anil Kumar, H. Ramesh: Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain. FOCS 1999: 241-252
1	EE	V. S. Anil Kumar, H. Ramesh: Covering Rectilinear Polygons with Axis-Parallel Rectangles. STOC 1999: 445-454

Coauthor Index

1	Sunil Arya	[3]
2	H. Balakrishnan	[11]
3	Christopher L. Barrett	[11] [21]
4	Keith R. Bisset	[34] [36]
5	Deepti Chafekar	[23] [27] [28] [29] [34]
6	Vijay Chandru (Vijaya Chandru)	[9]
7	Karthik Channakeshava	[34]
8	Jiangzhuo Chen	[36]
9	Yongwook Choi	[26] [32]
10	Abhi Dattasharma	[9]
11	Christian A. Duncan	[6] [20]
12	Stephan Eidenbenz	[10] [18]
13	Stephen Eubank	[12] [24]
14	Xizhou Feng	[36]
15	Gabriel Istrate	[21]
16	Maleq Khan	[22] [26] [31] [32]
17	Stephen G. Kobourov	[6] [20]
18	Piotr Krysta	[5]
19	Dave Levin	[28]
20	Matt Macauley	[35]
21	Madhav V. Marathe	[7] [11] [12] [13] [14] [15] [16] [17] [19] [21] [23] [24] [25] [27] [28] [29] [30] [33] [34] [36]
22	Henning S. Mortveit	[35]
23	Gopal Pandurangan	[22] [26] [31] [32]
24	Srinivasan Parthasarathy	[13] [14] [15] [16] [17] [19] [23] [25] [27] [28] [29] [30] [33]
25	H. Ramesh	[1] [2] [3] [4] [8]
26	Aravind Srinivasan	[12] [13] [14] [15] [16] [17] [19] [23] [25] [27] [28] [30] [33]
27	Shripad Thite	[11] [21]
28	Nan Wang	[12]
29	Sibylle Zust	[10] [15] [18] [19]

Colors in the list of coauthors