Biblio

Export 70 results:
Sort by:
Filters: Author is V.S. Anil Kumar  [Clear All Filters]
2005
2004
2003
Eidenbenz, S., A. V. S. Kumar, and S. Zust, "Equilibria in Topology control games for ad hoc networks", proceedings of the Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications and Principles of Mobile Computing (DIALPOMC), Septermber, 2003.
Chandru, V., A. DuttaSharma, and A. V. S. Kumar, "The Algorithmics of Folding Proteins on Lattices", Discrete Applied Mathematics, vol. 127, no. 1, pp. 145-161, 2003.
Kumar, A. V. S., and R. Hariharan, "Covering Rectilinear Polygons with Axis-Parallel Rectangles", SIAM Journal of Computing, vol. 32, no. 6, pp. 1509-1541, 2003.
2002
Kumar, A. V. S., and M. Marathe, "Improved Results for Stackelberg Scheduling Strategies.", The 29th International Colloquium on Automata, Languages and Programming, 2002 (ICALP), Lecture Notes in Computer Science, 2380, Springer, 2002.
2001
Krysta, P., and A. V. S. Kumar, "Approximation algorithms for minimum size 2-connectivity problems.", 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.
Kumar, A. V. S., and R. Hariharan, "Markovian Coupling v/s Conductance for the Jerrum-Sinclair Chain.", Random Structures and Algorithms, vol. 18, no. 1, pp. 1-17, 2001.
Duncan, C., S. Kobourov, and A. V. S. Kumar, "Optimal Constrained Graph Exploration", Proceedings of the 12th ACM Symposium on Discrete Algorithms (SODA), pp. 807-814, 2001.
2000
Kumar, A. V. S., S. Arya, and R. Hariharan, "Hardness of Set Covering with Intersection 1", Proceedings of the 27th International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, vol 1853, pp 624-635, 2000, 2000.
1999
Kumar, A. V. S., and R. Hariharan, "Covering Rectilinear Polygons with Axis-Parallel Rectangles", Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC), pp. 445-454, 1999.
Kumar, A. V. S., and R. Hariharan, "Markovian Coupling v/s Conductance for the Jerrum-Sinclair Chain", Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 241-252, 1999.
1996
Kumar, A. V. S., "Recognition of Counting and Balancing Networks is Hard", National Seminar on Theoretical Computer Science, India, July, 1996.