Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Balaji Raghavachari
@incollection{DBLP:books/tf/18/KhullerRY18,
author = {Samir Khuller and
Balaji Raghavachari and
Neal E. Young},
editor = {Teofilo F. Gonzalez},
title = {Greedy Methods},
booktitle = {Handbook of Approximation Algorithms and Metaheuristics, Second Edition,
Volume 1: Methologies and Traditional Applications},
pages = {55--69},
publisher = {Chapman and Hall/CRC},
year = {2018},
url = {https://doi.org/10.1201/9781351236423-4},
doi = {10.1201/9781351236423-4},
timestamp = {Mon, 28 Oct 2019 16:49:19 +0100},
biburl = {https://dblp.org/rec/books/tf/18/KhullerRY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/KhullerR16,
author = {Samir Khuller and
Balaji Raghavachari},
title = {Graph Connectivity},
booktitle = {Encyclopedia of Algorithms},
pages = {872--875},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_171},
doi = {10.1007/978-1-4939-2864-4\_171},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/KhullerR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/crc/chb/KhullerR14,
author = {Samir Khuller and
Balaji Raghavachari},
editor = {Teofilo F. Gonzalez and
Jorge Diaz{-}Herrera and
Allen Tucker},
title = {Graph and Network Algorithms},
booktitle = {Computing Handbook, Third Edition: Computer Science and Software Engineering},
pages = {5: 1--24},
publisher = {{CRC} Press},
year = {2014},
timestamp = {Tue, 17 Jun 2014 14:00:46 +0200},
biburl = {https://dblp.org/rec/books/crc/chb/KhullerR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/nar/YellaboinaTZRJ11,
author = {Sailu Yellaboina and
Asba Tasneem and
Dmitri V. Zaykin and
Balaji Raghavachari and
Raja Jothi},
title = {{DOMINE:} a comprehensive collection of known and predicted domain-domain
interactions},
journal = {Nucleic Acids Res.},
volume = {39},
number = {Database-Issue},
pages = {730--735},
year = {2011},
url = {https://doi.org/10.1093/nar/gkq1229},
doi = {10.1093/NAR/GKQ1229},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/nar/YellaboinaTZRJ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/globecom/YuanRC10,
author = {Shengli Yuan and
Balaji Raghavachari and
Lei Chen},
title = {A Threat-Aware Routing Algorithm for Maximum Physical-Layer Path Survivability},
booktitle = {Proceedings of the Global Communications Conference, 2010. {GLOBECOM}
2010, 6-10 December 2010, Miami, Florida, {USA}},
pages = {1--5},
publisher = {{IEEE}},
year = {2010},
url = {https://doi.org/10.1109/GLOCOM.2010.5683786},
doi = {10.1109/GLOCOM.2010.5683786},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/globecom/YuanRC10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icccn/YuanRP10,
author = {Shengli Yuan and
Balaji Raghavachari and
Ankitkumar Patel},
title = {Finding Maximum Reliable Path in Mesh Networks under Multiple Failures},
booktitle = {Proceedings of the 19th International Conference on Computer Communications
and Networks, {IEEE} {ICCCN} 2010, Z{\"{u}}rich, Switzerland,
August 2-5, 2010},
pages = {1--6},
publisher = {{IEEE}},
year = {2010},
url = {https://doi.org/10.1109/ICCCN.2010.5560082},
doi = {10.1109/ICCCN.2010.5560082},
timestamp = {Wed, 16 Oct 2019 14:14:49 +0200},
biburl = {https://dblp.org/rec/conf/icccn/YuanRP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JothiR09,
author = {Raja Jothi and
Balaji Raghavachari},
title = {Degree-bounded minimum spanning trees},
journal = {Discret. Appl. Math.},
volume = {157},
number = {5},
pages = {960--970},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2008.03.037},
doi = {10.1016/J.DAM.2008.03.037},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/JothiR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/JothiR09,
author = {Raja Jothi and
Balaji Raghavachari},
title = {Improved approximation algorithms for the single-sink buy-at-bulk
network design problems},
journal = {J. Discrete Algorithms},
volume = {7},
number = {2},
pages = {249--255},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.12.003},
doi = {10.1016/J.JDA.2008.12.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/JothiR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/nar/RaghavachariTPJ08,
author = {Balaji Raghavachari and
Asba Tasneem and
Teresa M. Przytycka and
Raja Jothi},
title = {{DOMINE:} a database of protein domain interactions},
journal = {Nucleic Acids Res.},
volume = {36},
number = {Database-Issue},
pages = {656--661},
year = {2008},
url = {https://doi.org/10.1093/nar/gkm761},
doi = {10.1093/NAR/GKM761},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/nar/RaghavachariTPJ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/KhullerR08,
author = {Samir Khuller and
Balaji Raghavachari},
editor = {Ming{-}Yang Kao},
title = {Graph Connectivity},
booktitle = {Encyclopedia of Algorithms - 2008 Edition},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-0-387-30162-4\_171},
doi = {10.1007/978-0-387-30162-4\_171},
timestamp = {Thu, 27 Jun 2019 16:25:31 +0200},
biburl = {https://dblp.org/rec/reference/algo/KhullerR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/JothiR07,
author = {Raja Jothi and
Balaji Raghavachari},
title = {Approximating the k-traveling repairman problem with repairtimes},
journal = {J. Discrete Algorithms},
volume = {5},
number = {2},
pages = {293--303},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.03.023},
doi = {10.1016/J.JDA.2006.03.023},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/JothiR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/GubbalaR07,
author = {Prabhakar Gubbala and
Balaji Raghavachari},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Norbert Zeh},
title = {A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity},
booktitle = {Algorithms and Data Structures, 10th International Workshop, {WADS}
2007, Halifax, Canada, August 15-17, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4619},
pages = {39--51},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73951-7\_5},
doi = {10.1007/978-3-540-73951-7\_5},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/GubbalaR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/crc/KhullerRY07,
author = {Samir Khuller and
Balaji Raghavachari and
Neal E. Young},
editor = {Teofilo F. Gonzalez},
title = {Greedy Methods},
booktitle = {Handbook of Approximation Algorithms and Metaheuristics},
publisher = {Chapman and Hall/CRC},
year = {2007},
url = {https://doi.org/10.1201/9781420010749.ch4},
doi = {10.1201/9781420010749.CH4},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/crc/KhullerRY07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comcom/GongSDRJ06,
author = {Chao Gong and
Kamil Sara{\c{c}} and
Ovidiu Daescu and
Balaji Raghavachari and
Raja Jothi},
title = {Load-balanced agent activation for value-added network services},
journal = {Comput. Commun.},
volume = {29},
number = {11},
pages = {1905--1916},
year = {2006},
url = {https://doi.org/10.1016/j.comcom.2005.10.035},
doi = {10.1016/J.COMCOM.2005.10.035},
timestamp = {Tue, 19 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comcom/GongSDRJ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/JothiR05,
author = {Raja Jothi and
Balaji Raghavachari},
title = {Approximation algorithms for the capacitated minimum spanning tree
problem and its variants in network design},
journal = {{ACM} Trans. Algorithms},
volume = {1},
number = {2},
pages = {265--282},
year = {2005},
url = {https://doi.org/10.1145/1103963.1103967},
doi = {10.1145/1103963.1103967},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/JothiR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/GubbalaR05,
author = {Prabhakar Gubbala and
Balaji Raghavachari},
editor = {Michael J{\"{u}}nger and
Volker Kaibel},
title = {Approximation Algorithms for the Minimum Cardinality Two-Connected
Spanning Subgraph Problem},
booktitle = {Integer Programming and Combinatorial Optimization, 11th International
{IPCO} Conference, Berlin, Germany, June 8-10, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3509},
pages = {422--436},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11496915\_31},
doi = {10.1007/11496915\_31},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/GubbalaR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JothiR04,
author = {Raja Jothi and
Balaji Raghavachari},
title = {Survivable network design: the capacitated minimum spanning network
problem},
journal = {Inf. Process. Lett.},
volume = {91},
number = {4},
pages = {183--190},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.04.007},
doi = {10.1016/J.IPL.2004.04.007},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/JothiR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/KleinKRR04,
author = {Philip N. Klein and
Radha Krishnan and
Balaji Raghavachari and
R. Ravi},
title = {Approximation algorithms for finding low-degree subgraphs},
journal = {Networks},
volume = {44},
number = {3},
pages = {203--215},
year = {2004},
url = {https://doi.org/10.1002/net.20031},
doi = {10.1002/NET.20031},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/KleinKRR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/JothiR04,
author = {Raja Jothi and
Balaji Raghavachari},
title = {Degree-bounded minimum spanning trees},
booktitle = {Proceedings of the 16th Canadian Conference on Computational Geometry,
CCCG'04, Concordia University, Montr{\'{e}}al, Qu{\'{e}}bec,
Canada, August 9-11, 2004},
pages = {192--195},
year = {2004},
url = {http://www.cccg.ca/proceedings/2004/32.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/JothiR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciit/GongDJRS04,
author = {Chao Gong and
Ovidiu Daescu and
Raja Jothi and
Balaji Raghavachari and
Kamil Sara{\c{c}}},
editor = {M. H. Hamza},
title = {Load balancing for reliable multicast},
booktitle = {{IASTED} International Conference on Communications, Internet, and
Information Technology, November 22 - 24, 2004, St. Thomas, {US} Virgin
Islands, {USA}},
pages = {86--91},
publisher = {{IASTED/ACTA} Press},
year = {2004},
timestamp = {Tue, 19 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciit/GongDJRS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/JothiR04,
author = {Raja Jothi and
Balaji Raghavachari},
editor = {Josep D{\'{\i}}az and
Juhani Karhum{\"{a}}ki and
Arto Lepist{\"{o}} and
Donald Sannella},
title = {Approximation Algorithms for the Capacitated Minimum Spanning Tree
Problem and Its Variants in Network Design},
booktitle = {Automata, Languages and Programming: 31st International Colloquium,
{ICALP} 2004, Turku, Finland, July 12-16, 2004. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3142},
pages = {805--818},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27836-8\_68},
doi = {10.1007/978-3-540-27836-8\_68},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/JothiR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icc/VokkaraneWQJRJ04,
author = {Vinod Vokkarane and
Jianping Wang and
Xiangtong Qi and
Raja Jothi and
Balaji Raghavachari and
Jason P. Jue},
title = {Dynamic dual-homing protection in {WDM} mesh networks},
booktitle = {Proceedings of {IEEE} International Conference on Communications,
{ICC} 2004, Paris, France, 20-24 June 2004},
pages = {1644--1648},
publisher = {{IEEE}},
year = {2004},
url = {https://doi.org/10.1109/ICC.2004.1312788},
doi = {10.1109/ICC.2004.1312788},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icc/VokkaraneWQJRJ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/GubbalaR04,
author = {Prabhakar Gubbala and
Balaji Raghavachari},
editor = {Martin Farach{-}Colton},
title = {Finding k-Connected Subgraphs with Minimum Average Weight},
booktitle = {{LATIN} 2004: Theoretical Informatics, 6th Latin American Symposium,
Buenos Aires, Argentina, April 5-8, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2976},
pages = {212--221},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24698-5\_25},
doi = {10.1007/978-3-540-24698-5\_25},
timestamp = {Fri, 09 Apr 2021 18:42:35 +0200},
biburl = {https://dblp.org/rec/conf/latin/GubbalaR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/JothiR04,
author = {Raja Jothi and
Balaji Raghavachari},
editor = {Martin Farach{-}Colton},
title = {Minimum Latency Tours and the k-Traveling Repairmen Problem},
booktitle = {{LATIN} 2004: Theoretical Informatics, 6th Latin American Symposium,
Buenos Aires, Argentina, April 5-8, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2976},
pages = {423--433},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24698-5\_46},
doi = {10.1007/978-3-540-24698-5\_46},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/JothiR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sac/DaescuJRS04,
author = {Ovidiu Daescu and
Raja Jothi and
Balaji Raghavachari and
Kamil Sara{\c{c}}},
editor = {Hisham Haddad and
Andrea Omicini and
Roger L. Wainwright and
Lorie M. Liebrock},
title = {Optimal placement of NAK-suppressing agents for reliable multicast:
a partial deployment case},
booktitle = {Proceedings of the 2004 {ACM} Symposium on Applied Computing (SAC),
Nicosia, Cyprus, March 14-17, 2004},
pages = {334--338},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/967900.967973},
doi = {10.1145/967900.967973},
timestamp = {Tue, 06 Nov 2018 11:06:44 +0100},
biburl = {https://dblp.org/rec/conf/sac/DaescuJRS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/JothiR04,
author = {Raja Jothi and
Balaji Raghavachari},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk
Network Design Problems},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {336--348},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_29},
doi = {10.1007/978-3-540-27810-8\_29},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/JothiR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/JothiRV03,
author = {Raja Jothi and
Balaji Raghavachari and
Subramanian Varadarajan},
title = {A 5/4-approximation algorithm for minimum 2-edge-connectivity},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {725--734},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644227},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/JothiRV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0205011,
author = {Samir Khuller and
Balaji Raghavachari and
Neal E. Young},
title = {On Strongly Connected Digraphs with Bounded Cycle Length},
journal = {CoRR},
volume = {cs.DS/0205011},
year = {2002},
url = {https://arxiv.org/abs/cs/0205011},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0205011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0205040,
author = {Samir Khuller and
Balaji Raghavachari and
Neal E. Young},
title = {Approximating the Minimum Equivalent Digraph},
journal = {CoRR},
volume = {cs.DS/0205040},
year = {2002},
url = {https://arxiv.org/abs/cs/0205040},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0205040.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0205043,
author = {Samir Khuller and
Balaji Raghavachari and
Neal E. Young},
title = {Low-Degree Spanning Trees of Small Weight},
journal = {CoRR},
volume = {cs.DS/0205043},
year = {2002},
url = {https://arxiv.org/abs/cs/0205043},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0205043.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0205045,
author = {Samir Khuller and
Balaji Raghavachari and
Neal E. Young},
title = {Balancing Minimum Spanning and Shortest Path Trees},
journal = {CoRR},
volume = {cs.DS/0205045},
year = {2002},
url = {https://arxiv.org/abs/cs/0205045},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0205045.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0205050,
author = {S{\'{a}}ndor P. Fekete and
Samir Khuller and
Monika Klemmstein and
Balaji Raghavachari and
Neal E. Young},
title = {A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning
Trees},
journal = {CoRR},
volume = {cs.DS/0205050},
year = {2002},
url = {https://arxiv.org/abs/cs/0205050},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0205050.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0205077,
author = {Samir Khuller and
Balaji Raghavachari and
Neal E. Young},
title = {Designing Multi-Commodity Flow Trees},
journal = {CoRR},
volume = {cs.DS/0205077},
year = {2002},
url = {https://arxiv.org/abs/cs/0205077},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0205077.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CharikarKR01,
author = {Moses Charikar and
Samir Khuller and
Balaji Raghavachari},
title = {Algorithms for Capacitated Vehicle Routing},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {3},
pages = {665--682},
year = {2001},
url = {https://doi.org/10.1137/S0097539701392056},
doi = {10.1137/S0097539701392056},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CharikarKR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/KrishnanR01,
author = {Radha Krishnan and
Balaji Raghavachari},
editor = {Ramesh Hariharan and
Madhavan Mukund and
V. Vinay},
title = {The Directed Minimum-Degree Spanning Tree Problem},
booktitle = {{FST} {TCS} 2001: Foundations of Software Technology and Theoretical
Computer Science, 21st Conference, Bangalore, India, December 13-15,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2245},
pages = {232--243},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45294-X\_20},
doi = {10.1007/3-540-45294-X\_20},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/KrishnanR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Guttmann-BeckHKR00,
author = {Nili Guttmann{-}Beck and
Refael Hassin and
Samir Khuller and
Balaji Raghavachari},
title = {Approximation Algorithms with Bounded Performance Guarantees for the
Clustered Traveling Salesman Problem},
journal = {Algorithmica},
volume = {28},
number = {4},
pages = {422--437},
year = {2000},
url = {https://doi.org/10.1007/s004530010045},
doi = {10.1007/S004530010045},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Guttmann-BeckHKR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/RaghavachariV99,
author = {Balaji Raghavachari and
Jeyakesavan Veerasamy},
title = {A 3/2-Approximation Algorithm for the Mixed Postman Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {12},
number = {4},
pages = {425--433},
year = {1999},
url = {https://doi.org/10.1137/S0895480197331454},
doi = {10.1137/S0895480197331454},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/RaghavachariV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/RaghavachariV99,
author = {Balaji Raghavachari and
Jeyakesavan Veerasamy},
editor = {Robert Endre Tarjan and
Tandy J. Warnow},
title = {Approximation Algorithms for the Asymmetric Postman Problem},
booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
17-19 January 1999, Baltimore, Maryland, {USA}},
pages = {734--741},
publisher = {{ACM/SIAM}},
year = {1999},
url = {http://dl.acm.org/citation.cfm?id=314500.314906},
timestamp = {Thu, 05 Jul 2018 07:29:57 +0200},
biburl = {https://dblp.org/rec/conf/soda/RaghavachariV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KhullerRZ99,
author = {Samir Khuller and
Balaji Raghavachari and
An Zhu},
editor = {Robert Endre Tarjan and
Tandy J. Warnow},
title = {A Uniform Framework for Approximating Weighted Connectivity Problems},
booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
17-19 January 1999, Baltimore, Maryland, {USA}},
pages = {937--938},
publisher = {{ACM/SIAM}},
year = {1999},
url = {http://dl.acm.org/citation.cfm?id=314500.314930},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/KhullerRZ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/crc/99/KhullerR99,
author = {Samir Khuller and
Balaji Raghavachari},
editor = {Mikhail J. Atallah},
title = {Advanced Combinatorial Algorithms},
booktitle = {Algorithms and Theory of Computation Handbook},
series = {Chapman {\&} Hall/CRC Applied Algorithms and Data Structures series},
publisher = {{CRC} Press},
year = {1999},
url = {https://doi.org/10.1201/9781420049503-c8},
doi = {10.1201/9781420049503-C8},
timestamp = {Fri, 17 Jul 2020 16:12:44 +0200},
biburl = {https://dblp.org/rec/books/crc/99/KhullerR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/crc/99/KhullerR99a,
author = {Samir Khuller and
Balaji Raghavachari},
editor = {Mikhail J. Atallah},
title = {Basic Graph Algorithms},
booktitle = {Algorithms and Theory of Computation Handbook},
series = {Chapman {\&} Hall/CRC Applied Algorithms and Data Structures series},
publisher = {{CRC} Press},
year = {1999},
url = {https://doi.org/10.1201/9781420049503-c7},
doi = {10.1201/9781420049503-C7},
timestamp = {Mon, 04 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/crc/99/KhullerR99a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CharikarR98,
author = {Moses Charikar and
Balaji Raghavachari},
title = {The Finite Capacity Dial-A-Ride Problem},
booktitle = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
November 8-11, 1998, Palo Alto, California, {USA}},
pages = {458--467},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/SFCS.1998.743496},
doi = {10.1109/SFCS.1998.743496},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/CharikarR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Guttmann-BeckHKR98,
author = {Nili Guttmann{-}Beck and
Refael Hassin and
Samir Khuller and
Balaji Raghavachari},
editor = {Vikraman Arvind and
Ramaswamy Ramanujam},
title = {Approximation Algorithms with Bounded Performance Guarantees for the
Clustered Traveling Salesman Problem},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
18th Conference, Chennai, India, December 17-19, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1530},
pages = {6--17},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/978-3-540-49382-2\_2},
doi = {10.1007/978-3-540-49382-2\_2},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Guttmann-BeckHKR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/RaghavachariV98,
author = {Balaji Raghavachari and
Jeyakesavan Veerasamy},
editor = {Robert E. Bixby and
E. Andrew Boyd and
Roger Z. R{\'{\i}}os{-}Mercado},
title = {Approximation Algorithms for the Mixed Postman Problem},
booktitle = {Integer Programming and Combinatorial Optimization, 6th International
{IPCO} Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1412},
pages = {169--179},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-69346-7\_13},
doi = {10.1007/3-540-69346-7\_13},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/RaghavachariV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CharikarKR98,
author = {Moses Charikar and
Samir Khuller and
Balaji Raghavachari},
editor = {Jeffrey Scott Vitter},
title = {Algorithms for Capacitated Vehicle Routing},
booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
of Computing, Dallas, Texas, USA, May 23-26, 1998},
pages = {349--358},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/276698.276786},
doi = {10.1145/276698.276786},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CharikarKR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/FeketeKKRY97,
author = {S{\'{a}}ndor P. Fekete and
Samir Khuller and
Monika Klemmstein and
Balaji Raghavachari and
Neal E. Young},
title = {A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning
Trees},
journal = {J. Algorithms},
volume = {24},
number = {2},
pages = {310--324},
year = {1997},
url = {https://doi.org/10.1006/jagm.1997.0862},
doi = {10.1006/JAGM.1997.0862},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/FeketeKKRY97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/crc/tucker97/KhullerR97,
author = {Samir Khuller and
Balaji Raghavachari},
editor = {Allen B. Tucker},
title = {Graph and Network Algorithms},
booktitle = {The Computer Science and Engineering Handbook},
pages = {203--225},
publisher = {{CRC} Press},
year = {1997},
timestamp = {Sun, 09 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/crc/tucker97/KhullerR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/csur/KhullerR96,
author = {Samir Khuller and
Balaji Raghavachari},
title = {Graph and Network Algorithms},
journal = {{ACM} Comput. Surv.},
volume = {28},
number = {1},
pages = {43--45},
year = {1996},
url = {https://doi.org/10.1145/234313.234334},
doi = {10.1145/234313.234334},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/csur/KhullerR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KhullerRY96,
author = {Samir Khuller and
Balaji Raghavachari and
Neal E. Young},
title = {On Strongly Connected Digraphs with Bounded Cycle Length},
journal = {Discret. Appl. Math.},
volume = {69},
number = {3},
pages = {281--289},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(95)00105-Z},
doi = {10.1016/0166-218X(95)00105-Z},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KhullerRY96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KhullerRR96,
author = {Samir Khuller and
Balaji Raghavachari and
Azriel Rosenfeld},
title = {Landmarks in Graphs},
journal = {Discret. Appl. Math.},
volume = {70},
number = {3},
pages = {217--229},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(95)00106-2},
doi = {10.1016/0166-218X(95)00106-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KhullerRR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/KhullerR96,
author = {Samir Khuller and
Balaji Raghavachari},
title = {Improved Approximation Algorithms for Uniform Connectivity Problems},
journal = {J. Algorithms},
volume = {21},
number = {2},
pages = {434--450},
year = {1996},
url = {https://doi.org/10.1006/jagm.1996.0052},
doi = {10.1006/JAGM.1996.0052},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/KhullerR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ppl/FurerR96,
author = {Martin F{\"{u}}rer and
Balaji Raghavachari},
title = {Parallel Edge Coloring Approximation},
journal = {Parallel Process. Lett.},
volume = {6},
number = {3},
pages = {321--329},
year = {1996},
url = {https://doi.org/10.1142/S0129626496000315},
doi = {10.1142/S0129626496000315},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ppl/FurerR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KhullerRY96,
author = {Samir Khuller and
Balaji Raghavachari and
Neal E. Young},
title = {Low-Degree Spanning Trees of Small Weight},
journal = {{SIAM} J. Comput.},
volume = {25},
number = {2},
pages = {355--368},
year = {1996},
url = {https://doi.org/10.1137/S0097539794264585},
doi = {10.1137/S0097539794264585},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/KhullerRY96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/FeketeKKRY96,
author = {S{\'{a}}ndor P. Fekete and
Samir Khuller and
Monika Klemmstein and
Balaji Raghavachari and
Neal E. Young},
editor = {William H. Cunningham and
S. Thomas McCormick and
Maurice Queyranne},
title = {A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning
Trees},
booktitle = {Integer Programming and Combinatorial Optimization, 5th International
{IPCO} Conference, Vancouver, British Columbia, Canada, June 3-5,
1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1084},
pages = {105--117},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61310-2\_9},
doi = {10.1007/3-540-61310-2\_9},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipco/FeketeKKRY96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KhullerRY95,
author = {Samir Khuller and
Balaji Raghavachari and
Neal E. Young},
title = {Balancing Minimum Spanning Trees and Shortest-Path Trees},
journal = {Algorithmica},
volume = {14},
number = {4},
pages = {305--321},
year = {1995},
url = {https://doi.org/10.1007/BF01294129},
doi = {10.1007/BF01294129},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KhullerRY95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/FurerR95,
author = {Martin F{\"{u}}rer and
Balaji Raghavachari},
title = {An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in
Dense Directed Graphs},
journal = {J. Algorithms},
volume = {18},
number = {2},
pages = {203--220},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1007},
doi = {10.1006/JAGM.1995.1007},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/FurerR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KhullerRF95,
author = {Samir Khuller and
Balaji Raghavachari and
Neal E. Young},
title = {Approximating the Minimum Equivalent Digraph},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {4},
pages = {859--872},
year = {1995},
url = {https://doi.org/10.1137/S0097539793256685},
doi = {10.1137/S0097539793256685},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KhullerRF95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KhullerR95,
author = {Samir Khuller and
Balaji Raghavachari},
editor = {Frank Thomson Leighton and
Allan Borodin},
title = {Improved approximation algorithms for uniform connectivity problems},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory
of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}},
pages = {1--10},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/225058.225066},
doi = {10.1145/225058.225066},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KhullerR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KhullerRY94,
author = {Samir Khuller and
Balaji Raghavachari and
Neal E. Young},
title = {Designing Multi-Commodity Flow Trees},
journal = {Inf. Process. Lett.},
volume = {50},
number = {1},
pages = {49--55},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90044-2},
doi = {10.1016/0020-0190(94)90044-2},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KhullerRY94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/FurerR94,
author = {Martin F{\"{u}}rer and
Balaji Raghavachari},
title = {Approximating the Minimum-Degree Steiner Tree to within One of Optimal},
journal = {J. Algorithms},
volume = {17},
number = {3},
pages = {409--423},
year = {1994},
url = {https://doi.org/10.1006/jagm.1994.1042},
doi = {10.1006/JAGM.1994.1042},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/FurerR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/MillerBR0H94,
author = {Webb Miller and
Mark Boguski and
Balaji Raghavachari and
Zheng Zhang and
Ross C. Hardison},
title = {Constructing Aligned Sequence Blocks},
journal = {J. Comput. Biol.},
volume = {1},
number = {1},
pages = {51--64},
year = {1994},
url = {https://doi.org/10.1089/cmb.1994.1.51},
doi = {10.1089/CMB.1994.1.51},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/MillerBR0H94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/ZhangRHM94,
author = {Zheng Zhang and
Balaji Raghavachari and
Ross C. Hardison and
Webb Miller},
title = {Chaining Multiple-Alignment Blocks},
journal = {J. Comput. Biol.},
volume = {1},
number = {3},
pages = {217--226},
year = {1994},
url = {https://doi.org/10.1089/cmb.1994.1.217},
doi = {10.1089/CMB.1994.1.217},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/ZhangRHM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KaoFHR94,
author = {Ming{-}Yang Kao and
Martin F{\"{u}}rer and
Xin He and
Balaji Raghavachari},
title = {Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar
Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {7},
number = {4},
pages = {632--646},
year = {1994},
url = {https://doi.org/10.1137/S0895480191221453},
doi = {10.1137/S0895480191221453},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/KaoFHR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KhullerRY94,
author = {Samir Khuller and
Balaji Raghavachari and
Neal E. Young},
editor = {Daniel Dominic Sleator},
title = {Approximating the Minimum Equivalent Diagraph},
booktitle = {Proceedings of the Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms.
23-25 January 1994, Arlington, Virginia, {USA}},
pages = {177--186},
publisher = {{ACM/SIAM}},
year = {1994},
url = {http://dl.acm.org/citation.cfm?id=314464.314492},
timestamp = {Thu, 05 Jul 2018 07:29:19 +0200},
biburl = {https://dblp.org/rec/conf/soda/KhullerRY94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KhullerRY94,
author = {Samir Khuller and
Balaji Raghavachari and
Neal E. Young},
editor = {Frank Thomson Leighton and
Michael T. Goodrich},
title = {Low degree spanning trees of small weight},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Theory of
Computing, 23-25 May 1994, Montr{\'{e}}al, Qu{\'{e}}bec,
Canada},
pages = {412--421},
publisher = {{ACM}},
year = {1994},
url = {https://doi.org/10.1145/195058.195212},
doi = {10.1145/195058.195212},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KhullerRY94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KhullerRY93,
author = {Samir Khuller and
Balaji Raghavachari and
Neal E. Young},
editor = {Vijaya Ramachandran},
title = {Balancing Minimum Spanning and Shortest Path Trees},
booktitle = {Proceedings of the Fourth Annual {ACM/SIGACT-SIAM} Symposium on Discrete
Algorithms, 25-27 January 1993, Austin, Texas, {USA}},
pages = {243--250},
publisher = {{ACM/SIAM}},
year = {1993},
url = {http://dl.acm.org/citation.cfm?id=313559.313760},
timestamp = {Thu, 05 Jul 2018 07:29:11 +0200},
biburl = {https://dblp.org/rec/conf/soda/KhullerRY93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/KhullerRY93,
author = {Samir Khuller and
Balaji Raghavachari and
Neal E. Young},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Designing Multi-Commodity Flow Trees},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {433--441},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_268},
doi = {10.1007/3-540-57155-8\_268},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wads/KhullerRY93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/RaviRK92,
author = {R. Ravi and
Balaji Raghavachari and
Philip N. Klein},
editor = {R. K. Shyamasundar},
title = {Approximation Through Local Optimality: Designing Networks with Small
Degree},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
12th Conference, New Delhi, India, December 18-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {652},
pages = {279--290},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56287-7\_112},
doi = {10.1007/3-540-56287-7\_112},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/RaviRK92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FurerR92,
author = {Martin F{\"{u}}rer and
Balaji Raghavachari},
editor = {Greg N. Frederickson},
title = {Approximating the Minimum Degree Spanning Tree to Within One from
the Optimal Degree},
booktitle = {Proceedings of the Third Annual {ACM/SIGACT-SIAM} Symposium on Discrete
Algorithms, 27-29 January 1992, Orlando, Florida, {USA}},
pages = {317--324},
publisher = {{ACM/SIAM}},
year = {1992},
url = {http://dl.acm.org/citation.cfm?id=139404.139469},
timestamp = {Thu, 05 Jul 2018 07:29:02 +0200},
biburl = {https://dblp.org/rec/conf/soda/FurerR92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/FurerHKR92,
author = {Martin F{\"{u}}rer and
Xin He and
Ming{-}Yang Kao and
Balaji Raghavachari},
editor = {Lawrence Snyder},
title = {O(n log log n)-Work Parallel Algorithms for Straight-Line Grid Embeddings
of Planar Graphs},
booktitle = {Proceedings of the 4th Annual {ACM} Symposium on Parallel Algorithms
and Architectures, {SPAA} '92, San Diego, CA, USA, June 29 - July
1, 1992},
pages = {410--419},
publisher = {{ACM}},
year = {1992},
url = {https://doi.org/10.1145/140901.141933},
doi = {10.1145/140901.141933},
timestamp = {Wed, 21 Nov 2018 12:27:44 +0100},
biburl = {https://dblp.org/rec/conf/spaa/FurerHKR92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-21 17:59 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:
