The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

R. Chandrasekaran: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Maulin Patel, R. Chandrasekaran, S. Venkatesan
    Efficient Minimum-Cost Bandwidth-Constrained Routing in Wireless Sensor Networks. [Citation Graph (0, 0)][DBLP]
    International Conference on Wireless Networks, 2004, pp:447-453 [Conf]
  2. S. Sridhar, R. Chandrasekaran
    Integer Solution to Synthesis of Communication Networks. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:467-483 [Conf]
  3. Srinivasan Krishnamurthy, R. Chandrasekaran, Neeraj Mittal, S. Venkatesan
    Brief Announcement: Synchronous Distributed Algorithms for Node Discovery and Configuration in Multi-channel Cognitive Radio Networks. [Citation Graph (0, 0)][DBLP]
    DISC, 2006, pp:572-574 [Conf]
  4. Mansi Ramakrishnan Thoppian, S. Venkatesan, Ravi Prakash, R. Chandrasekaran
    MAC-Layer Scheduling in Cognitive Radio based Multi-Hop Wireless Networks. [Citation Graph (0, 0)][DBLP]
    WOWMOM, 2006, pp:191-202 [Conf]
  5. Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair
    Parametric Min-cuts Analysis in a Network. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:127, n:3, pp:679-689 [Journal]
  6. R. Chandrasekaran, Kunhiraman Nair, Yash P. Aneja, Santosh N. Kabadi
    Multi-terminal multipath flows: synthesis. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:182-193 [Journal]
  7. Sambhavi Lakshminarayanan, R. Chandrasekaran
    A rounding algorithm for integer programs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:50, n:3, pp:267-282 [Journal]
  8. Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair
    Parametric analysis of overall min-cuts and applications in undirected networks. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:85, n:2, pp:105-109 [Journal]
  9. R. Chandrasekaran, Arie Tamir
    Algebraic Optimization: The Fermat-Weber Location Problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1990, v:46, n:, pp:219-224 [Journal]
  10. Rick P. Millane, J. K. Walker, S. Arnott, R. Chandrasekaran, D. L. Birdsall, R. L. Ratliff
    Structure of a pleiomeric form of poly d(AT): poly d(AT). [Citation Graph (0, 0)][DBLP]
    Nucleic Acids Research, 1984, v:12, n:13, pp:5475-5493 [Journal]
  11. Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair
    Maximizing residual flow under an arc destruction. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:38, n:4, pp:194-198 [Journal]
  12. Donglei Du, R. Chandrasekaran
    The multiroute maximum flow problem revisited. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:47, n:2, pp:81-92 [Journal]
  13. Gift Siromoney, R. Chandrasekaran, M. Chandrasekaran
    Computer recognition of printed Tamil characters. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1978, v:10, n:4, pp:243-247 [Journal]
  14. R. Chandrasekaran, Bo Chen, Gábor Galambos, P. R. Narayanan, André van Vliet
    A Note on ``An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling''. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:3, pp:870-872 [Journal]
  15. Nimrod Megiddo, Arie Tamir, Eitan Zemel, R. Chandrasekaran
    An O(n log² n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:2, pp:328-337 [Journal]
  16. John F. Rudin III, R. Chandrasekaran
    Improved Bounds for the Online Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:3, pp:717-735 [Journal]
  17. Young U. Ryu, R. Chandrasekaran, Varghese S. Jacob
    Breast cancer prediction using the isotonic separation technique. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:181, n:2, pp:842-854 [Journal]
  18. Maulin Patel, R. Chandrasekaran, S. Venkatesan
    Energy efficient sensor, relay and base station placements for coverage, connectivity and routing. [Citation Graph (0, 0)][DBLP]
    IPCCC, 2005, pp:581-586 [Conf]
  19. R. Chandrasekaran, S. Shirali
    Total weak unimodularity: testing and applications. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:51, n:2, pp:137-145 [Journal]
  20. R. Chandrasekaran, Santosh N. Kabadi
    Pseudomatroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:71, n:3, pp:205-217 [Journal]
  21. Yash P. Aneja, R. Chandrasekaran, K. P. K. Nair
    Minimal-cost system reliability with discrete-choice sets for components. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Reliability, 2004, v:53, n:1, pp:71-76 [Journal]

  22. A Network-flow based Integral Optimal Algorithm for Lexicographic Maximum Lifetime Routing in Wireless Sensor Networks. [Citation Graph (, )][DBLP]


  23. A Combinatorial Algorithm for Horn Programs. [Citation Graph (, )][DBLP]


  24. Fast Neighbor Discovery with Lightweight Termination Detection in Heterogeneous Cognitive Radio Networks. [Citation Graph (, )][DBLP]


  25. Structural analysis of a fractional matching problem. [Citation Graph (, )][DBLP]


Search in 0.056secs, Finished in 0.059secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002