Professor, Dept. of
Computer Science,Illinois Institute of Technology,
e-mail: <last-name> @iit.edu
(*-submitted)
Proximity Structures for
Geometric Graphs, Sanjiv Kapoor, Xiang-Yang
Li., Int.
J. Comput. Geometry Appl. 20(4): 415-429 (2010)
Rectilinear Paths using Corridor
Structures, R. Inkulu and S. Kapoor, CGTA, 2009
Visibility
Graph Construction using Corridors, R.Inkulu and S.
Kapoor, CGTA, 2009
* Price Roll-Back and Path Auctions, R. Garg and S.
Kapoor,
Auction
Algorithms for a Production Model, S. Kapoor. A. Mehta and V.V. Vazirani, Theoretical
Computer Science (2007) (invited).
Bounded
Diameter Graph Problems,
Auction
algorithms for Market Equilibrium, R. Garg and Sanjiv Kapoor, Mathematics of
Operations Research, Dec. 2006.
Bounded
Hops Power Assignment in Ad-hoc Wireless Networks, G. Calinescu,
Vol 154, Issue 9, June 2006.
Dynamically
Maintaining Maxima in 2-dimensions, SIAM J. Comput.
29(6):
1858-1877 (2000)
Efficiently
constructing the visibility graph of a Simple Polygon with Obstacles, (with S.N.Maheshwari),
30, No.
3, 2000, 847-871.
Algorithms
for Enumerating All Spanning Trees of Directed Graphs, (with H. Ramesh), Algorithmica 27(2): 120-130 (2000).
Conference Publications
Geodesic Spanners on Polyhedral Surfaces, Sanjiv Kapoor, Xiang-Yang Li: ISAAC 2009: 213-223
A Fast and Simple Algorithm for Computing Market Equilibria, Lisa Fleischer, Rahul Garg, Sanjiv Kapoor, Rohit Khandekar, Amin Saberi: WINE 2008: 19-30
Finding a Rectilinear Shortest Path
in R2 Using Corridor Based Staircase Structures. R. Inkulu,
Sanjiv Kapoor: FSTTCS 2007:
412-423
Market Equilibrium Using Auctions
for a Class of Gross-Substitute Utilities. Rahul Garg,
Sanjiv Kapoor: LNCS, Workshop on Internet
and Network Economics, 2007:
356-361
Price
Roll-Back and Path Auctions: A polynomial-time algorithm for the Fisher model.
R. Garg and S. Kapoor, LNCS, Workshop on Internet
and Network Economics, 2006.
Auction
Algorithms for a Production Model, S. Kapoor. A. Mehta and V.V. Vazirani, LNCS,
Workshop on Internet and Network Economics,
2005.
Auction
algorithms for Market Equilibrium, R. Garg and Sanjiv Kapoor, ACM
Symposium on Theory of Computing, 2004.
An
Auction-Based Market Equilibrium Algorithm for the Separable Gross
Substitutability Case, Rahul Garg, Sanjiv Kapoor, Vijay V. Vazirani,
pp.
128-138, APPROX-RANDOM LNCS(3122), Springer-Verlag, 2004.
Bounded Hops
Power Assignment in Ad-hoc Wireless Networks, G. Calinescu, S. Kapoor, and M.
Sarwat, IEEE WCNC 2004.
Proximity
Structures for Geometric Graphs, Sanjiv Kapoor and Xiang- Yang Li, Proceedings
of the Workshop on Algorithms and Data Structures,
LNCS Springer-Verlag, Aug 2003.
G. Calinescu,
of European Symposium on Algorithms (ESA03),
September 2003, LNCS 2832, pp.114-126.
Region
based image registration for wide-baseline stereo,(with
Geometry
Based Compression Of Triangular Meshes (with S.
Nachiappan and P. Kalra), 3rd ICGVIP,
Stream-Packing:
Resource Allocation in Web Server Farms with QOS Guarantee, (with J. Shahabuddin, A. Chungroo, V.
Gupta, A. Kumar),
HIPC-2001, Springer-Verlag.
Optimal
Hardware/Software Partitioning for Concurrent Specification using Dynamic
Programming (with A. Srivastava, M. Kumar, S. Kumar,
M. Balakrishnan) in VLSI Design Conference, IEEE
press, 2000.
Object
oriented Ellipsoid BSP Trees, (with N. Jain, S. Bansal),
ICVGIP,
Improved
Multicast Routing with Delay and Delay Variation Constraints, (with
2000.