Sanjiv Kapoor - researchr alias

researchr

You are not signed in
Sign in
Sign up

2010

Multipath Network Flows: Bounded Buffers and JitterTricha Anjali, Gruia Calinescu, Alexander Fortin, Sanjiv Kapoor, Nandakiran Kirubanandan, Sutep Tongngam. infocom 2010: 2714-2720 [doi]

Proximity Structures for Geometric GraphsSanjiv Kapoor, Xiang-Yang Li. ijcga, 20(4):415-429, 2010. [doi]

2009

Visibility queries in a polygonal regionRajasekhar Inkulu, Sanjiv Kapoor. comgeo, 42(9):852-864, 2009. [doi]

Planar rectilinear shortest path computation using corridorsRajasekhar Inkulu, Sanjiv Kapoor. comgeo, 42(9):873-884, 2009. [doi]

Geodesic Spanners on Polyhedral SurfacesSanjiv Kapoor, Xiang-Yang Li. isaac 2009: 213-223 [doi]

2008

A Fast and Simple Algorithm for Computing Market EquilibriaLisa Fleischer, Rahul Garg, Sanjiv Kapoor, Rohit Khandekar, Amin Saberi. wine 2008: 19-30 [doi]

2007

2006

Bounded-hops power assignment in ad hoc wireless networksGruia Calinescu, Sanjiv Kapoor, Mohammad Sarwat. DAM, 154(9):1358-1371, 2006. [doi]

Price Roll-Backs and Path Auctions: An Approximation Scheme for Computing the Market EquilibriumRahul Garg, Sanjiv Kapoor. wine 2006: 225-238 [doi]

Auction Algorithms for Market EquilibriumRahul Garg, Sanjiv Kapoor. mor, 31(4):714-729, 2006. [doi]

2005

An Auction-Based Market Equilibrium Algorithm for a Production ModelSanjiv Kapoor, Aranyak Mehta, Vijay V. Vazirani. wine 2005: 102-111 [doi]

2004

Auction algorithms for market equilibriumRahul Garg, Sanjiv Kapoor. stoc 2004: 511-518 [doi]

An Auction-Based Market Equilibrium Algorithm for the Separable Gross Substitutability CaseRahul Garg, Sanjiv Kapoor, Vijay V. Vazirani. approx 2004: 128-138 [doi]

2003

Network Lifetime and Power Assignment in ad hoc Wireless NetworksGruia Calinescu, Sanjiv Kapoor, Alexander Olshevsky, Alexander Zelikovsky. esa 2003: 114-126 [doi]

Proximity Structures for Geometric GraphsSanjiv Kapoor, Xiang-Yang Li. wads 2003: 365-376 [doi]

2002

Geometry Based Connectivity Compression of Triangular MeshesS. Nachiappan, Sanjiv Kapoor, Prem Kalra. icvgip 2002:

2001

Stream-Packing: Resource Allocation in Web Server Farms with a QoS GuaranteeJohara Shahabuddin, Abhay Chrungoo, Vishu Gupta, Sandeep Juneja, Sanjiv Kapoor, Arun Kumar. hipc 2001: 182-191 [doi]

2000

Dynamic Maintenance of Maxima of 2-d Point SetsSanjiv Kapoor. siamcomp, 29(6):1858-1877, 2000.

An Algorithm for Enumerating All Spanning Trees of a Directed GraphSanjiv Kapoor, H. Ramesh. algorithmica, 27(2):120-130, 2000. [doi]

Efficiently Constructing the Visibility Graph of a Simple Polygon with ObstaclesSanjiv Kapoor, S. N. Maheshwari. siamcomp, 30(3):847-871, 2000. [doi]

Foundations of Software Technology and Theoretical Computer Science, 20th Conference, FST TCS 2000 New Delhi, India, December 13-15, 2000, ProceedingsSanjiv Kapoor, Sanjiva Prasad, editors, Volume 1974 of Lecture Notes in Computer Science, Springer, 2000.

Optimal Hardware/Software Partitioning for Concurrent Specification Using Dynamic ProgrammingAviral Shrivastava, Mohit Kumar, Sanjiv Kapoor, Shashi Kumar, M. Balakrishnan. vlsid 2000: 110-113 [doi]

1999

Hardware/Software Partitioning Between Microprocessor and Reconfigurable HardwareM. Anand, Sanjiv Kapoor, M. Balakrishnan. fpga 1999: 249 [doi]

Efficient Computation of Geodesic Shortest PathsSanjiv Kapoor. stoc 1999: 770-779 [doi]

1997

On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning TreesGautam Das, Sanjiv Kapoor, Michiel H. M. Smid. algorithmica, 19(4):447-460, 1997.

An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the PlaneSanjiv Kapoor, S. N. Maheshwari, Joseph S. B. Mitchell. dcg, 18(4):377-383, 1997. [doi]

1996

1995

Faster Enumeration of All Spanning Trees of a Directed GraphRamesh Hariharan, Sanjiv Kapoor, Vijay Kumar. wads 1995: 428-439

Algorithms for Enumerating All Spanning Trees of Undirected and Weighted GraphsSanjiv Kapoor, H. Ramesh. siamcomp, 24(2):247-265, 1995.

1994

New Techniques for Exact and Approximate Dynamic Closest-Point ProblemsSanjiv Kapoor, Michiel H. M. Smid. compgeom 1994: 165-174 [doi]

Dynamic Maintenance of Maximas of 2-P Point SetsSanjiv Kapoor. compgeom 1994: 140-149 [doi]

1991

Stochastic Rearrangement Rules for Self-Organizing Data StructuresSanjiv Kapoor, Edward M. Reingold. algorithmica, 6(2):278-291, 1991.

Algorithms for Generating All Spanning Trees of Undirected, Directed and Weighted GraphsSanjiv Kapoor, H. Ramesh. wads 1991: 461-472

1989

Lower Bounds for Maximal and Convex Layers ProblemsSanjiv Kapoor, Prakash V. Ramanan. algorithmica, 4(4):447-459, 1989.

Optimum lopsided binary treesSanjiv Kapoor, Edward M. Reingold. JACM, 36(3):573-590, 1989. [doi]

1988

Efficient Algorithms for Euclidean Shortest Path and Visibility Problems with Polygonal ObstaclesSanjiv Kapoor, S. N. Maheshwari. compgeom 1988: 172-182 [doi]

1987

Minimizing Channel Density in Standard Cell LayoutJean R. S. Blair, Sanjiv Kapoor, Errol L. Lloyd, Kenneth J. Supowit. algorithmica, 2:267-282, 1987.

Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n):::2:::) TimeKenneth L. Clarkson, Sanjiv Kapoor, Pravin M. Vaidya. compgeom 1987: 251-257 [doi]

1986

Fast Algorithms for Convex Quadratic Programming and Multicommodity FlowsSanjiv Kapoor, Pravin M. Vaidya. stoc 1986: 147-159