default search action
Sanjiv Kapoor
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c48]Li Zhang, Sanjiv Kapoor:
Fairness of Equilibrium in Proportional Sharing Mechanisms with Bid Costs. Allerton 2024: 1-8 - 2022
- [c47]Li Zhang, Mohit Hota, Sanjiv Kapoor:
Game Theoretic Analysis of Resource Allocation in Multi-tiered Networks. GAMENETS 2022: 200-214 - [c46]Yi Zhang, Sanjiv Kapoor:
Budgeted Adversarial Network Resource Utilization Games. GAMENETS 2022: 339-365 - [c45]Yi Zhang, Sanjiv Kapoor:
Impact of Vaccination and Testing in an Urban Campus Model for the SARS-CoV-2 Pandemic. GoodIT 2022: 183-190 - 2020
- [j22]Sanjiv Kapoor
, Junghwan Shin:
Price of Anarchy in Networks with Heterogeneous Latency Functions. Math. Oper. Res. 45(2): 755-773 (2020)
2010 – 2019
- 2019
- [c44]R. Inkulu, Sanjiv Kapoor:
Approximate Euclidean Shortest Paths in Polygonal Domains. ISAAC 2019: 11:1-11:17 - 2018
- [c43]Mohit Hota, Sanjiv Kapoor:
Priority Based Wireless Multi-Network Selection Games. MobiHoc 2018: 290-299 - [c42]Mohit Hota, Sanjiv Kapoor:
Equilibrium and Inefficiency in Multi-product Cournot Games. WINE 2018: 203-217 - 2017
- [c41]Praneeth Tota, Sanjiv Kapoor, Benjamin Grimmer:
Economic inefficiency in resource allocation games. Allerton 2017: 708-715 - [c40]Mohit Hota, Sanjiv Kapoor:
Nash Equilibrium and Stability in Network Selection Games. GAMENETS 2017: 40-50 - 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) - [c39]Benjamin Grimmer
Nash equilibrium and the price of anarchy in priority based network routing. INFOCOM 2016: 1-9 - 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) - 2014
- [c38]Ehsan Monsef, Tricha Anjali, Sanjiv Kapoor:
Price of Anarchy in network routing with class based capacity guarantees. INFOCOM 2014: 2409-2417 - [i7]Sanjiv Kapoor, Junghwan Shin:
Price of Anarchy with Heterogeneous Latency Functions. CoRR abs/1407.2991 (2014) - 2013
- [c37]Junghwan Shin, Fabrizio Devetak, Tricha Anjali, Sanjiv Kapoor:
Concurrent multipath routing over bounded paths: Minimizing delay variance. GLOBECOM 2013: 1483-1488 - [c36]Mohammad Sarwat, Junghwan Shin, Sanjiv Kapoor:
Server allocation in a CDN. ICC 2013: 3748-3752 - [i6]Sanjiv Kapoor, Mohammad Sarwat:
The Budgeted Transportation Problem. CoRR abs/1302.5871 (2013) - [i5]Sanjiv Kapoor, Xiang-Yang Li:
Efficient Construction of Spanners in $d$-Dimensions. CoRR abs/1303.7217 (2013) - [i4]Junghwan Shin, Sanjiv Kapoor:
Auction Algorithm for Production Models. CoRR abs/1304.4618 (2013) - [i3]Sanjiv Kapoor, Hemanshu Kaul:
Approximating Quadratic 0-1 Programming via SOCP. CoRR abs/1312.7042 (2013) - 2012
- [j20]Tayo Obafemi-Ajayi
Cluster-K+: Network topology for searching replicated data in p2p systems. Inf. Process. Manag. 48(5): 841-854 (2012) - 2011
- [c35]Gruia Calinescu
Adversary Games in Secure/Reliable Network Routing. GAMENETS 2011: 249-264 - [c34]Gruia Calinescu
Stochastic Strategic Routing Reduces Attack Effects. GLOBECOM 2011: 1-5 - [c33]Ping Xu, Sanjiv Kapoor, Xiang-Yang Li:
Market Equilibria in Spectrum Trading with Multi-Regions and Multi-Channels. GLOBECOM 2011: 1-5 - [c32]Fabrizio Devetak, Junghwan Shin, Tricha Anjali, Sanjiv Kapoor:
Minimizing Path Delay in Multipath Networks. ICC 2011: 1-5 - [c31]Sanjiv Kapoor:
Buy-Sell Auction Mechanisms in Market Equilibrium. WINE 2011: 230-241 - 2010
- [j19]Sanjiv Kapoor, Xiang-Yang Li:
Proximity Structures for Geometric Graphs. Int. J. Comput. Geom. Appl. 20(4): 415-429 (2010) - [c30]Tricha Anjali, Alexander Fortin, Sanjiv Kapoor:
Multi-Commodity Network Flows over Multipaths with Bounded Buffers. ICC 2010: 1-5 - [c29]Tricha Anjali, Gruia Calinescu
Multipath Network Flows: Bounded Buffers and Jitter. INFOCOM 2010: 2714-2720 - [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)
2000 – 2009
- 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) - [c28]Sanjiv Kapoor, Xiang-Yang Li:
Geodesic Spanners on Polyhedral Surfaces. ISAAC 2009: 213-223 - 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
- [j16]Sanjiv Kapoor, Mohammad Sarwat:
Bounded-Diameter Minimum-Cost Graph Problems. Theory Comput. Syst. 41(4): 779-794 (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 - [c25]Tricha Anjali, Gruia Calinescu
Approximation Algorithms For Multipath Setup. GLOBECOM 2007: 438-442 - [c24]Rahul Garg, Sanjiv Kapoor:
Market Equilibrium Using Auctions for a Class of Gross-Substitute Utilities. WINE 2007: 356-361 - 2006
- [j14]Gruia Calinescu
Bounded-hops power assignment in ad hoc wireless networks. Discret. Appl. Math. 154(9): 1358-1371 (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 - [c19]Gruia Calinescu
Bounded-hops power assignment in ad-hoc wireless networks. WCNC 2004: 1494-1499 - 2003
- [c18]Gruia Calinescu, Sanjiv Kapoor, Alexander Olshevsky, Alexander Zelikovsky:
Network Lifetime and Power Assignment in ad hoc Wireless Networks. ESA 2003: 114-126 - [c17]Sanjiv Kapoor, Xiang-Yang Li:
Proximity Structures for Geometric Graphs. WADS 2003: 365-376 - 2002
- [c16]S. Nachiappan, Sanjiv Kapoor, Prem Kalra:
Geometry Based Connectivity Compression of Triangular Meshes. ICVGIP 2002 - 2001
- [c15]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
- [j12]Sanjiv Kapoor, H. Ramesh:
An Algorithm for Enumerating All Spanning Trees of a Directed Graph. Algorithmica 27(2): 120-130 (2000) - [j11]Sanjiv Kapoor:
Dynamic Maintenance of Maxima of 2-d Point Sets. SIAM J. Comput. 29(6): 1858-1877 (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) - [c14]Sanjiv Kapoor, Srivatsan Raghavan:
Improved multicast routing with delay and delay variation constraints. GLOBECOM 2000: 476-480 - [c13]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 - [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]
1990 – 1999
- 1999
- [c12]M. Anand, Sanjiv Kapoor, M. Balakrishnan:
Hardware/Software Partitioning Between Microprocessor and Reconfigurable Hardware. FPGA 1999: 249 - [c11]Sanjiv Kapoor:
Efficient Computation of Geodesic Shortest Paths. STOC 1999: 770-779 - 1997
- [j9]Gautam Das
On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. Algorithmica 19(4): 447-460 (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) - 1996
- [j7]Sanjiv Kapoor, Pravin M. Vaidya:
Speeding up Karmarkar's algorithm for multicommodity flows. Math. Program. 73: 111-127 (1996) - [j6]Sanjiv Kapoor, Michiel H. M. Smid:
New Techniques for Exact and Approximate Dynamic Closest-Point Problems. SIAM J. Comput. 25(4): 775-796 (1996) - [c10]Gautam Das
On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. FSTTCS 1996: 64-75 - [c9]Sanjiv Kapoor, Tripurari Singh:
Dynamic Maintenance of Shortest Path Trees in Simple Polygons. FSTTCS 1996: 123-134 - [c8]Sanjiv Kapoor:
On Minimum 3-Cuts and Approximating k-Cuts Using Cut Trees. IPCO 1996: 132-146 - 1995
- [j5]Sanjiv Kapoor, H. Ramesh:
Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs. SIAM J. Comput. 24(2): 247-265 (1995) - [c7]Ramesh Hariharan, Sanjiv Kapoor, Vijay Kumar:
Faster Enumeration of All Spanning Trees of a Directed Graph. WADS 1995: 428-439 - 1994
- [c6]Sanjiv Kapoor:
Dynamic Maintenance of Maximas of 2-P Point Sets. SCG 1994: 140-149 - [c5]Sanjiv Kapoor, Michiel H. M. Smid:
New Techniques for Exact and Approximate Dynamic Closest-Point Problems. SCG 1994: 165-174 - 1991
- [j4]Sanjiv Kapoor, Edward M. Reingold:
Stochastic Rearrangement Rules for Self-Organizing Data Structures. Algorithmica 6(2): 278-291 (1991) - [c4]Sanjiv Kapoor, H. Ramesh:
Algorithms for Generating All Spanning Trees of Undirected, Directed and Weighted Graphs. WADS 1991: 461-472
1980 – 1989
- 1989
- [j3]Sanjiv Kapoor, Prakash V. Ramanan:
Lower Bounds for Maximal and Convex Layers Problems. Algorithmica 4(4): 447-459 (1989) - [j2]Sanjiv Kapoor, Edward M. Reingold:
Optimum lopsided binary trees. J. ACM 36(3): 573-590 (1989) - 1988
- [c3]Sanjiv Kapoor, S. N. Maheshwari:
Efficient Algorithms for Euclidean Shortest Path and Visibility Problems with Polygonal Obstacles. SCG 1988: 172-182 - 1987
- [j1]Jean R. S. Blair, Sanjiv Kapoor, Errol L. Lloyd, Kenneth J. Supowit:
Minimizing Channel Density in Standard Cell Layout. Algorithmica 2: 267-282 (1987) - [c2]Kenneth L. Clarkson, Sanjiv Kapoor, Pravin M. Vaidya:
Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n)2) Time. SCG 1987: 251-257 - 1986
- [b1]Sanjiv Kapoor:
Topics in the Design and Analysis of Combinatorial Algorithms. University of Illinois Urbana-Champaign, USA, 1986 - [c1]Sanjiv Kapoor, Pravin M. Vaidya:
Fast Algorithms for Convex Quadratic Programming and Multicommodity Flows. STOC 1986: 147-159
Coauthor Index
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-11-30 00:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: