The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Balaji Raghavachari: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Raja Jothi, Balaji Raghavachari
    Degree-bounded minimum spanning trees. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:192-195 [Conf]
  2. Moses Charikar, Balaji Raghavachari
    The Finite Capacity Dial-A-Ride Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:458-467 [Conf]
  3. Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari
    Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:6-17 [Conf]
  4. Radha Krishnan, Balaji Raghavachari
    The Directed Minimum-Degree Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:232-243 [Conf]
  5. R. Ravi, Balaji Raghavachari, Philip N. Klein
    Approximation Through Local Optimality: Designing Networks with Small Degree. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:279-290 [Conf]
  6. Raja Jothi, Balaji Raghavachari
    Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:805-818 [Conf]
  7. Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young
    A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:105-117 [Conf]
  8. Prabhakar Gubbala, Balaji Raghavachari
    Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:422-436 [Conf]
  9. Balaji Raghavachari, Jeyakesavan Veerasamy
    Approximation Algorithms for the Mixed Postman Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 1998, pp:169-179 [Conf]
  10. Prabhakar Gubbala, Balaji Raghavachari
    Finding k-Connected Subgraphs with Minimum Average Weight. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:212-221 [Conf]
  11. Raja Jothi, Balaji Raghavachari
    Minimum Latency Tours and the k-Traveling Repairmen Problem. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:423-433 [Conf]
  12. Ovidiu Daescu, Raja Jothi, Balaji Raghavachari, Kamil Saraç
    Optimal placement of NAK-suppressing agents for reliable multicast: a partial deployment case. [Citation Graph (0, 0)][DBLP]
    SAC, 2004, pp:334-338 [Conf]
  13. Martin Fürer, Balaji Raghavachari
    Approximating the Minimum Degree Spanning Tree to Within One from the Optimal Degree. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:317-324 [Conf]
  14. Raja Jothi, Balaji Raghavachari, Subramanian Varadarajan
    A 5/4-approximation algorithm for minimum 2-edge-connectivity. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:725-734 [Conf]
  15. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Balancing Minimum Spanning and Shortest Path Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:243-250 [Conf]
  16. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Approximating the Minimum Equivalent Diagraph. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:177-186 [Conf]
  17. Samir Khuller, Balaji Raghavachari, An Zhu
    A Uniform Framework for Approximating Weighted Connectivity Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:937-938 [Conf]
  18. Balaji Raghavachari, Jeyakesavan Veerasamy
    Approximation Algorithms for the Asymmetric Postman Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:734-741 [Conf]
  19. Martin Fürer, Xin He, Ming-Yang Kao, Balaji Raghavachari
    O(n log log n)-Work Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SPAA, 1992, pp:410-419 [Conf]
  20. Moses Charikar, Samir Khuller, Balaji Raghavachari
    Algorithms for Capacitated Vehicle Routing. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:349-358 [Conf]
  21. Samir Khuller, Balaji Raghavachari
    Improved approximation algorithms for uniform connectivity problems. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:1-10 [Conf]
  22. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Low degree spanning trees of small weight. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:412-421 [Conf]
  23. Raja Jothi, Balaji Raghavachari
    Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:336-348 [Conf]
  24. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Designing Multi-Commodity Flow Trees. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:433-441 [Conf]
  25. Chao Gong, Ovidiu Daescu, Raja Jothi, Balaji Raghavachari, Kamil Saraç
    Load balancing for reliable multicast. [Citation Graph (0, 0)][DBLP]
    Communications, Internet, and Information Technology, 2004, pp:86-91 [Conf]
  26. Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari
    Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:28, n:4, pp:422-437 [Journal]
  27. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Balancing Minimum Spanning Trees and Shortest-Path Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:14, n:4, pp:305-321 [Journal]
  28. Chao Gong, Kamil Saraç, Ovidiu Daescu, Balaji Raghavachari, Raja Jothi
    Load-balanced agent activation for value-added network services. [Citation Graph (0, 0)][DBLP]
    Computer Communications, 2006, v:29, n:11, pp:1905-1916 [Journal]
  29. Samir Khuller, Balaji Raghavachari, Neal E. Young
    On Strongly Connected Digraphs with Bounded Cycle Length [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  30. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Approximating the Minimum Equivalent Digraph [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  31. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Low-Degree Spanning Trees of Small Weight [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  32. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Balancing Minimum Spanning and Shortest Path Trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  33. Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young
    A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  34. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Designing Multi-Commodity Flow Trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  35. Samir Khuller, Balaji Raghavachari
    Graph and Network Algorithms. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1996, v:28, n:1, pp:43-45 [Journal]
  36. Samir Khuller, Balaji Raghavachari, Azriel Rosenfeld
    Landmarks in Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:70, n:3, pp:217-229 [Journal]
  37. Samir Khuller, Balaji Raghavachari, Neal E. Young
    On Strongly Connected Digraphs with Bounded Cycle Length. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:69, n:3, pp:281-289 [Journal]
  38. Raja Jothi, Balaji Raghavachari
    Survivable network design: the capacitated minimum spanning network problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:91, n:4, pp:183-190 [Journal]
  39. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Designing Multi-Commodity Flow Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:50, n:1, pp:49-55 [Journal]
  40. Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young
    A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:24, n:2, pp:310-324 [Journal]
  41. Martin Fürer, Balaji Raghavachari
    Approximating the Minimum-Degree Steiner Tree to within One of Optimal. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:17, n:3, pp:409-423 [Journal]
  42. Martin Fürer, Balaji Raghavachari
    An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:18, n:2, pp:203-220 [Journal]
  43. Samir Khuller, Balaji Raghavachari
    Improved Approximation Algorithms for Uniform Connectivity Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:21, n:2, pp:434-450 [Journal]
  44. Raja Jothi, Balaji Raghavachari
    Approximating the k-traveling repairman problem with repairtimes. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:2, pp:293-303 [Journal]
  45. Philip N. Klein, Radha Krishnan, Balaji Raghavachari, R. Ravi
    Approximation algorithms for finding low-degree subgraphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:44, n:3, pp:203-215 [Journal]
  46. Moses Charikar, Samir Khuller, Balaji Raghavachari
    Algorithms for Capacitated Vehicle Routing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:3, pp:665-682 [Journal]
  47. Samir Khuller, Balaji Raghavachari, Michael R. Fellows
    Approximating the Minimum Equivalent Digraph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:4, pp:859-872 [Journal]
  48. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Low-Degree Spanning Trees of Small Weight. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:2, pp:355-368 [Journal]
  49. Ming-Yang Kao, Martin Fürer, Xin He, Balaji Raghavachari
    Optimal Parallel Algorithms forStraight-Line Grid Embeddings of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:4, pp:632-646 [Journal]
  50. Balaji Raghavachari, Jeyakesavan Veerasamy
    A 3/2-Approximation Algorithm for the Mixed Postman Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:4, pp:425-433 [Journal]
  51. Raja Jothi, Balaji Raghavachari
    Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2005, v:1, n:2, pp:265-282 [Journal]
  52. Prabhakar Gubbala, Balaji Raghavachari
    A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:39-51 [Conf]

  53. Degree-bounded minimum spanning trees. [Citation Graph (, )][DBLP]


Search in 0.037secs, Finished in 0.041secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002