Sanjiv Kapoor

Orcid: 0000-0001-5637-9919

According to our database1, Sanjiv Kapoor authored at least 74 papers between 1986 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Fairness of Equilibrium in Proportional Sharing Mechanisms with Bid Costs.
Proceedings of the 60th Annual Allerton Conference on Communication, 2024

2022
Impact of Vaccination and Testing in an Urban Campus Model for the SARS-CoV-2 Pandemic.
Proceedings of the GoodIT 2022: ACM International Conference on Information Technology for Social Good, Limassol, Cyprus, September 7, 2022

Budgeted Adversarial Network Resource Utilization Games.
Proceedings of the Game Theory for Networks, 2022

Game Theoretic Analysis of Resource Allocation in Multi-tiered Networks.
Proceedings of the Game Theory for Networks, 2022

2020
Price of Anarchy in Networks with Heterogeneous Latency Functions.
Math. Oper. Res., 2020

2019
Approximate Euclidean Shortest Paths in Polygonal Domains.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018
Equilibrium and Inefficiency in Multi-product Cournot Games.
Proceedings of the Web and Internet Economics - 14th International Conference, 2018

Priority Based Wireless Multi-Network Selection Games.
Proceedings of the Nineteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2018

2017
Nash Equilibrium and Stability in Network Selection Games.
Proceedings of the Game Theory for Networks - 7th International EAI Conference, 2017

Economic inefficiency in resource allocation games.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016
A Simple and Efficient Algorithm for Computing Market Equilibria.
ACM Trans. Algorithms, 2016

Nash equilibrium and the price of anarchy in priority based network routing.
Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016

2015
Coresets of obstacles in approximating Euclidean shortest path amid convex obstacles.
CoRR, 2015

A polynomial time algorithm for finding an approximate shortest path amid weighted regions.
CoRR, 2015

2014
Price of Anarchy with Heterogeneous Latency Functions.
CoRR, 2014

Price of Anarchy in network routing with class based capacity guarantees.
Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

2013
Auction Algorithm for Production Models
CoRR, 2013

Efficient Construction of Spanners in $d$-Dimensions
CoRR, 2013

The Budgeted Transportation Problem
CoRR, 2013

Approximating Quadratic 0-1 Programming via SOCP.
CoRR, 2013

Server allocation in a CDN.
Proceedings of IEEE International Conference on Communications, 2013

Concurrent multipath routing over bounded paths: Minimizing delay variance.
Proceedings of the 2013 IEEE Global Communications Conference, 2013

2012
Cluster-K<sup>+</sup>: Network topology for searching replicated data in p2p systems.
Inf. Process. Manag., 2012

2011
Buy-Sell Auction Mechanisms in Market Equilibrium.
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Minimizing Path Delay in Multipath Networks.
Proceedings of IEEE International Conference on Communications, 2011

Market Equilibria in Spectrum Trading with Multi-Regions and Multi-Channels.
Proceedings of the Global Communications Conference, 2011

Stochastic Strategic Routing Reduces Attack Effects.
Proceedings of the Global Communications Conference, 2011

Adversary Games in Secure/Reliable Network Routing.
Proceedings of the Game Theory for Networks - 2nd International ICST Conference, 2011

2010
Proximity Structures for Geometric Graphs.
Int. J. Comput. Geom. Appl., 2010

Approximate Shortest Path through a Weighted Planar Subdivision
CoRR, 2010

A near optimal algorithm for finding Euclidean shortest path in polygonal domain
CoRR, 2010

Multipath Network Flows: Bounded Buffers and Jitter.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Multi-Commodity Network Flows over Multipaths with Bounded Buffers.
Proceedings of IEEE International Conference on Communications, 2010

2009
Planar rectilinear shortest path computation using corridors.
Comput. Geom., 2009

Visibility queries in a polygonal region.
Comput. Geom., 2009

Geodesic Spanners on Polyhedral Surfaces.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
A Fast and Simple Algorithm for Computing Market Equilibria.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

2007
An auction-based market equilibrium algorithm for a production model.
Theor. Comput. Sci., 2007

Bounded-Diameter Minimum-Cost Graph Problems.
Theory Comput. Syst., 2007

Market Equilibrium Using Auctions for a Class of Gross-Substitute Utilities.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Approximation Algorithms For Multipath Setup.
Proceedings of the Global Communications Conference, 2007

Finding a Rectilinear Shortest Path in R<sup>2</sup> Using Corridor Based Staircase Structures.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

2006
Auction Algorithms for Market Equilibrium.
Math. Oper. Res., 2006

Bounded-hops power assignment in ad hoc wireless networks.
Discret. Appl. Math., 2006

Price Roll-Backs and Path Auctions: An Approximation Scheme for Computing the Market Equilibrium.
Proceedings of the Internet and Network Economics, Second International Workshop, 2006

2004
An Auction-Based Market Equilibrium Algorithm for the Separable Gross Substitutability Case.
Proceedings of the Approximation, 2004

2003
Network Lifetime and Power Assignment in ad hoc Wireless Networks.
Proceedings of the Algorithms, 2003

2002
Geometry Based Connectivity Compression of Triangular Meshes.
Proceedings of the ICVGIP 2002, 2002

2001
Stream-Packing: Resource Allocation in Web Server Farms with a QoS Guarantee.
Proceedings of the High Performance Computing - HiPC 2001, 8th International Conference, 2001

2000
Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles.
SIAM J. Comput., 2000

Dynamic Maintenance of Maxima of 2-d Point Sets.
SIAM J. Comput., 2000

An Algorithm for Enumerating All Spanning Trees of a Directed Graph.
Algorithmica, 2000

Optimal Hardware/Software Partitioning for Concurrent Specification Using Dynamic Programming.
Proceedings of the 13th International Conference on VLSI Design (VLSI Design 2000), 2000

Improved multicast routing with delay and delay variation constraints.
Proceedings of the Global Telecommunications Conference, 2000. GLOBECOM 2000, San Francisco, CA, USA, 27 November, 2000

1999
Efficient Computation of Geodesic Shortest Paths.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Hardware/Software Partitioning Between Microprocessor and Reconfigurable Hardware.
Proceedings of the 1999 ACM/SIGDA Seventh International Symposium on Field Programmable Gate Arrays, 1999

1997
An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane.
Discret. Comput. Geom., 1997

On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees.
Algorithmica, 1997

1996
New Techniques for Exact and Approximate Dynamic Closest-Point Problems.
SIAM J. Comput., 1996

Speeding up Karmarkar's algorithm for multicommodity flows.
Math. Program., 1996

On Minimum 3-Cuts and Approximating <i>k</i>-Cuts Using Cut Trees.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996

Dynamic Maintenance of Shortest Path Trees in Simple Polygons.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1996

1995
Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs.
SIAM J. Comput., 1995

Faster Enumeration of All Spanning Trees of a Directed Graph.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

1994
Dynamic Maintenance of Maximas of 2-P Point Sets.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1991
Stochastic Rearrangement Rules for Self-Organizing Data Structures.
Algorithmica, 1991

Algorithms for Generating All Spanning Trees of Undirected, Directed and Weighted Graphs.
Proceedings of the Algorithms and Data Structures, 1991

1989
Optimum lopsided binary trees.
J. ACM, 1989

Lower Bounds for Maximal and Convex Layers Problems.
Algorithmica, 1989

1988
Efficient Algorithms for Euclidean Shortest Path and Visibility Problems with Polygonal Obstacles.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987
Minimizing Channel Density in Standard Cell Layout.
Algorithmica, 1987

Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n)<sup>2</sup>) Time.
Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1986
Topics in the Design and Analysis of Combinatorial Algorithms
PhD thesis, 1986

Fast Algorithms for Convex Quadratic Programming and Multicommodity Flows
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986


  Loading...