The SCEAS System
| |||||||

## Search the dblp DataBase
V. S. Anil Kumar:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan
**Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2005, pp:146-157 [Conf] - Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
**Equilibria in topology control games for ad hoc networks.**[Citation Graph (0, 0)][DBLP] DIALM-POMC, 2003, pp:2-11 [Conf] - V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan
**Approximation Algorithms for Scheduling on Multiple Machines.**[Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:254-263 [Conf] - V. S. Anil Kumar, H. Ramesh
**Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain.**[Citation Graph (0, 0)][DBLP] FOCS, 1999, pp:241-252 [Conf] - V. S. Anil Kumar, Sunil Arya, H. Ramesh
**Hardness of Set Cover with Intersection 1.**[Citation Graph (0, 0)][DBLP] ICALP, 2000, pp:624-635 [Conf] - V. S. Anil Kumar, Madhav V. Marathe
**Improved Results for Stackelberg Scheduling Strategies.**[Citation Graph (0, 0)][DBLP] ICALP, 2002, pp:776-787 [Conf] - V. S. Anil Kumar, Srinivasan Parthasarathy 0002, Madhav V. Marathe, Aravind Srinivasan, Sibylle Zust
**Provable Algorithms for Parallel Sweep Scheduling on Unstructured Meshes.**[Citation Graph (0, 0)][DBLP] IPDPS, 2005, pp:- [Conf] - Christopher L. Barrett, V. S. Anil Kumar, Madhav V. Marathe, Shripad Thite, Gabriel Istrate
**Strong Edge Coloring for Channel Assignment in Wireless Radio Networks.**[Citation Graph (0, 0)][DBLP] PerCom Workshops, 2006, pp:106-110 [Conf] - V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan
**Algorithmic aspects of capacity in wireless networks.**[Citation Graph (0, 0)][DBLP] SIGMETRICS, 2005, pp:133-144 [Conf] - Christian A. Duncan, Stephen G. Kobourov, V. S. Anil Kumar
**Optimal constrained graph exploration.**[Citation Graph (0, 0)][DBLP] SODA, 2001, pp:807-814 [Conf] - Stephen Eubank, V. S. Anil Kumar, Madhav V. Marathe, Aravind Srinivasan, Nan Wang
**Structural and algorithmic aspects of massive social networks.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:718-727 [Conf] - V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan
**End-to-end packet-scheduling in wireless ad-hoc networks.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:1021-1030 [Conf] - Piotr Krysta, V. S. Anil Kumar
**Approximation Algorithms for Minimum Size 2-Connectivity Problems.**[Citation Graph (0, 0)][DBLP] STACS, 2001, pp:431-442 [Conf] - V. S. Anil Kumar, H. Ramesh
**Covering Rectilinear Polygons with Axis-Parallel Rectangles.**[Citation Graph (0, 0)][DBLP] STOC, 1999, pp:445-454 [Conf] - Vijay Chandru, Abhi Dattasharma, V. S. Anil Kumar
**The algorithmics of folding proteins on lattices.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:127, n:1, pp:145-161 [Journal] - V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan, Sibylle Zust
**Provable algorithms for parallel generalized sweep scheduling.**[Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 2006, v:66, n:6, pp:807-821 [Journal] - V. S. Anil Kumar, H. Ramesh
**Coupling vs. conductance for the Jerrum-Sinclair chain.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2001, v:18, n:1, pp:1-17 [Journal] - V. S. Anil Kumar, H. Ramesh
**Covering Rectilinear Polygons with Axis-Parallel Rectangles.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2003, v:32, n:6, pp:1509-1541 [Journal] - Christian A. Duncan, Stephen G. Kobourov, V. S. Anil Kumar
**Optimal constrained graph exploration.**[Citation Graph (0, 0)][DBLP] ACM Transactions on Algorithms, 2006, v:2, n:3, pp:380-402 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:385, n:1-3, pp:101-114 [Journal] **On Strategy Improvement Algorithms for Simple Stochastic Games.**[Citation Graph (, )][DBLP]**Existence Theorems and Approximation Algorithms for Generalized Network Security Games.**[Citation Graph (, )][DBLP]**EpiFast: a fast algorithm for large scale realistic epidemic simulations on distributed memory systems.**[Citation Graph (, )][DBLP]**Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints.**[Citation Graph (, )][DBLP]**Capacity of Asynchronous Random-Access Scheduling in Wireless Networks.**[Citation Graph (, )][DBLP]**Bi-Criteria Approximation Algorithms for Power-Efficient and Low-Interference Topology Control in Unreliable Ad Hoc Networks.**[Citation Graph (, )][DBLP]**Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks.**[Citation Graph (, )][DBLP]**Cross-layer latency minimization in wireless networks with SINR constraints.**[Citation Graph (, )][DBLP]**Finding Critical Nodes for Inhibiting Diffusion of Complex Contagions in Social Networks.**[Citation Graph (, )][DBLP]**Energy-optimal distributed algorithms for minimum spanning trees.**[Citation Graph (, )][DBLP]**Generation and Analysis of Large Synthetic Social Contact Networks.**[Citation Graph (, )][DBLP]**Power Efficient Throughput Maximization in Multi-Hop Wireless Networks.**[Citation Graph (, )][DBLP]**Epidemiology and Wireless Communication: Tight Analogy or Loose Metaphor?.**[Citation Graph (, )][DBLP]**EpiNet: a simulation framework to study the spread of malware in wireless networks.**[Citation Graph (, )][DBLP]**Limit Set Reachability in Asynchronous Graph Dynamical Systems.**[Citation Graph (, )][DBLP]**Scheduling on Unrelated Machines under Tree-Like Precedence Constraints.**[Citation Graph (, )][DBLP]**Computational Epidemiology in a Connected World.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |