dblp.uni-trier.dewww.uni-trier.de

Sanjiv Kapoor Vis

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

*2008
42EELisa Fleischer, Rahul Garg, Sanjiv Kapoor, Rohit Khandekar, Amin Saberi: A Fast and Simple Algorithm for Computing Market Equilibria. WINE 2008: 19-30
2007
41EER. Inkulu, Sanjiv Kapoor: Finding a Rectilinear Shortest Path in R2 Using Corridor Based Staircase Structures. FSTTCS 2007: 412-423
40EETricha Anjali, Gruia Calinescu, Sanjiv Kapoor: Approximation Algorithms For Multipath Setup. GLOBECOM 2007: 438-442
39EERahul Garg, Sanjiv Kapoor: Market Equilibrium Using Auctions for a Class of Gross-Substitute Utilities. WINE 2007: 356-361
38EESanjiv Kapoor, Aranyak Mehta, Vijay V. Vazirani: An auction-based market equilibrium algorithm for a production model. Theor. Comput. Sci. 378(2): 153-164 (2007)
37EESanjiv Kapoor, Mohammad Sarwat: Bounded-Diameter Minimum-Cost Graph Problems. Theory Comput. Syst. 41(4): 779-794 (2007)
2006
36EERahul Garg, Sanjiv Kapoor: Price Roll-Backs and Path Auctions: An Approximation Scheme for Computing the Market Equilibrium. WINE 2006: 225-238
35EEGruia Calinescu, Sanjiv Kapoor, Mohammad Sarwat: Bounded-hops power assignment in ad hoc wireless networks. Discrete Applied Mathematics 154(9): 1358-1371 (2006)
34EERahul Garg, Sanjiv Kapoor: Auction Algorithms for Market Equilibrium. Math. Oper. Res. 31(4): 714-729 (2006)
2005
33EESanjiv Kapoor, Aranyak Mehta, Vijay V. Vazirani: An Auction-Based Market Equilibrium Algorithm for a Production Model. WINE 2005: 102-111
2004
32EERahul Garg, Sanjiv Kapoor, Vijay V. Vazirani: An Auction-Based Market Equilibrium Algorithm for the Separable Gross Substitutability Case. APPROX-RANDOM 2004: 128-138
31EERahul Garg, Sanjiv Kapoor: Auction algorithms for market equilibrium. STOC 2004: 511-518
2003
30EEGruia Calinescu, Sanjiv Kapoor, Alexander Olshevsky, Alexander Zelikovsky: Network Lifetime and Power Assignment in ad hoc Wireless Networks. ESA 2003: 114-126
29EESanjiv Kapoor, Xiang-Yang Li: Proximity Structures for Geometric Graphs. WADS 2003: 365-376
2002
28 S. Nachiappan, Sanjiv Kapoor, Prem Kalra: Geometry Based Connectivity Compression of Triangular Meshes. ICVGIP 2002
2001
27EEJohara Shahabuddin, Abhay Chrungoo, Vishu Gupta, Sandeep Juneja, Sanjiv Kapoor, Arun Kumar: Stream-Packing: Resource Allocation in Web Server Farms with a QoS Guarantee. HiPC 2001: 182-191
2000
26 Sanjiv Kapoor, Sanjiva Prasad: Foundations of Software Technology and Theoretical Computer Science, 20th Conference, FST TCS 2000 New Delhi, India, December 13-15, 2000, Proceedings. Springer 2000
25EEAviral Shrivastava, Mohit Kumar, Sanjiv Kapoor, Shashi Kumar, M. Balakrishnan: Optimal Hardware/Software Partitioning for Concurrent Specification Using Dynamic Programming. VLSI Design 2000: 110-113
24EESanjiv Kapoor, H. Ramesh: An Algorithm for Enumerating All Spanning Trees of a Directed Graph. Algorithmica 27(2): 120-130 (2000)
23 Sanjiv Kapoor: Dynamic Maintenance of Maxima of 2-d Point Sets. SIAM J. Comput. 29(6): 1858-1877 (2000)
22EESanjiv Kapoor, S. N. Maheshwari: Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles. SIAM J. Comput. 30(3): 847-871 (2000)
1999
21EEM. Anand, Sanjiv Kapoor, M. Balakrishnan: Hardware/Software Partitioning Between Microprocessor and Reconfigurable Hardware. FPGA 1999: 249
20EESanjiv Kapoor: Efficient Computation of Geodesic Shortest Paths. STOC 1999: 770-779
1997
19 Gautam Das, Sanjiv Kapoor, Michiel H. M. Smid: On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. Algorithmica 19(4): 447-460 (1997)
18EESanjiv Kapoor, S. N. Maheshwari, Joseph S. B. Mitchell: An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane. Discrete & Computational Geometry 18(4): 377-383 (1997)
1996
17EESanjiv Kapoor, Tripurari Singh: Dynamic Maintenance of Shortest Path Trees in Simple Polygons. FSTTCS 1996: 123-134
16EEGautam Das, Sanjiv Kapoor, Michiel H. M. Smid: On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. FSTTCS 1996: 64-75
15EESanjiv Kapoor: On Minimum 3-Cuts and Approximating k-Cuts Using Cut Trees. IPCO 1996: 132-146
14 Sanjiv Kapoor, Pravin M. Vaidya: Speeding up Karmarkar's algorithm for multicommodity flows. Math. Program. 73: 111-127 (1996)
13 Sanjiv Kapoor, Michiel H. M. Smid: New Techniques for Exact and Approximate Dynamic Closest-Point Problems. SIAM J. Comput. 25(4): 775-796 (1996)
1995
12 Ramesh Hariharan, Sanjiv Kapoor, Vijay Kumar: Faster Enumeration of All Spanning Trees of a Directed Graph. WADS 1995: 428-439
11 Sanjiv Kapoor, H. Ramesh: Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs. SIAM J. Comput. 24(2): 247-265 (1995)
1994
10EESanjiv Kapoor: Dynamic Maintenance of Maximas of 2-P Point Sets. Symposium on Computational Geometry 1994: 140-149
9EESanjiv Kapoor, Michiel H. M. Smid: New Techniques for Exact and Approximate Dynamic Closest-Point Problems. Symposium on Computational Geometry 1994: 165-174
1991
8 Sanjiv Kapoor, H. Ramesh: Algorithms for Generating All Spanning Trees of Undirected, Directed and Weighted Graphs. WADS 1991: 461-472
7 Sanjiv Kapoor, Edward M. Reingold: Stochastic Rearrangement Rules for Self-Organizing Data Structures. Algorithmica 6(2): 278-291 (1991)
1989
6 Sanjiv Kapoor, Prakash V. Ramanan: Lower Bounds for Maximal and Convex Layers Problems. Algorithmica 4(4): 447-459 (1989)
5EESanjiv Kapoor, Edward M. Reingold: Optimum lopsided binary trees. J. ACM 36(3): 573-590 (1989)
1988
4EESanjiv Kapoor, S. N. Maheshwari: Efficient Algorithms for Euclidean Shortest Path and Visibility Problems with Polygonal Obstacles. Symposium on Computational Geometry 1988: 172-182
1987
3EEKenneth L. Clarkson, Sanjiv Kapoor, Pravin M. Vaidya: Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n)2) Time. Symposium on Computational Geometry 1987: 251-257
2 Jean R. S. Blair, Sanjiv Kapoor, Errol L. Lloyd, Kenneth J. Supowit: Minimizing Channel Density in Standard Cell Layout. Algorithmica 2: 267-282 (1987)
1986
1 Sanjiv Kapoor, Pravin M. Vaidya: Fast Algorithms for Convex Quadratic Programming and Multicommodity Flows STOC 1986: 147-159

Coauthor Index

1M. Anand [21]
2Tricha Anjali [40]
3M. Balakrishnan [21] [25]
4Jean R. S. Blair [2]
5Gruia Calinescu [30] [35] [40]
6Abhay Chrungoo [27]
7Kenneth L. Clarkson [3]
8Gautam Das [16] [19]
9Lisa Fleischer [42]
10Rahul Garg [31] [32] [34] [36] [39] [42]
11Vishu Gupta [27]
12Ramesh Hariharan [12]
13R. Inkulu [41]
14Sandeep Juneja [27]
15Prem Kumar Kalra (Prem Kalra) [28]
16Rohit Khandekar [42]
17Arun Kumar [27]
18Mohit Kumar [25]
19Shashi Kumar [25]
20Vijay Kumar [12]
21Xiang-Yang Li [29]
22Errol L. Lloyd [2]
23S. N. Maheshwari [4] [18] [22]
24Aranyak Mehta [33] [38]
25Joseph S. B. Mitchell [18]
26S. Nachiappan [28]
27Alexander Olshevsky [30]
28Sanjiva Prasad [26]
29Prakash V. Ramanan [6]
30H. Ramesh [8] [11] [24]
31Edward M. Reingold [5] [7]
32Amin Saberi [42]
33Mohammad Sarwat [35] [37]
34Johara Shahabuddin [27]
35Aviral Shrivastava [25]
36Tripurari Singh [17]
37Michiel H. M. Smid [9] [13] [16] [19]
38Kenneth J. Supowit [2]
39Pravin M. Vaidya [1] [3] [14]
40Vijay V. Vazirani [32] [33] [38]
41Alexander Zelikovsky [30]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)