Sanjiv Kapoor

Publication Activity (10 Years)

Years Active: 1986-2022
Publications (10 Years): 11

Top Topics

Resource Allocation

Network Routing

Top Venues

Publications

Yi Zhang, Sanjiv Kapoor
Impact of Vaccination and Testing in an Urban Campus Model for the SARS-CoV-2 Pandemic. GoodIT (2022)
Li Zhang, Mohit Hota, Sanjiv Kapoor
Game Theoretic Analysis of Resource Allocation in Multi-tiered Networks. GAMENETS (2022)
Yi Zhang, Sanjiv Kapoor
Budgeted Adversarial Network Resource Utilization Games. GAMENETS (2022)
Sanjiv Kapoor, Junghwan Shin
Price of Anarchy in Networks with Heterogeneous Latency Functions. Math. Oper. Res. 45 (2) (2020)
R. Inkulu, Sanjiv Kapoor
Approximate Euclidean Shortest Paths in Polygonal Domains. ISAAC (2019)
Mohit Hota, Sanjiv Kapoor
Priority Based Wireless Multi-Network Selection Games. MobiHoc (2018)
Mohit Hota, Sanjiv Kapoor
Equilibrium and Inefficiency in Multi-product Cournot Games. WINE (2018)
Mohit Hota, Sanjiv Kapoor
Nash Equilibrium and Stability in Network Selection Games. GAMENETS (2017)
Praneeth Tota, Sanjiv Kapoor, Benjamin Grimmer
Economic inefficiency in resource allocation games. Allerton (2017)
Benjamin Grimmer, Sanjiv Kapoor
Nash equilibrium and the price of anarchy in priority based network routing. INFOCOM (2016)
Lisa Fleischer, Rahul Garg, Sanjiv Kapoor, Rohit Khandekar, Amin Saberi
A Simple and Efficient Algorithm for Computing Market Equilibria. ACM Trans. Algorithms 12 (3) (2016)
Rajasekhar Inkulu, Sanjiv Kapoor
Coresets of obstacles in approximating Euclidean shortest path amid convex obstacles. CoRR (2015)
Rajasekhar Inkulu, Sanjiv Kapoor
A polynomial time algorithm for finding an approximate shortest path amid weighted regions. CoRR (2015)
Sanjiv Kapoor, Junghwan Shin
Price of Anarchy with Heterogeneous Latency Functions. CoRR (2014)
Ehsan Monsef, Tricha Anjali, Sanjiv Kapoor
Price of Anarchy in network routing with class based capacity guarantees. INFOCOM (2014)
Sanjiv Kapoor, Hemanshu Kaul
Approximating Quadratic 0-1 Programming via SOCP. CoRR (2013)
Mohammad Sarwat, Junghwan Shin, Sanjiv Kapoor
Server allocation in a CDN. ICC (2013)
Sanjiv Kapoor, Mohammad Sarwat
The Budgeted Transportation Problem CoRR (2013)
Junghwan Shin, Sanjiv Kapoor
Auction Algorithm for Production Models CoRR (2013)
Junghwan Shin, Fabrizio Devetak, Tricha Anjali, Sanjiv Kapoor
Concurrent multipath routing over bounded paths: Minimizing delay variance. GLOBECOM (2013)
Sanjiv Kapoor, Xiang-Yang Li
Efficient Construction of Spanners in $d$-Dimensions CoRR (2013)
Tayo Obafemi-Ajayi, Sanjiv Kapoor, Ophir Frieder
: Network topology for searching replicated data in p2p systems. Inf. Process. Manag. 48 (5) (2012)
Gruia Calinescu, Sanjiv Kapoor, Michael Quinn, Junghwan Shin
Adversary Games in Secure/Reliable Network Routing. GAMENETS (2011)
Gruia Calinescu, Sanjiv Kapoor, Kan Qiao, Junghwan Shin
Stochastic Strategic Routing Reduces Attack Effects. GLOBECOM (2011)
Fabrizio Devetak, Junghwan Shin, Tricha Anjali, Sanjiv Kapoor
Minimizing Path Delay in Multipath Networks. ICC (2011)
Sanjiv Kapoor
Buy-Sell Auction Mechanisms in Market Equilibrium. WINE (2011)
Ping Xu, Sanjiv Kapoor, Xiang-Yang Li
Market Equilibria in Spectrum Trading with Multi-Regions and Multi-Channels. GLOBECOM (2011)
Rajasekhar Inkulu, Sanjiv Kapoor
Approximate Shortest Path through a Weighted Planar Subdivision CoRR (2010)
Tricha Anjali, Alexander Fortin, Sanjiv Kapoor
Multi-Commodity Network Flows over Multipaths with Bounded Buffers. ICC (2010)
Rajasekhar Inkulu, Sanjiv Kapoor, S. N. Maheshwari
A near optimal algorithm for finding Euclidean shortest path in polygonal domain CoRR (2010)
Tricha Anjali, Gruia Calinescu, Alexander Fortin, Sanjiv Kapoor, Nandakiran Kirubanandan, Sutep Tongngam
Multipath Network Flows: Bounded Buffers and Jitter. INFOCOM (2010)
Sanjiv Kapoor, Xiang-Yang Li
Proximity Structures for Geometric Graphs. Int. J. Comput. Geom. Appl. 20 (4) (2010)
Rajasekhar Inkulu, Sanjiv Kapoor
Visibility queries in a polygonal region. Comput. Geom. 42 (9) (2009)
Sanjiv Kapoor, Xiang-Yang Li
Geodesic Spanners on Polyhedral Surfaces. ISAAC (2009)
Rajasekhar Inkulu, Sanjiv Kapoor
Planar rectilinear shortest path computation using corridors. Comput. Geom. 42 (9) (2009)
Lisa Fleischer, Rahul Garg, Sanjiv Kapoor, Rohit Khandekar, Amin Saberi
A Fast and Simple Algorithm for Computing Market Equilibria. WINE (2008)
Sanjiv Kapoor, Aranyak Mehta, Vijay V. Vazirani
An auction-based market equilibrium algorithm for a production model. Theor. Comput. Sci. 378 (2) (2007)
Sanjiv Kapoor, Mohammad Sarwat
Bounded-Diameter Minimum-Cost Graph Problems. Theory Comput. Syst. 41 (4) (2007)
Tricha Anjali, Gruia Calinescu, Sanjiv Kapoor
Approximation Algorithms For Multipath Setup. GLOBECOM (2007)
Rahul Garg, Sanjiv Kapoor
Market Equilibrium Using Auctions for a Class of Gross-Substitute Utilities. WINE (2007)
Rajasekhar Inkulu, Sanjiv Kapoor
Using Corridor Based Staircase Structures. FSTTCS (2007)
Gruia Calinescu, Sanjiv Kapoor, Mohammad Sarwat
Bounded-hops power assignment in ad hoc wireless networks. Discret. Appl. Math. 154 (9) (2006)
Rahul Garg, Sanjiv Kapoor
Price Roll-Backs and Path Auctions: An Approximation Scheme for Computing the Market Equilibrium. WINE (2006)
Rahul Garg, Sanjiv Kapoor
Auction Algorithms for Market Equilibrium. Math. Oper. Res. 31 (4) (2006)
Sanjiv Kapoor, Aranyak Mehta, Vijay V. Vazirani
An Auction-Based Market Equilibrium Algorithm for a Production Model. WINE (2005)
Rahul Garg, Sanjiv Kapoor
Auction algorithms for market equilibrium. STOC (2004)
Gruia Calinescu, Sanjiv Kapoor, Mohammad Sarwat
Bounded-hops power assignment in ad-hoc wireless networks. WCNC (2004)
Rahul Garg, Sanjiv Kapoor, Vijay V. Vazirani
An Auction-Based Market Equilibrium Algorithm for the Separable Gross Substitutability Case. APPROX-RANDOM (2004)
Sanjiv Kapoor, Xiang-Yang Li
Proximity Structures for Geometric Graphs. WADS (2003)
Gruia Calinescu, Sanjiv Kapoor, Alexander Olshevsky, Alexander Zelikovsky
Network Lifetime and Power Assignment in ad hoc Wireless Networks. ESA (2003)
S. Nachiappan, Sanjiv Kapoor, Prem Kalra
Geometry Based Connectivity Compression of Triangular Meshes. ICVGIP (2002)
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)
Sanjiv Kapoor, H. Ramesh
An Algorithm for Enumerating All Spanning Trees of a Directed Graph. Algorithmica 27 (2) (2000)
Sanjiv Kapoor, S. N. Maheshwari
Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles. SIAM J. Comput. 30 (3) (2000)
Sanjiv Kapoor
Dynamic Maintenance of Maxima of 2-d Point Sets. SIAM J. Comput. 29 (6) (2000)
Aviral Shrivastava, Mohit Kumar, Sanjiv Kapoor, Shashi Kumar, M. Balakrishnan
Optimal Hardware/Software Partitioning for Concurrent Specification Using Dynamic Programming. VLSI Design (2000)
Sanjiv Kapoor, Srivatsan Raghavan
Improved multicast routing with delay and delay variation constraints. GLOBECOM (2000)
Sanjiv Kapoor
Efficient Computation of Geodesic Shortest Paths. STOC (1999)
M. Anand, Sanjiv Kapoor, M. Balakrishnan
Hardware/Software Partitioning Between Microprocessor and Reconfigurable Hardware. FPGA (1999)
Gautam Das, Sanjiv Kapoor, Michiel H. M. Smid
On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. Algorithmica 19 (4) (1997)
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) (1997)
Sanjiv Kapoor, Tripurari Singh
Dynamic Maintenance of Shortest Path Trees in Simple Polygons. FSTTCS (1996)
Sanjiv Kapoor, Pravin M. Vaidya
Speeding up Karmarkar's algorithm for multicommodity flows. Math. Program. 73 (1996)
Gautam Das, Sanjiv Kapoor, Michiel H. M. Smid
On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. FSTTCS (1996)
Sanjiv Kapoor
-Cuts Using Cut Trees. IPCO (1996)
Sanjiv Kapoor, Michiel H. M. Smid
New Techniques for Exact and Approximate Dynamic Closest-Point Problems. SIAM J. Comput. 25 (4) (1996)
Sanjiv Kapoor, H. Ramesh
Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs. SIAM J. Comput. 24 (2) (1995)
Ramesh Hariharan, Sanjiv Kapoor, Vijay Kumar
Faster Enumeration of All Spanning Trees of a Directed Graph. WADS (1995)
Sanjiv Kapoor, Michiel H. M. Smid
New Techniques for Exact and Approximate Dynamic Closest-Point Problems. SCG (1994)
Sanjiv Kapoor
Dynamic Maintenance of Maximas of 2-P Point Sets. SCG (1994)
Sanjiv Kapoor, Edward M. Reingold
Stochastic Rearrangement Rules for Self-Organizing Data Structures. Algorithmica 6 (2) (1991)
Sanjiv Kapoor, H. Ramesh
Algorithms for Generating All Spanning Trees of Undirected, Directed and Weighted Graphs. WADS (1991)
Sanjiv Kapoor, Prakash V. Ramanan
Lower Bounds for Maximal and Convex Layers Problems. Algorithmica 4 (4) (1989)
Sanjiv Kapoor, Edward M. Reingold
Optimum lopsided binary trees. J. ACM 36 (3) (1989)
Sanjiv Kapoor, S. N. Maheshwari
Efficient Algorithms for Euclidean Shortest Path and Visibility Problems with Polygonal Obstacles. SCG (1988)
Kenneth L. Clarkson, Sanjiv Kapoor, Pravin M. Vaidya
) Time. SCG (1987)
Jean R. S. Blair, Sanjiv Kapoor, Errol L. Lloyd, Kenneth J. Supowit
Minimizing Channel Density in Standard Cell Layout. Algorithmica 2 (1987)
Sanjiv Kapoor, Pravin M. Vaidya
Fast Algorithms for Convex Quadratic Programming and Multicommodity Flows STOC (1986)