Amitabh Sinha Home Page Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2008
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJulia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha: On the approximability of some network design problems. ACM Transactions on Algorithms 4(2): (2008)
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLR. Ravi, Amitabh Sinha: Approximating k. European Journal of Operational Research 186(1): 77-90 (2008)
2007
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnupam Gupta, R. Ravi, Amitabh Sinha: LP Rounding Approximation Algorithms for Stochastic Network Design. Math. Oper. Res. 32(2): 345-364 (2007)
2006
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLR. Ravi, Amitabh Sinha: Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems. Math. Program. 108(1): 97-114 (2006)
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShuchi Chawla, Uday Rajan, R. Ravi, Amitabh Sinha: Min-Max payoffs in a two-player location game. Oper. Res. Lett. 34(5): 499-507 (2006)
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLR. Ravi, Amitabh Sinha: Approximation Algorithms for Problems Combining Facility Location and Network Design. Operations Research 54(1): 73-81 (2006)
2005
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha: What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization. APPROX-RANDOM 2005: 86-98
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJulia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha: On the approximability of some network design problems. SODA 2005: 943-951
2004
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShuchi Chawla, Uday Rajan, R. Ravi, Amitabh Sinha: Worst-case payoffs of a location game. ACM Conference on Electronic Commerce 2004: 244-245
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnupam Gupta, R. Ravi, Amitabh Sinha: An Edge in Time Saves Nine: LP Rounding Approximation Algorithms for Stochastic Network Design. FOCS 2004: 218-227
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLR. Ravi, Amitabh Sinha: Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems. IPCO 2004: 101-115
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLR. Ravi, Amitabh Sinha: Multicommodity facility location. SODA 2004: 342-349
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha: Boosted sampling: approximation algorithms for stochastic optimization. STOC 2004: 417-426
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha: Non-Clairvoyant Scheduling for Minimizing Mean Slowdown. Algorithmica 40(4): 305-318 (2004)
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJochen Könemann, Asaf Levin, Amitabh Sinha: Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. Algorithmica 41(2): 117-129 (2004)
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha: Min-max tree covers of graphs. Oper. Res. Lett. 32(4): 309-315 (2004)
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha: An approximation algorithm for the edge-dilation k-center problem, . Oper. Res. Lett. 32(5): 491-495 (2004)
2003
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShuchi Chawla, D. Kitchin, Uday Rajan, R. Ravi, Amitabh Sinha: Profit guaranteeing mechanisms for multicast networks. ACM Conference on Electronic Commerce 2003: 190-191
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJochen Könemann, Asaf Levin, Amitabh Sinha: Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. RANDOM-APPROX 2003: 109-121
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha: Covering Graphs Using Trees and Stars. RANDOM-APPROX 2003: 24-35
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha: Non-clairvoyant Scheduling for Minimizing Mean Slowdown. STACS 2003: 260-270
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha: Improved Approximations for Tour and Tree Covers. Algorithmica 38(3): 441-449 (2003)
2002
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha: Approximation Algorithms for Edge-Dilation k-Center Problems. SWAT 2002: 210-219
2000
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha: Improved approximations for tour and tree covers. APPROX 2000: 184-193
1996
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmitabh Sinha, Laxmikant V. Kalé: Towards Automatic Performance Analysis. ICPP, Vol. 3 1996: 53-60
1994
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaxmikant V. Kalé, Amitabh Sinha: Information Sharing Mechanisms in Parallel Programs. IPPS 1994: 461-468
1993
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmitabh Sinha, Laxmikant V. Kalé: A Load Balancing Strategy for Prioritized Execution of Tasks. IPPS 1993: 230-237
1992
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaxmikant V. Kalé, Balkrishna Ramkumar, Vikram A. Saletore, Amitabh Sinha: Prioritization in Parallel Symbolic Computing. Parallel Symbolic Computing 1992: 12-41
1991
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Fenton, Balkrishna Ramkumar, Vikram A. Saletore, Amitabh Sinha, Laxmikant V. Kalé: Supporting Machine Independent Programming on Diverse Parallel Architectures. ICPP (2) 1991: 193-201
1990
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMohan Ahuja, Kannan Varadhan, Amitabh Sinha: Flush Message Passing in Communicating Sequential Processes. PARBASE / Architectures 1990: 31-47

Coauthor Index

1Mohan Ahuja [1]
2Nikhil Bansal [10] [17]
3Shuchi Chawla [13] [22] [26]
4Julia Chuzhoy [23] [30]
5Kedar Dhamdhere [10] [17]
6Guy Even [11] [15]
7Wayne Fenton [2]
8Naveen Garg [11] [15]
9Anupam Gupta [18] [21] [23] [24] [28] [30]
10Laxmikant V. Kalé [2] [3] [4] [5] [6]
11D. Kitchin [13]
12Jochen Könemann [7] [8] [9] [10] [11] [12] [14] [15] [16] [17]
13Goran Konjevod [7] [9]
14Asaf Levin [12] [16]
15Yanjun Li [8] [14]
16Joseph Naor (Seffi Naor) [23] [30]
17Martin Pál (Martin Pal) [18] [24]
18Ojas Parekh [7] [8] [9] [14]
19Uday Rajan [13] [22] [26]
20Balkrishna Ramkumar [2] [3]
21R. Ravi [11] [13] [15] [18] [19] [20] [21] [22] [24] [25] [26] [27] [28] [29]
22Vikram A. Saletore [2] [3]
23Kannan Varadhan [1]

Colors in the list of coauthors

Copyright © Tue Nov 24 16:13:34 2009 by Michael Ley (ley@uni-trier.de)