Остановите войну!
for scientists:
default search action
Sanjiv Kapoor
- > Home > Persons > Sanjiv Kapoor
Publications
- 2019
- [c44]R. Inkulu, Sanjiv Kapoor:
Approximate Euclidean Shortest Paths in Polygonal Domains. ISAAC 2019: 11:1-11:17 - 2016
- [j21]Lisa Fleischer, Rahul Garg, Sanjiv Kapoor, Rohit Khandekar, Amin Saberi:
A Simple and Efficient Algorithm for Computing Market Equilibria. ACM Trans. Algorithms 12(3): 34:1-34:15 (2016) - 2015
- [i9]Rajasekhar Inkulu, Sanjiv Kapoor:
A polynomial time algorithm for finding an approximate shortest path amid weighted regions. CoRR abs/1501.00340 (2015) - [i8]Rajasekhar Inkulu, Sanjiv Kapoor:
Coresets of obstacles in approximating Euclidean shortest path amid convex obstacles. CoRR abs/1506.01769 (2015) - 2010
- [i2]Rajasekhar Inkulu, Sanjiv Kapoor, S. N. Maheshwari:
A near optimal algorithm for finding Euclidean shortest path in polygonal domain. CoRR abs/1011.6481 (2010) - [i1]Rajasekhar Inkulu, Sanjiv Kapoor:
Approximate Shortest Path through a Weighted Planar Subdivision. CoRR abs/1011.6498 (2010) - 2009
- [j18]Rajasekhar Inkulu, Sanjiv Kapoor:
Visibility queries in a polygonal region. Comput. Geom. 42(9): 852-864 (2009) - [j17]Rajasekhar Inkulu, Sanjiv Kapoor:
Planar rectilinear shortest path computation using corridors. Comput. Geom. 42(9): 873-884 (2009) - 2008
- [c27]Lisa Fleischer, Rahul Garg, Sanjiv Kapoor, Rohit Khandekar, Amin Saberi:
A Fast and Simple Algorithm for Computing Market Equilibria. WINE 2008: 19-30 - 2007
- [j15]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) - [c26]Rajasekhar Inkulu, Sanjiv Kapoor:
Finding a Rectilinear Shortest Path in R2 Using Corridor Based Staircase Structures. FSTTCS 2007: 412-423 - [c24]Rahul Garg, Sanjiv Kapoor:
Market Equilibrium Using Auctions for a Class of Gross-Substitute Utilities. WINE 2007: 356-361 - 2006
- [j13]Rahul Garg, Sanjiv Kapoor:
Auction Algorithms for Market Equilibrium. Math. Oper. Res. 31(4): 714-729 (2006) - [c23]Rahul Garg, Sanjiv Kapoor:
Price Roll-Backs and Path Auctions: An Approximation Scheme for Computing the Market Equilibrium. WINE 2006: 225-238 - 2005
- [c22]Sanjiv Kapoor, Aranyak Mehta, Vijay V. Vazirani:
An Auction-Based Market Equilibrium Algorithm for a Production Model. WINE 2005: 102-111 - 2004
- [c21]Rahul Garg, Sanjiv Kapoor, Vijay V. Vazirani:
An Auction-Based Market Equilibrium Algorithm for the Separable Gross Substitutability Case. APPROX-RANDOM 2004: 128-138 - [c20]Rahul Garg, Sanjiv Kapoor:
Auction algorithms for market equilibrium. STOC 2004: 511-518 - 2002
- [c16]S. Nachiappan, Sanjiv Kapoor, Prem Kalra:
Geometry Based Connectivity Compression of Triangular Meshes. ICVGIP 2002 - 2000
- [j10]Sanjiv Kapoor, S. N. Maheshwari:
Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles. SIAM J. Comput. 30(3): 847-871 (2000) - [e1]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. Lecture Notes in Computer Science 1974, Springer 2000, ISBN 3-540-41413-4 [contents] - 1997
- [j8]Sanjiv Kapoor, S. N. Maheshwari, Joseph S. B. Mitchell:
An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane. Discret. Comput. Geom. 18(4): 377-383 (1997) - 1995
- [c7]Ramesh Hariharan, Sanjiv Kapoor, Vijay Kumar:
Faster Enumeration of All Spanning Trees of a Directed Graph. WADS 1995: 428-439 - 1988
- [c3]Sanjiv Kapoor, S. N. Maheshwari:
Efficient Algorithms for Euclidean Shortest Path and Visibility Problems with Polygonal Obstacles. SCG 1988: 172-182
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-02-06 23:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint