The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Sanjiv Kapoor: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  36. Finding a Rectilinear Shortest Path in R2 Using Corridor Based Staircase Structures. [Citation Graph (, )][DBLP]


  37. Multipath Network Flows: Bounded Buffers and Jitter. [Citation Graph (, )][DBLP]


  38. Geodesic Spanners on Polyhedral Surfaces. [Citation Graph (, )][DBLP]


  39. A Fast and Simple Algorithm for Computing Market Equilibria. [Citation Graph (, )][DBLP]


  40. Market Equilibrium Using Auctions for a Class of Gross-Substitute Utilities. [Citation Graph (, )][DBLP]


  41. Approximation Algorithms For Multipath Setup. [Citation Graph (, )][DBLP]


  42. Planar rectilinear shortest path computation using corridors. [Citation Graph (, )][DBLP]


  43. Visibility queries in a polygonal region. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002