 | 2008 |
|---|
| 42 |       | Lisa Fleischer,
Rahul Garg,
Sanjiv Kapoor,
Rohit Khandekar,
Amin Saberi:
A Fast and Simple Algorithm for Computing Market Equilibria.
WINE 2008: 19-30 |
| 2007 |
|---|
| 41 | | R. Inkulu,
Sanjiv Kapoor:
Finding a Rectilinear Shortest Path in R2 Using Corridor Based Staircase Structures.
FSTTCS 2007: 412-423 |
| 40 | | Tricha Anjali,
Gruia Calinescu,
Sanjiv Kapoor:
Approximation Algorithms For Multipath Setup.
GLOBECOM 2007: 438-442 |
| 39 | | Rahul Garg,
Sanjiv Kapoor:
Market Equilibrium Using Auctions for a Class of Gross-Substitute Utilities.
WINE 2007: 356-361 |
| 38 | | Sanjiv Kapoor,
Aranyak Mehta,
Vijay V. Vazirani:
An auction-based market equilibrium algorithm for a production model.
Theor. Comput. Sci. 378(2): 153-164 (2007) |
| 37 | | Sanjiv Kapoor,
Mohammad Sarwat:
Bounded-Diameter Minimum-Cost Graph Problems.
Theory Comput. Syst. 41(4): 779-794 (2007) |
| 2006 |
|---|
| 36 | | Rahul Garg,
Sanjiv Kapoor:
Price Roll-Backs and Path Auctions: An Approximation Scheme for Computing the Market Equilibrium.
WINE 2006: 225-238 |
| 35 | | Gruia Calinescu,
Sanjiv Kapoor,
Mohammad Sarwat:
Bounded-hops power assignment in ad hoc wireless networks.
Discrete Applied Mathematics 154(9): 1358-1371 (2006) |
| 34 | | Rahul Garg,
Sanjiv Kapoor:
Auction Algorithms for Market Equilibrium.
Math. Oper. Res. 31(4): 714-729 (2006) |
| 2005 |
|---|
| 33 | | Sanjiv Kapoor,
Aranyak Mehta,
Vijay V. Vazirani:
An Auction-Based Market Equilibrium Algorithm for a Production Model.
WINE 2005: 102-111 |
| 2004 |
|---|
| 32 | | Rahul Garg,
Sanjiv Kapoor,
Vijay V. Vazirani:
An Auction-Based Market Equilibrium Algorithm for the Separable Gross Substitutability Case.
APPROX-RANDOM 2004: 128-138 |
| 31 | | Rahul Garg,
Sanjiv Kapoor:
Auction algorithms for market equilibrium.
STOC 2004: 511-518 |
| 2003 |
|---|
| 30 | | Gruia Calinescu,
Sanjiv Kapoor,
Alexander Olshevsky,
Alexander Zelikovsky:
Network Lifetime and Power Assignment in ad hoc Wireless Networks.
ESA 2003: 114-126 |
| 29 | | Sanjiv 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 |
|---|
| 27 | | Johara 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 |
| 25 | | Aviral Shrivastava,
Mohit Kumar,
Sanjiv Kapoor,
Shashi Kumar,
M. Balakrishnan:
Optimal Hardware/Software Partitioning for Concurrent Specification Using Dynamic Programming.
VLSI Design 2000: 110-113 |
| 24 | | Sanjiv 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) |
| 22 | | Sanjiv Kapoor,
S. N. Maheshwari:
Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles.
SIAM J. Comput. 30(3): 847-871 (2000) |
| 1999 |
|---|
| 21 | | M. Anand,
Sanjiv Kapoor,
M. Balakrishnan:
Hardware/Software Partitioning Between Microprocessor and Reconfigurable Hardware.
FPGA 1999: 249 |
| 20 | | Sanjiv 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) |
| 18 | | Sanjiv 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 |
|---|
| 17 | | Sanjiv Kapoor,
Tripurari Singh:
Dynamic Maintenance of Shortest Path Trees in Simple Polygons.
FSTTCS 1996: 123-134 |
| 16 | | Gautam Das,
Sanjiv Kapoor,
Michiel H. M. Smid:
On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees.
FSTTCS 1996: 64-75 |
| 15 | | Sanjiv 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 |
|---|
| 10 | | Sanjiv Kapoor:
Dynamic Maintenance of Maximas of 2-P Point Sets.
Symposium on Computational Geometry 1994: 140-149 |
| 9 | | Sanjiv 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) |
| 5 | | Sanjiv Kapoor,
Edward M. Reingold:
Optimum lopsided binary trees.
J. ACM 36(3): 573-590 (1989) |
| 1988 |
|---|
| 4 | | Sanjiv Kapoor,
S. N. Maheshwari:
Efficient Algorithms for Euclidean Shortest Path and Visibility Problems with Polygonal Obstacles.
Symposium on Computational Geometry 1988: 172-182 |
| 1987 |
|---|
| 3 | | Kenneth 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 |
