R. Ravi

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
35Special Section on Foundations of Computer Science. Scott Aaronson, Jeff Erickson, Mohammad Mahdian, R. Ravi, Emanuele Viola. SIAM J. Comput. (40): 770 (2011). Web SearchBibTeXDownload
34We know who you followed last summer: inferring social link creation times in twitter. Brendan Meeder, Brian Karrer, Amin Sayedi, R. Ravi, Christian Borgs, Jennifer T. Chayes. WWW 2011, 517-526. Web SearchBibTeXDownload
2010
33Game-Theoretic Models of Information Overload in Social Networks. Christian Borgs, Jennifer T. Chayes, Brian Karrer, Brendan Meeder, R. Ravi, Ray Reagans, Amin Sayedi. WAW 2010, 146-161. Web SearchBibTeXDownload
2009
32Line-of-Sight Networks. Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren Debany. Combinatorics, Probability & Computing (18): 145-163 (2009). Web SearchBibTeXDownload
2007
31Pricing Tree Access Networks with Connected Backbones. Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. Ravi. ESA 2007, 498-509. Web SearchBibTeXDownload
30Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice. Srinath Sridhar, Kedar Dhamdhere, Guy E. Blelloch, Eran Halperin, R. Ravi, Russell Schwartz. IEEE/ACM Trans. Comput. Biology Bioinform. (4): 561-571 (2007). Web SearchBibTeXDownload
29An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer. SODA 2007, 1153-1162. Web SearchBibTeXDownload
28Line-of-sight networks. Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren Debany. SODA 2007, 968-977. Web SearchBibTeXDownload
2006
27Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction. Guy E. Blelloch, Kedar Dhamdhere, Eran Halperin, R. Ravi, Russell Schwartz, Srinath Sridhar. ICALP (1) 2006, 667-678. Web SearchBibTeXDownload
26Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees. Srinath Sridhar, Kedar Dhamdhere, Guy E. Blelloch, Eran Halperin, R. Ravi, Russell Schwartz. International Conference on Computational Science (2) 2006, 799-806. Web SearchBibTeXDownload
25Approximation Algorithms for Minimizing Average Distortion. Kedar Dhamdhere, Anupam Gupta, R. Ravi. Theory Comput. Syst. (39): 93-111 (2006). Web SearchBibTeXDownload
2005
24How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems. Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Singh. FOCS 2005, 367-378. Web SearchBibTeXDownload
23On Two-Stage Stochastic Minimum Spanning Trees. Kedar Dhamdhere, R. Ravi, Mohit Singh. IPCO 2005, 321-334. Web SearchBibTeXDownload
22Approximation algorithms for low-distortion embeddings into low-dimensional spaces. Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Yuri Rabinovich, Harald Räcke, R. Ravi, Anastasios Sidiropoulos. SODA 2005, 119-128. Web SearchBibTeXDownload
21Finding effective support-tree preconditioners. Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ravi, Shan Leung Maverick Woo. SPAA 2005, 176-185. Web SearchBibTeXDownload
2004
20Approximation Algorithms for Minimizing Average Distortion. Kedar Dhamdhere, Anupam Gupta, R. Ravi. STACS 2004, 234-245. Web SearchBibTeXDownload
2001
19Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems. R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III. Algorithmica (31): 58-78 (2001). Web SearchBibTeXDownload
2000
18Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions. Milind Dawande, Jayant Kalagnanam, Pinar Keskinocak, F. Sibel Salman, R. Ravi. J. Comb. Optim. (4): 171-186 (2000). Web SearchBibTeXDownload
17Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems. Avrim Blum, Goran Konjevod, R. Ravi, Santosh Vempala. Theor. Comput. Sci. (235): 25-42 (2000). Web SearchBibTeXDownload
1999
16Improving Minimum Cost Spanning Trees by Upgrading Nodes. Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth. J. Algorithms (33): 92-111 (1999). Web SearchBibTeXDownload
15A Constant-Factor Approximation Algorithm for the k-MST Problem. Avrim Blum, R. Ravi, Santosh Vempala. J. Comput. Syst. Sci. (58): 101-108 (1999). Web SearchBibTeXDownload
14Redeeming Nested Dissection: Parallelism Implies Fill. Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi. PPSC 1999. Web SearchBibTeX
13Improving Spanning Trees by Upgrading Nodes. Sven Oliver Krumke, Hartmut Noltemeier, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth. Theor. Comput. Sci. (221): 139-155 (1999). Web SearchBibTeXDownload
1998
12Bicriteria Network Design Problems. Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III. J. Algorithms (28): 142-171 (1998). Web SearchBibTeXDownload
11Approximation Algorithms for Certain Network Improvement Problems. Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi. J. Comb. Optim. (2): 257-288 (1998). Web SearchBibTeXDownload
10Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering Problems. Avrim Blum, Goran Konjevod, R. Ravi, Santosh Vempala. STOC 1998, 100-105. Web SearchBibTeXDownload
1997
9Parallelizing Elimination Orders with Linear Fill. Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi. FOCS 1997, 274-283. Web SearchBibTeXDownload
8Improving Spanning Trees by Upgrading Nodes. Sven Oliver Krumke, Hartmut Noltemeier, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth. ICALP 1997, 281-291. Web SearchBibTeXDownload
1996
7Spanning Trees - Short or Small. R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi. SIAM J. Discrete Math. (9): 178-200 (1996). Web SearchBibTeXDownload
6A Constant-factor Approximation Algorithm for the k MST Problem (Extended Abstract). Avrim Blum, R. Ravi, Santosh Vempala. STOC 1996, 442-448. Web SearchBibTeXDownload
5Service-Constrained Network Design Problems. Madhav V. Marathe, R. Ravi, Ravi Sundaram. SWAT 1996, 28-40. Web SearchBibTeXDownload
1995
4Computing Similarity between RNA Strings. Vineet Bafna, S. Muthukrishnan, R. Ravi. CPM 1995, 1-16. Cited by 89Web SearchBibTeXDownload
3Bicriteria Network Design Problems. Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III. ICALP 1995, 487-498. Web SearchBibTeXDownload
1994
2Spanning Trees Short or Small. R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi. SODA 1994, 546-555. Web SearchBibTeXDownload
1993
1Many birds with one stone: multi-objective approximation algorithms. R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III. STOC 1993, 438-447. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research