default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBalaji Raghavachari
Person information
- affiliation: University of Texas at Dallas, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[p4]Samir Khuller, Balaji Raghavachari, Neal E. Young:
Greedy Methods. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 55-69- 2016
- [r4]Samir Khuller, Balaji Raghavachari:
Graph Connectivity. Encyclopedia of Algorithms 2016: 872-875 - 2014
- [p3]Samir Khuller, Balaji Raghavachari:
Graph and Network Algorithms. Computing Handbook, 3rd ed. (1) 2014: 5: 1-24 - 2011
- [j27]Sailu Yellaboina, Asba Tasneem, Dmitri V. Zaykin
, Balaji Raghavachari, Raja Jothi:
DOMINE: a comprehensive collection of known and predicted domain-domain interactions. Nucleic Acids Res. 39(Database-Issue): 730-735 (2011) - 2010
- [c29]Shengli Yuan, Balaji Raghavachari, Lei Chen:
A Threat-Aware Routing Algorithm for Maximum Physical-Layer Path Survivability. GLOBECOM 2010: 1-5 - [c28]Shengli Yuan, Balaji Raghavachari, Ankitkumar Patel:
Finding Maximum Reliable Path in Mesh Networks under Multiple Failures. ICCCN 2010: 1-6
2000 – 2009
- 2009
- [j26]Raja Jothi, Balaji Raghavachari:
Degree-bounded minimum spanning trees. Discret. Appl. Math. 157(5): 960-970 (2009) - [j25]Raja Jothi, Balaji Raghavachari:
Improved approximation algorithms for the single-sink buy-at-bulk network design problems. J. Discrete Algorithms 7(2): 249-255 (2009) - 2008
- [j24]Balaji Raghavachari, Asba Tasneem, Teresa M. Przytycka, Raja Jothi:
DOMINE: a database of protein domain interactions. Nucleic Acids Res. 36(Database-Issue): 656-661 (2008) - [r3]Samir Khuller, Balaji Raghavachari:
Graph Connectivity. Encyclopedia of Algorithms 2008 - 2007
- [j23]Raja Jothi, Balaji Raghavachari:
Approximating the k-traveling repairman problem with repairtimes. J. Discrete Algorithms 5(2): 293-303 (2007) - [c27]Prabhakar Gubbala, Balaji Raghavachari:
A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity. WADS 2007: 39-51 - [r2]Samir Khuller, Balaji Raghavachari, Neal E. Young:
Greedy Methods. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j22]Chao Gong, Kamil Saraç, Ovidiu Daescu, Balaji Raghavachari, Raja Jothi:
Load-balanced agent activation for value-added network services. Comput. Commun. 29(11): 1905-1916 (2006) - 2005
- [j21]Raja Jothi, Balaji Raghavachari:
Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design. ACM Trans. Algorithms 1(2): 265-282 (2005) - [c26]Prabhakar Gubbala, Balaji Raghavachari:
Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem. IPCO 2005: 422-436 - 2004
- [j20]Raja Jothi, Balaji Raghavachari:
Survivable network design: the capacitated minimum spanning network problem. Inf. Process. Lett. 91(4): 183-190 (2004) - [j19]Philip N. Klein, Radha Krishnan, Balaji Raghavachari, R. Ravi:
Approximation algorithms for finding low-degree subgraphs. Networks 44(3): 203-215 (2004) - [c25]Raja Jothi, Balaji Raghavachari:
Degree-bounded minimum spanning trees. CCCG 2004: 192-195 - [c24]Chao Gong, Ovidiu Daescu, Raja Jothi, Balaji Raghavachari, Kamil Saraç:
Load balancing for reliable multicast. Communications, Internet, and Information Technology 2004: 86-91 - [c23]Raja Jothi, Balaji Raghavachari:
Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design. ICALP 2004: 805-818 - [c22]Vinod Vokkarane, Jianping Wang, Xiangtong Qi, Raja Jothi, Balaji Raghavachari, Jason P. Jue:
Dynamic dual-homing protection in WDM mesh networks. ICC 2004: 1644-1648 - [c21]Prabhakar Gubbala, Balaji Raghavachari:
Finding k-Connected Subgraphs with Minimum Average Weight. LATIN 2004: 212-221 - [c20]Raja Jothi, Balaji Raghavachari:
Minimum Latency Tours and the k-Traveling Repairmen Problem. LATIN 2004: 423-433 - [c19]Ovidiu Daescu, Raja Jothi, Balaji Raghavachari, Kamil Saraç:
Optimal placement of NAK-suppressing agents for reliable multicast: a partial deployment case. SAC 2004: 334-338 - [c18]Raja Jothi, Balaji Raghavachari:
Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems. SWAT 2004: 336-348 - 2003
- [c17]Raja Jothi, Balaji Raghavachari, Subramanian Varadarajan:
A 5/4-approximation algorithm for minimum 2-edge-connectivity. SODA 2003: 725-734 - 2002
- [i6]Samir Khuller, Balaji Raghavachari, Neal E. Young:
On Strongly Connected Digraphs with Bounded Cycle Length. CoRR cs.DS/0205011 (2002) - [i5]Samir Khuller, Balaji Raghavachari, Neal E. Young:
Approximating the Minimum Equivalent Digraph. CoRR cs.DS/0205040 (2002) - [i4]Samir Khuller, Balaji Raghavachari, Neal E. Young:
Low-Degree Spanning Trees of Small Weight. CoRR cs.DS/0205043 (2002) - [i3]Samir Khuller, Balaji Raghavachari, Neal E. Young:
Balancing Minimum Spanning and Shortest Path Trees. CoRR cs.DS/0205045 (2002) - [i2]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. CoRR cs.DS/0205050 (2002) - [i1]Samir Khuller, Balaji Raghavachari, Neal E. Young:
Designing Multi-Commodity Flow Trees. CoRR cs.DS/0205077 (2002) - 2001
- [j18]Moses Charikar, Samir Khuller, Balaji Raghavachari:
Algorithms for Capacitated Vehicle Routing. SIAM J. Comput. 31(3): 665-682 (2001) - [c16]Radha Krishnan, Balaji Raghavachari:
The Directed Minimum-Degree Spanning Tree Problem. FSTTCS 2001: 232-243 - 2000
- [j17]Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari:
Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem. Algorithmica 28(4): 422-437 (2000)
1990 – 1999
- 1999
- [j16]Balaji Raghavachari, Jeyakesavan Veerasamy:
A 3/2-Approximation Algorithm for the Mixed Postman Problem. SIAM J. Discret. Math. 12(4): 425-433 (1999) - [c15]Balaji Raghavachari, Jeyakesavan Veerasamy:
Approximation Algorithms for the Asymmetric Postman Problem. SODA 1999: 734-741 - [c14]Samir Khuller, Balaji Raghavachari, An Zhu:
A Uniform Framework for Approximating Weighted Connectivity Problems. SODA 1999: 937-938 - [p2]Samir Khuller, Balaji Raghavachari:
Advanced Combinatorial Algorithms. Algorithms and Theory of Computation Handbook 1999 - [p1]Samir Khuller, Balaji Raghavachari:
Basic Graph Algorithms. Algorithms and Theory of Computation Handbook 1999 - 1998
- [c13]Moses Charikar, Balaji Raghavachari:
The Finite Capacity Dial-A-Ride Problem. FOCS 1998: 458-467 - [c12]Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari:
Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem. FSTTCS 1998: 6-17 - [c11]Balaji Raghavachari, Jeyakesavan Veerasamy:
Approximation Algorithms for the Mixed Postman Problem. IPCO 1998: 169-179 - [c10]Moses Charikar, Samir Khuller, Balaji Raghavachari:
Algorithms for Capacitated Vehicle Routing. STOC 1998: 349-358 - 1997
- [j15]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. J. Algorithms 24(2): 310-324 (1997) - [r1]Samir Khuller, Balaji Raghavachari:
Graph and Network Algorithms. The Computer Science and Engineering Handbook 1997: 203-225 - 1996
- [j14]Samir Khuller, Balaji Raghavachari:
Graph and Network Algorithms. ACM Comput. Surv. 28(1): 43-45 (1996) - [j13]Samir Khuller, Balaji Raghavachari, Neal E. Young:
On Strongly Connected Digraphs with Bounded Cycle Length. Discret. Appl. Math. 69(3): 281-289 (1996) - [j12]Samir Khuller, Balaji Raghavachari, Azriel Rosenfeld:
Landmarks in Graphs. Discret. Appl. Math. 70(3): 217-229 (1996) - [j11]Samir Khuller, Balaji Raghavachari:
Improved Approximation Algorithms for Uniform Connectivity Problems. J. Algorithms 21(2): 434-450 (1996) - [j10]Martin Fürer, Balaji Raghavachari:
Parallel Edge Coloring Approximation. Parallel Process. Lett. 6(3): 321-329 (1996) - [j9]Samir Khuller, Balaji Raghavachari, Neal E. Young:
Low-Degree Spanning Trees of Small Weight. SIAM J. Comput. 25(2): 355-368 (1996) - [c9]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. IPCO 1996: 105-117 - 1995
- [j8]Samir Khuller, Balaji Raghavachari, Neal E. Young:
Balancing Minimum Spanning Trees and Shortest-Path Trees. Algorithmica 14(4): 305-321 (1995) - [j7]Martin Fürer, Balaji Raghavachari:
An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs. J. Algorithms 18(2): 203-220 (1995) - [j6]Samir Khuller, Balaji Raghavachari, Neal E. Young:
Approximating the Minimum Equivalent Digraph. SIAM J. Comput. 24(4): 859-872 (1995) - [c8]Samir Khuller, Balaji Raghavachari:
Improved approximation algorithms for uniform connectivity problems. STOC 1995: 1-10 - 1994
- [j5]Samir Khuller, Balaji Raghavachari, Neal E. Young:
Designing Multi-Commodity Flow Trees. Inf. Process. Lett. 50(1): 49-55 (1994) - [j4]Martin Fürer, Balaji Raghavachari:
Approximating the Minimum-Degree Steiner Tree to within One of Optimal. J. Algorithms 17(3): 409-423 (1994) - [j3]Webb Miller, Mark Boguski, Balaji Raghavachari, Zheng Zhang, Ross C. Hardison:
Constructing Aligned Sequence Blocks. J. Comput. Biol. 1(1): 51-64 (1994) - [j2]Zheng Zhang, Balaji Raghavachari, Ross C. Hardison, Webb Miller:
Chaining Multiple-Alignment Blocks. J. Comput. Biol. 1(3): 217-226 (1994) - [j1]Ming-Yang Kao, Martin Fürer, Xin He, Balaji Raghavachari:
Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs. SIAM J. Discret. Math. 7(4): 632-646 (1994) - [c7]Samir Khuller, Balaji Raghavachari, Neal E. Young:
Approximating the Minimum Equivalent Diagraph. SODA 1994: 177-186 - [c6]Samir Khuller, Balaji Raghavachari, Neal E. Young:
Low degree spanning trees of small weight. STOC 1994: 412-421 - 1993
- [c5]Samir Khuller, Balaji Raghavachari, Neal E. Young:
Balancing Minimum Spanning and Shortest Path Trees. SODA 1993: 243-250 - [c4]Samir Khuller, Balaji Raghavachari, Neal E. Young:
Designing Multi-Commodity Flow Trees. WADS 1993: 433-441 - 1992
- [c3]R. Ravi, Balaji Raghavachari, Philip N. Klein:
Approximation Through Local Optimality: Designing Networks with Small Degree. FSTTCS 1992: 279-290 - [c2]Martin Fürer, Balaji Raghavachari:
Approximating the Minimum Degree Spanning Tree to Within One from the Optimal Degree. SODA 1992: 317-324 - [c1]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. SPAA 1992: 410-419
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-05 02:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
