Fast Algorithms for Convex Quadratic Programming and Multicommodity Flows - Sanjiv Kapoor; Pravin M. Vaidya (STOC, 1986)

Topics in the Design and Analysis of Combinatorial Algorithms - Sanjiv Kapoor (1986)

Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n)2) Time. - Kenneth L. Clarkson; Sanjiv Kapoor; Pravin M. Vaidya (SCG, 1987)

Minimizing Channel Density in Standard Cell Layout. - Jean R. S. Blair; Sanjiv Kapoor; Errol L. Lloyd; Kenneth J. Supowit (Algorithmica, 1987)

Efficient Algorithms for Euclidean Shortest Path and Visibility Problems with Polygonal Obstacles. - Sanjiv Kapoor; S. N. Maheshwari (SCG, 1988)

Lower Bounds for Maximal and Convex Layers Problems. - Sanjiv Kapoor; Prakash V. Ramanan (Algorithmica, 1989)

Optimum lopsided binary trees. - Sanjiv Kapoor; Edward M. Reingold (J. ACM, 1989)

Algorithms for Generating All Spanning Trees of Undirected, Directed and Weighted Graphs. - Sanjiv Kapoor; H. Ramesh (WADS, 1991)

Stochastic Rearrangement Rules for Self-Organizing Data Structures. - Sanjiv Kapoor; Edward M. Reingold (Algorithmica, 1991)

Dynamic Maintenance of Maximas of 2-P Point Sets. - Sanjiv Kapoor (SCG, 1994)

Faster Enumeration of All Spanning Trees of a Directed Graph. - Ramesh Hariharan; Sanjiv Kapoor; Vijay Kumar (WADS, 1995)

Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs. - Sanjiv Kapoor; H. Ramesh (SIAM J. Comput., 1995)

Dynamic Maintenance of Shortest Path Trees in Simple Polygons. - Sanjiv Kapoor; Tripurari Singh (FSTTCS, 1996)

On Minimum 3-Cuts and Approximating k-Cuts Using Cut Trees. - Sanjiv Kapoor (IPCO, 1996)

Speeding up Karmarkar's algorithm for multicommodity flows. - Sanjiv Kapoor; Pravin M. Vaidya (Math. Program., 1996)

New Techniques for Exact and Approximate Dynamic Closest-Point Problems. - Sanjiv Kapoor; Michiel H. M. Smid (SIAM J. Comput., 1996)

On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. - Gautam Das 001; Sanjiv Kapoor; Michiel H. M. Smid (Algorithmica, 1997)

An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane. - Sanjiv Kapoor; S. N. Maheshwari; Joseph S. B. Mitchell (Discret. Comput. Geom., 1997)

Hardware/Software Partitioning Between Microprocessor and Reconfigurable Hardware. - M. Anand; Sanjiv Kapoor; M. Balakrishnan (FPGA, 1999)

Efficient Computation of Geodesic Shortest Paths. - Sanjiv Kapoor (STOC, 1999)

Improved multicast routing with delay and delay variation constraints. - Sanjiv Kapoor; Srivatsan Raghavan (GLOBECOM, 2000)

Optimal Hardware/Software Partitioning for Concurrent Specification Using Dynamic Programming. - Aviral Shrivastava; Mohit Kumar; Sanjiv Kapoor; Shashi Kumar; M. Balakrishnan (VLSI Design, 2000)

An Algorithm for Enumerating All Spanning Trees of a Directed Graph. - Sanjiv Kapoor; H. Ramesh (Algorithmica, 2000)

Dynamic Maintenance of Maxima of 2-d Point Sets. - Sanjiv Kapoor (SIAM J. Comput., 2000)

Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles. - Sanjiv Kapoor; S. N. Maheshwari (SIAM J. Comput., 2000)

Stream-Packing: Resource Allocation in Web Server Farms with a QoS Guarantee. - Johara Shahabuddin; Abhay Chrungoo; Vishu Gupta; Sandeep Juneja; Sanjiv Kapoor; Arun Kumar (HiPC, 2001)

Geometry Based Connectivity Compression of Triangular Meshes. - S. Nachiappan; Sanjiv Kapoor; Prem Kalra (ICVGIP, 2002)

Network Lifetime and Power Assignment in ad hoc Wireless Networks. - Gruia Calinescu; Sanjiv Kapoor; Alexander Olshevsky; Alexander Zelikovsky (ESA, 2003)

An Auction-Based Market Equilibrium Algorithm for the Separable Gross Substitutability Case. - Rahul Garg 001; Sanjiv Kapoor; Vijay V. Vazirani (APPROX-RANDOM, 2004)

Price Roll-Backs and Path Auctions: An Approximation Scheme for Computing the Market Equilibrium. - Rahul Garg 001; Sanjiv Kapoor (WINE, 2006)

Bounded-hops power assignment in ad hoc wireless networks. - Gruia Calinescu; Sanjiv Kapoor; Mohammad Sarwat (Discret. Appl. Math., 2006)

Auction Algorithms for Market Equilibrium. - Rahul Garg 001; Sanjiv Kapoor (Math. Oper. Res., 2006)

Finding a Rectilinear Shortest Path in R2 Using Corridor Based Staircase Structures. - Rajasekhar Inkulu; Sanjiv Kapoor (FSTTCS, 2007)

Approximation Algorithms For Multipath Setup. - Tricha Anjali; Gruia Calinescu; Sanjiv Kapoor (GLOBECOM, 2007)

Market Equilibrium Using Auctions for a Class of Gross-Substitute Utilities. - Rahul Garg 001; Sanjiv Kapoor (WINE, 2007)

Bounded-Diameter Minimum-Cost Graph Problems. - Sanjiv Kapoor; Mohammad Sarwat (Theory Comput. Syst., 2007)

An auction-based market equilibrium algorithm for a production model. - Sanjiv Kapoor; Aranyak Mehta; Vijay V. Vazirani (Theor. Comput. Sci., 2007)

A Fast and Simple Algorithm for Computing Market Equilibria. - Lisa Fleischer; Rahul Garg 001; Sanjiv Kapoor; Rohit Khandekar; Amin Saberi (WINE, 2008)

Geodesic Spanners on Polyhedral Surfaces. - Sanjiv Kapoor; Xiang-Yang Li 001 (ISAAC, 2009)

Visibility queries in a polygonal region. - Rajasekhar Inkulu; Sanjiv Kapoor (Comput. Geom., 2009)

Planar rectilinear shortest path computation using corridors. - Rajasekhar Inkulu; Sanjiv Kapoor (Comput. Geom., 2009)

Multi-Commodity Network Flows over Multipaths with Bounded Buffers. - Tricha Anjali; Alexander Fortin; Sanjiv Kapoor (ICC, 2010)

Multipath Network Flows: Bounded Buffers and Jitter. - Tricha Anjali; Gruia Calinescu; Alexander Fortin; Sanjiv Kapoor; Nandakiran Kirubanandan; Sutep Tongngam (INFOCOM, 2010)

A near optimal algorithm for finding Euclidean shortest path in polygonal domain - Rajasekhar Inkulu; Sanjiv Kapoor; S. N. Maheshwari (CoRR, 2010)

Approximate Shortest Path through a Weighted Planar Subdivision - Rajasekhar Inkulu; Sanjiv Kapoor (CoRR, 2010)

Proximity Structures for Geometric Graphs. - Sanjiv Kapoor; Xiang-Yang Li 001 (Int. J. Comput. Geom. Appl., 2010)

Adversary Games in Secure/Reliable Network Routing. - Gruia Calinescu; Sanjiv Kapoor; Michael Quinn; Junghwan Shin (GAMENETS, 2011)

Stochastic Strategic Routing Reduces Attack Effects. - Gruia Calinescu; Sanjiv Kapoor; Kan Qiao; Junghwan Shin (GLOBECOM, 2011)

Market Equilibria in Spectrum Trading with Multi-Regions and Multi-Channels. - Ping Xu; Sanjiv Kapoor; Xiang-Yang Li 001 (GLOBECOM, 2011)

Minimizing Path Delay in Multipath Networks. - Fabrizio Devetak; Junghwan Shin; Tricha Anjali; Sanjiv Kapoor (ICC, 2011)

Buy-Sell Auction Mechanisms in Market Equilibrium. - Sanjiv Kapoor (WINE, 2011)

Cluster-K+: Network topology for searching replicated data in p2p systems. - Tayo Obafemi-Ajayi; Sanjiv Kapoor; Ophir Frieder (Inf. Process. Manag., 2012)

Concurrent multipath routing over bounded paths: Minimizing delay variance. - Junghwan Shin; Fabrizio Devetak; Tricha Anjali; Sanjiv Kapoor (GLOBECOM, 2013)

Server allocation in a CDN. - Mohammad Sarwat; Junghwan Shin; Sanjiv Kapoor (ICC, 2013)

Approximating Quadratic 0-1 Programming via SOCP. - Sanjiv Kapoor; Hemanshu Kaul (CoRR, 2013)

The Budgeted Transportation Problem - Sanjiv Kapoor; Mohammad Sarwat (CoRR, 2013)

Efficient Construction of Spanners in $d$-Dimensions - Sanjiv Kapoor; Xiang-Yang Li 001 (CoRR, 2013)

Auction Algorithm for Production Models - Junghwan Shin; Sanjiv Kapoor (CoRR, 2013)

Price of Anarchy in network routing with class based capacity guarantees. - Ehsan Monsef; Tricha Anjali; Sanjiv Kapoor (INFOCOM, 2014)

Price of Anarchy with Heterogeneous Latency Functions. - Sanjiv Kapoor; Junghwan Shin (CoRR, 2014)

A polynomial time algorithm for finding an approximate shortest path amid weighted regions. - Rajasekhar Inkulu; Sanjiv Kapoor (CoRR, 2015)

Coresets of obstacles in approximating Euclidean shortest path amid convex obstacles. - Rajasekhar Inkulu; Sanjiv Kapoor (CoRR, 2015)

Nash equilibrium and the price of anarchy in priority based network routing. - Benjamin Grimmer; Sanjiv Kapoor (INFOCOM, 2016)

A Simple and Efficient Algorithm for Computing Market Equilibria. - Lisa Fleischer; Rahul Garg 001; Sanjiv Kapoor; Rohit Khandekar; Amin Saberi (ACM Trans. Algorithms, 2016)

Economic inefficiency in resource allocation games. - Praneeth Tota; Sanjiv Kapoor; Benjamin Grimmer (Allerton, 2017)

Nash Equilibrium and Stability in Network Selection Games. - Mohit Hota; Sanjiv Kapoor (GAMENETS, 2017)

Priority Based Wireless Multi-Network Selection Games. - Mohit Hota; Sanjiv Kapoor (MobiHoc, 2018)

Equilibrium and Inefficiency in Multi-product Cournot Games. - Mohit Hota; Sanjiv Kapoor (WINE, 2018)

Approximate Euclidean Shortest Paths in Polygonal Domains. - R. Inkulu; Sanjiv Kapoor (ISAAC, 2019)

Price of Anarchy in Networks with Heterogeneous Latency Functions. - Sanjiv Kapoor; Junghwan Shin (Math. Oper. Res., 2020)

Game Theoretic Analysis of Resource Allocation in Multi-tiered Networks. - Li Zhang; Mohit Hota; Sanjiv Kapoor (GAMENETS, 2022)

Budgeted Adversarial Network Resource Utilization Games. - Yi Zhang; Sanjiv Kapoor (GAMENETS, 2022)

Impact of Vaccination and Testing in an Urban Campus Model for the SARS-CoV-2 Pandemic. - Yi Zhang; Sanjiv Kapoor (GoodIT, 2022)

Fairness of Equilibrium in Proportional Sharing Mechanisms with Bid Costs. - Li Zhang; Sanjiv Kapoor (Allerton, 2024)

Equilibrium and Selfish Behavior in Network Contagion. - Yi Zhang; Sanjiv Kapoor (CoRR, 2025)