|
|
Journal Publications
A Simple Randomized Scheme for Constructing Low-Weight k-Connected Spanning
Subgraphs with Applications to Distributed Algorithms.
M. Khan, G. Pandurangan and V.S. Anil Kumar.
To appear in the journal Theoretical Computer Science (TCS), (pdf).
Structural Properties of Electrical Networks.
K. Atkins, J. Chen, V.S. Anil Kumar and A. Marathe,
International Journal of Critical Infrastructure, to appear in 2007, (pdf).
Scheduling on Unrelated Machines Under Tree-Like Precedence
Constraints.
V.S. Anil Kumar, M. V. Marathe, S. Parthasarathy and A. Srinivasan,
To appear in Algorithmica, Special issue on selected papers
from APPROX 2005 ,(pdf).
Provable Algorithms for Parallel Generalized Sweep Scheduling.
V.S. Anil Kumar, M. Marathe, S. Parthasarathy, A. Srinivasan and S. Zust.
Journal of Parallel and Distributed Computing, 66(6), 807-821, 2006,(pdf).
Optimal Constrained Graph Exploration.
C. Duncan, S. Kobourov and V.S. Anil Kumar,
Transactions of Algorithms, 2(3), 380-402, 2006, (pdf).
Equilibria in Topology control games for ad hoc networks.
S. Eidenbenz, V.S. Anil Kumar and S. Zust,
Mobile Networks and Applications, 11, 143-159, 2006, (pdf).
Modeling disease outbreaks in realistic urban social networks.
S. Eubank, H. Guclu, V.S. Anil Kumar, M. Marathe, A. Srinivasan,
Z. Toroczkai and N. Wang,
Nature, 429, 180-184 2004.
The distance-2 matching problem and its relationship to the
MAC-layer capacity of ad hoc networks.
H. Balakrishnan, C. Barrett, V. S. Anil Kumar, M. Marathe, S. Thite,
IEEE Journal on Selected Areas in Communication, 22(6), pp 1069-1079, 2004, (pdf).
Covering Rectilinear Polygons with Axis-Parallel Rectangles.
V.S. Anil Kumar, R. Hariharan.
SIAM Journal of Computing, 32(6), pp 1509-1541, 2003, (pdf).
The Algorithmics of Folding Proteins on Lattices.
V. Chandru, A. DuttaSharma, V.S. Anil Kumar.
Discrete Applied Mathematics, 127(1), pp 145-161, 2003.
Markovian Coupling v/s Conductance for the Jerrum-Sinclair Chain.
V.S. Anil Kumar, R. Hariharan.
Random Structures and Algorithms, 18(1), pp. 1-17, 2001, (pdf).
Conference Publications
D. Chafekar, V.S. Anil Kumar, M. Marathe, S. Parthasarathy and A. Srinivasan.
Cross-Layer Latency Minimization in Wireless Networks with SINR Constraints,
To appear in MOBIHOC, 2007, (pdf).
V. S. Anil Kumar, M. Marathe, S. Parthasarathy and A. Srinivasan.
Provable Algorithms for Joint Optimization of Transport, Routing and MAC
layers in Wireless Ad Hoc Networks, DIAL M-POMC, 2007, (pdf).
Model Based Spatial Data Mining for Power Markets.
J. Chen, V.S. Anil Kumar, A. Marathe and K. Atkins,
SIAM-DM 2006 Workshop on Spatial Data Mining,
April 22, 2006.
Structural Properties of Electrical Networks.
K. Atkins, J. Chen, V.S. Anil Kumar and A. Marathe,
3rd International Conference on Critical Infrastructures,
Sept. 25-27, 2006.
Locational Market Power in Power Markets,
K. Atkins, J. Chen, V. S. Anil Kumar, M. Macauley and A. Marathe,
29th IAEE International Conference, June 7-10, 2006, Potsdam, Germany, (pdf).
Strong Edge Coloring for Channel Assignment in Wireless Radio Networks.
C. Barrett, G. Istrate, V. S. Anil Kumar, M. V. Marathe, S. Thite and S. Thulasidasan,
IEEE International Workshop on "Foundation and Algorithms for
Wireless Networking" (FAWN'2006), (pdf).
Approximation Algorithms for Scheduling on Multiple Machines.
V.S. Anil Kumar, M. V. Marathe, S. Parthasarathy and A. Srinivasan,
Proc. of the 46th Annual IEEE Symposium on Foundations
of Computer Science (FOCS), pp. 254-263, 2005, (pdf).
Scaling Laws for the Internet over Urban Regions.
R. Sundaram, V.S. Anil Kumar, M. Marathe, M. Thakur and S. Thulasidasan,
ISMA 2006 WIT: Workshop on the Internet Topology, May 10-12 2006.
Scheduling on Unrelated Machines Under Tree-Like Precedence
Constraints.
V.S. Anil Kumar, M. V. Marathe, S. Parthasarathy and A. Srinivasan,
Proc. op APPROX-RANDOM 2005, Springer
Verlag LNCS, vol 3624, pp. 146-157, 2005, (pdf).
Algorithmic Aspects of Capacity in Wireless Networks.
V.S. Anil Kumar, M. V. Marathe, S. Parthasarathy and A. Srinivasan.
ACM SIGMETRICS, 2005, (pdf).
Provable Algorithms for Parallel Sweep Scheduling on
Unstructured Meshes.
V.S. Anil Kumar, M. Marathe, S. Parthasarathy, A. Srinivasan and S. Zust.
International Parallel and Distributed Processing
Symposium (IPDPS), 2005, (pdf).
End-to-end packet scheduling in ad hoc networks.
V.S. Anil Kumar, M. Marathe, S. Parthasarathy and A. Srinivasan,
ACM Symposium on Discrete Algorithms (SODA), 1021-1030, 2004, (pdf).
Structural and Algorithmic aspects of massive social networks.
S. Eubank, V.S. Anil Kumar, M. Marathe, A. Srinivasan and N. Wang,
ACM Symposium on Discrete Algorithms (SODA), 2004, (pdf).
Understanding Protocol Performance and Robustness of
Ad~hoc Networks Through Structural Analysis,
C. Barrett, M. Drozda, D. Engelhart, V. S. Anil Kumar,
M. Marathe, M. Morin, S. S. Ravi and J. P. Smith,
Proc. International Conference on Wireless and Mobile Computing,
Networking and Communications (WiMob 2005), pp. 65-72, 2005, (pdf).
Equilibria in Topology control games for ad hoc networks.
S. Eidenbenz, V.S. Anil Kumar and S. Zust,
Appeared in the proceedings of the Workshop on
Discrete Algorithms and Methods for Mobile
Computing and Communications and Principles of Mobile Computing (DIAL-POMC),
Sept 2003.
Improved Results for Stackelberg Scheduling Strategies.
V.S.\ Anil Kumar, Madhav Marathe.
The 29th International Colloquium on
Automata, Languages and Programming, 2002 (ICALP), Lecture Notes in
Computer Science, 2380, Springer, pp 776-787, (pdf).
Optimal Constrained Graph Exploration.
Christian Duncan, Stephen Kobourov and V.S.\ Anil Kumar.
Proceedings of the 12th ACM Symposium on Discrete Algorithms (SODA), pp 807-814, 2001.
Approximation algorithms for minimum size 2-connectivity problems.
Piotr Krysta and V.S.\ Anil Kumar.
Proceedings of the 18th International Symposium on Theoretical
Aspects of Computer Science (STACS), Lecture Notes in Computer
Science, n. 2010, Springer, pp 431-442, 2001.
Markovian Coupling v/s Conductance for the Jerrum-Sinclair Chain.
V.S. Anil Kumar, R. Hariharan.
Proceedings of the 40th Annual IEEE Symposium on Foundations of
Computer Science (FOCS), pp. 241-252, 1999.
Hardness of Set Covering with Intersection 1.
V.S. Anil Kumar, S. Arya, R. Hariharan.
Proceedings of the 27th International Colloquium on Automata, Languages
and Programming (ICALP), Lecture Notes in Computer Science,
vol 1853, pp 624-635, 2000, (pdf).
Covering Rectilinear Polygons with Axis-Parallel Rectangles.
V.S. Anil Kumar, R. Hariharan.
Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC)},
pp. 445-454, 1999.
Recognition of Counting and Balancing Networks is Hard.
V.S. Anil Kumar.
National Seminar on Theoretical Computer Science, India, Jul. 1996.
Publications in Books
Minimum Weighted Completion Time.
V.S. Anil Kumar, M. Marathe, S. Parthasarathy and A. Srinivasan,
To appear in Springer Encyclopedia of Algorithms.
Interactions among human behavior, social networks, and societal
infrastructures: A case study in computational epidemiology.
C. Barrett, B. Lewis, J. Chen, V.S. Anil Kumar, S. Eubank, M. Marathe
and H. Mortveit.
In Ravi S, Shukla S (eds.), Fundamental Problems in Computing: Essays in
Honor of Professor Daniel J. Rosenkrantz. Springer Verlag, Vol. In press
December 2007.
Modeling and Simulation of Large Biological, Information and Socio-Technical
Systems: An Interaction-Based Approach.
C. Barrett, K. Bisset, S. Eubank, V.S. Anil Kumar, M.V. Marathe and H. Mortveit,
Proceedings of the Short Course on Modeling and Simulation
of Biological Networks, AMS Lecture Notes, Series: PSAPM, revised
and accepted, January 2007. In Press.
Structure of Social Contact Networks, and their impact
on Epidemics.
S. Eubank, V.S. Anil Kumar, M. Marathe, A. Srinivasan and N. Wang,
AMS-DIMACS Special Issue on Epidemiology, 2006.
Understanding Large-Scale Social and Infrastructure Networks: a
Simulation Based Approach.
C. Barrett, S. Eubank, V.S. Anil Kumar and M. Marathe,
SIAM News, 37(4), 2004.
|
