Sanjiv Kapoor

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.

[BibT_eX]

[DOI]

Yi Zhang

Proceedings of the Game Theory for Networks, 2022

Game Theoretic Analysis of Resource Allocation in Multi-tiered Networks.

[BibT_eX]

[DOI]

Li Zhang

Proceedings of the Game Theory for Networks, 2022

2020

Price of Anarchy in Networks with Heterogeneous Latency Functions.

[BibT_eX]

[DOI]

Math. Oper. Res., 2020

2019

Approximate Euclidean Shortest Paths in Polygonal Domains.

[BibT_eX]

[DOI]

R. Inkulu

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018

Equilibrium and Inefficiency in Multi-product Cournot Games.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 14th International Conference, 2018

Priority Based Wireless Multi-Network Selection Games.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2018

2017

Nash Equilibrium and Stability in Network Selection Games.

[BibT_eX]

[DOI]

Proceedings of the Game Theory for Networks - 7th International EAI Conference, 2017

Economic inefficiency in resource allocation games.

[BibT_eX]

[DOI]

Praneeth Tota

Benjamin Grimmer

Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016

A Simple and Efficient Algorithm for Computing Market Equilibria.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Nash equilibrium and the price of anarchy in priority based network routing.

[BibT_eX]

[DOI]

Benjamin Grimmer

Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016

2015

Coresets of obstacles in approximating Euclidean shortest path amid convex obstacles.

[BibT_eX]

[DOI]

CoRR, 2015

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

[BibT_eX]

[DOI]

CoRR, 2015

2014

Price of Anarchy with Heterogeneous Latency Functions.

[BibT_eX]

[DOI]

CoRR, 2014

Price of Anarchy in network routing with class based capacity guarantees.

[BibT_eX]

[DOI]

Ehsan Monsef

Tricha Anjali

Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

2013

Auction Algorithm for Production Models

[BibT_eX]

[DOI]

CoRR, 2013

Efficient Construction of Spanners in $d$-Dimensions

[BibT_eX]

[DOI]

CoRR, 2013

The Budgeted Transportation Problem

[BibT_eX]

[DOI]

CoRR, 2013

Approximating Quadratic 0-1 Programming via SOCP.

[BibT_eX]

[DOI]

Hemanshu Kaul

CoRR, 2013

Server allocation in a CDN.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2013

Concurrent multipath routing over bounded paths: Minimizing delay variance.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE Global Communications Conference, 2013

2012

Cluster-K+: Network topology for searching replicated data in p2p systems.

[BibT_eX]

[DOI]

Tayo Obafemi-Ajayi

Ophir Frieder

Inf. Process. Manag., 2012

2011

Buy-Sell Auction Mechanisms in Market Equilibrium.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Minimizing Path Delay in Multipath Networks.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2011

Market Equilibria in Spectrum Trading with Multi-Regions and Multi-Channels.

[BibT_eX]

[DOI]

Ping Xu

Proceedings of the Global Communications Conference, 2011

Stochastic Strategic Routing Reduces Attack Effects.

[BibT_eX]

[DOI]

Proceedings of the Global Communications Conference, 2011

Adversary Games in Secure/Reliable Network Routing.

[BibT_eX]

[DOI]

Proceedings of the Game Theory for Networks - 2nd International ICST Conference, 2011

2010

Proximity Structures for Geometric Graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2010

Approximate Shortest Path through a Weighted Planar Subdivision

[BibT_eX]

[DOI]

CoRR, 2010

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

[BibT_eX]

[DOI]

CoRR, 2010

Multipath Network Flows: Bounded Buffers and Jitter.

[BibT_eX]

[DOI]

Nandakiran Kirubanandan

Sutep Tongngam

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Multi-Commodity Network Flows over Multipaths with Bounded Buffers.

[BibT_eX]

[DOI]

Tricha Anjali

Alexander Fortin

Proceedings of IEEE International Conference on Communications, 2010

2009

Planar rectilinear shortest path computation using corridors.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Visibility queries in a polygonal region.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Geodesic Spanners on Polyhedral Surfaces.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

A Fast and Simple Algorithm for Computing Market Equilibria.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

2007

An auction-based market equilibrium algorithm for a production model.

[BibT_eX]

[DOI]

Aranyak Mehta

Vijay V. Vazirani

Theor. Comput. Sci., 2007

Bounded-Diameter Minimum-Cost Graph Problems.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2007

Market Equilibrium Using Auctions for a Class of Gross-Substitute Utilities.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Approximation Algorithms For Multipath Setup.

[BibT_eX]

[DOI]

Tricha Anjali

Gruia Calinescu

Proceedings of the Global Communications Conference, 2007

Finding a Rectilinear Shortest Path in R2 Using Corridor Based Staircase Structures.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

2006

Auction Algorithms for Market Equilibrium.

[BibT_eX]

[DOI]

Math. Oper. Res., 2006

Bounded-hops power assignment in ad hoc wireless networks.

[BibT_eX]

[DOI]

Gruia Calinescu

Discret. Appl. Math., 2006

Price Roll-Backs and Path Auctions: An Approximation Scheme for Computing the Market Equilibrium.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, Second International Workshop, 2006

2004

An Auction-Based Market Equilibrium Algorithm for the Separable Gross Substitutability Case.

[BibT_eX]

[DOI]

Vijay V. Vazirani

Proceedings of the Approximation, 2004

2003

Network Lifetime and Power Assignment in ad hoc Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2003

2002

Geometry Based Connectivity Compression of Triangular Meshes.

[BibT_eX]

S. Nachiappan

Prem Kalra

Proceedings of the ICVGIP 2002, 2002

2001

Stream-Packing: Resource Allocation in Web Server Farms with a QoS Guarantee.

[BibT_eX]

[DOI]

Proceedings of the High Performance Computing - HiPC 2001, 8th International Conference, 2001

2000

Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

Dynamic Maintenance of Maxima of 2-d Point Sets.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

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

[BibT_eX]

[DOI]

H. Ramesh

Algorithmica, 2000

Optimal Hardware/Software Partitioning for Concurrent Specification Using Dynamic Programming.

[BibT_eX]

[DOI]

Proceedings of the 13th International Conference on VLSI Design (VLSI Design 2000), 2000

Improved multicast routing with delay and delay variation constraints.

[BibT_eX]

[DOI]

Srivatsan Raghavan

Proceedings of the Global Telecommunications Conference, 2000. GLOBECOM 2000, San Francisco, CA, USA, 27 November, 2000

1999

Efficient Computation of Geodesic Shortest Paths.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Hardware/Software Partitioning Between Microprocessor and Reconfigurable Hardware.

[BibT_eX]

[DOI]

M. Anand

M. Balakrishnan

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.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Discret. Comput. Geom., 1997

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

[BibT_eX]

[DOI]

Gautam Das

Michiel H. M. Smid

Algorithmica, 1997

1996

New Techniques for Exact and Approximate Dynamic Closest-Point Problems.

[BibT_eX]

[DOI]

Michiel H. M. Smid

SIAM J. Comput., 1996

Speeding up Karmarkar's algorithm for multicommodity flows.

[BibT_eX]

[DOI]

Pravin M. Vaidya

Math. Program., 1996

On Minimum 3-Cuts and Approximating k-Cuts Using Cut Trees.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 1996

Dynamic Maintenance of Shortest Path Trees in Simple Polygons.

[BibT_eX]

[DOI]

Tripurari Singh

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1996

1995

Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs.

[BibT_eX]

[DOI]

H. Ramesh

SIAM J. Comput., 1995

Faster Enumeration of All Spanning Trees of a Directed Graph.

[BibT_eX]

[DOI]

Ramesh Hariharan

Vijay Kumar

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

1994

Dynamic Maintenance of Maximas of 2-P Point Sets.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1991

Stochastic Rearrangement Rules for Self-Organizing Data Structures.

[BibT_eX]

[DOI]

Edward M. Reingold

Algorithmica, 1991

Algorithms for Generating All Spanning Trees of Undirected, Directed and Weighted Graphs.

[BibT_eX]

[DOI]

H. Ramesh

Proceedings of the Algorithms and Data Structures, 1991

1989

Optimum lopsided binary trees.

[BibT_eX]

[DOI]

Edward M. Reingold

J. ACM, 1989

Lower Bounds for Maximal and Convex Layers Problems.

[BibT_eX]

[DOI]

Prakash V. Ramanan

Algorithmica, 1989

1988

Efficient Algorithms for Euclidean Shortest Path and Visibility Problems with Polygonal Obstacles.

[BibT_eX]

[DOI]

Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987

Minimizing Channel Density in Standard Cell Layout.

[BibT_eX]

[DOI]

Algorithmica, 1987

Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n)2) Time.

[BibT_eX]

[DOI]

Kenneth L. Clarkson

Pravin M. Vaidya

Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1986

Topics in the Design and Analysis of Combinatorial Algorithms

[BibT_eX]

[DOI]

PhD thesis, 1986

Fast Algorithms for Convex Quadratic Programming and Multicommodity Flows

[BibT_eX]

[DOI]