Sanjiv Kapoor - RankMe

83 papers A* 6A 2B 13Misc 2Journal 32Unranked 25

Year	Rank	Type	Title / Venue / Authors
2026	—	`ed.`	Game Theory for Networks - 13th EAI International Conference, GameNets 2025, Cambridge, UK, March 17-18, 2025, Proceedings GAMENETS Vaneet Aggarwal, Tobias Harks, Sanjiv Kapoor
2025	J	`jnl`	Equilibrium and Selfish Behavior in Network Contagion. CoRR Yi Zhang, Sanjiv Kapoor
2024	—	`conf`	Fairness of Equilibrium in Proportional Sharing Mechanisms with Bid Costs. Allerton Li Zhang, Sanjiv Kapoor
2022	—	`conf`	Budgeted Adversarial Network Resource Utilization Games. GAMENETS Yi Zhang, Sanjiv Kapoor
2022	—	`conf`	Game Theoretic Analysis of Resource Allocation in Multi-tiered Networks. GAMENETS Li Zhang, Mohit Hota, Sanjiv Kapoor
2022	—	`conf`	Impact of Vaccination and Testing in an Urban Campus Model for the SARS-CoV-2 Pandemic. GoodIT Yi Zhang, Sanjiv Kapoor
2020	J	`jnl`	Price of Anarchy in Networks with Heterogeneous Latency Functions. Math. Oper. Res. Sanjiv Kapoor, Junghwan Shin
2019	B	`conf`	Approximate Euclidean Shortest Paths in Polygonal Domains. ISAAC R. Inkulu, Sanjiv Kapoor
2018	—	`conf`	Equilibrium and Inefficiency in Multi-product Cournot Games. WINE Mohit Hota, Sanjiv Kapoor
2018	B	`conf`	Priority Based Wireless Multi-Network Selection Games. MobiHoc Mohit Hota, Sanjiv Kapoor
2017	—	`conf`	Economic inefficiency in resource allocation games. Allerton Praneeth Tota, Sanjiv Kapoor, Benjamin Grimmer
2017	—	`conf`	Nash Equilibrium and Stability in Network Selection Games. GAMENETS Mohit Hota, Sanjiv Kapoor
2016	J	`jnl`	A Simple and Efficient Algorithm for Computing Market Equilibria. ACM Trans. Algorithms Lisa Fleischer, Rahul Garg, Sanjiv Kapoor, Rohit Khandekar, Amin Saberi
2016	A*	`conf`	Nash equilibrium and the price of anarchy in priority based network routing. INFOCOM Benjamin Grimmer, Sanjiv Kapoor
2015	J	`jnl`	A polynomial time algorithm for finding an approximate shortest path amid weighted regions. CoRR Rajasekhar Inkulu, Sanjiv Kapoor
2015	J	`jnl`	Coresets of obstacles in approximating Euclidean shortest path amid convex obstacles. CoRR Rajasekhar Inkulu, Sanjiv Kapoor
2014	A*	`conf`	Price of Anarchy in network routing with class based capacity guarantees. INFOCOM Ehsan Monsef, Tricha Anjali, Sanjiv Kapoor
2014	J	`jnl`	Price of Anarchy with Heterogeneous Latency Functions. CoRR Sanjiv Kapoor, Junghwan Shin
2013	J	`jnl`	Approximating Quadratic 0-1 Programming via SOCP. CoRR Sanjiv Kapoor, Hemanshu Kaul
2013	J	`jnl`	Auction Algorithm for Production Models CoRR Junghwan Shin, Sanjiv Kapoor
2013	B	`conf`	Concurrent multipath routing over bounded paths: Minimizing delay variance. GLOBECOM Junghwan Shin, Fabrizio Devetak, Tricha Anjali, Sanjiv Kapoor
2013	J	`jnl`	Efficient Construction of Spanners in $d$-Dimensions CoRR Sanjiv Kapoor, Xiang-Yang Li
2013	—	`conf`	Server allocation in a CDN. ICC Mohammad Sarwat, Junghwan Shin, Sanjiv Kapoor
2013	J	`jnl`	The Budgeted Transportation Problem CoRR Sanjiv Kapoor, Mohammad Sarwat
2012	J	`jnl`	Cluster-K Inf. Process. Manag. Tayo Obafemi-Ajayi, Sanjiv Kapoor, Ophir Frieder
2011	—	`conf`	Adversary Games in Secure/Reliable Network Routing. GAMENETS Gruia Calinescu, Sanjiv Kapoor, Michael Quinn, Junghwan Shin
2011	—	`conf`	Buy-Sell Auction Mechanisms in Market Equilibrium. WINE Sanjiv Kapoor
2011	B	`conf`	Market Equilibria in Spectrum Trading with Multi-Regions and Multi-Channels. GLOBECOM Ping Xu, Sanjiv Kapoor, Xiang-Yang Li
2011	—	`conf`	Minimizing Path Delay in Multipath Networks. ICC Fabrizio Devetak, Junghwan Shin, Tricha Anjali, Sanjiv Kapoor
2011	B	`conf`	Stochastic Strategic Routing Reduces Attack Effects. GLOBECOM Gruia Calinescu, Sanjiv Kapoor, Kan Qiao, Junghwan Shin
2010	J	`jnl`	A near optimal algorithm for finding Euclidean shortest path in polygonal domain CoRR Rajasekhar Inkulu, Sanjiv Kapoor, S. N. Maheshwari
2010	J	`jnl`	Approximate Shortest Path through a Weighted Planar Subdivision CoRR Rajasekhar Inkulu, Sanjiv Kapoor
2010	—	`conf`	Multi-Commodity Network Flows over Multipaths with Bounded Buffers. ICC Tricha Anjali, Alexander Fortin, Sanjiv Kapoor
2010	A*	`conf`	Multipath Network Flows: Bounded Buffers and Jitter. INFOCOM Tricha Anjali, Gruia Calinescu, Alexander Fortin, Sanjiv Kapoor, Nandakiran Kirubanandan, Sutep Tongngam
2010	J	`jnl`	Proximity Structures for Geometric Graphs. Int. J. Comput. Geom. Appl. Sanjiv Kapoor, Xiang-Yang Li
2009	B	`conf`	Geodesic Spanners on Polyhedral Surfaces. ISAAC Sanjiv Kapoor, Xiang-Yang Li
2009	J	`jnl`	Planar rectilinear shortest path computation using corridors. Comput. Geom. Rajasekhar Inkulu, Sanjiv Kapoor
2009	J	`jnl`	Visibility queries in a polygonal region. Comput. Geom. Rajasekhar Inkulu, Sanjiv Kapoor
2008	—	`conf`	A Fast and Simple Algorithm for Computing Market Equilibria. WINE Lisa Fleischer, Rahul Garg, Sanjiv Kapoor, Rohit Khandekar, Amin Saberi
2007	J	`jnl`	An auction-based market equilibrium algorithm for a production model. Theor. Comput. Sci. Sanjiv Kapoor, Aranyak Mehta, Vijay V. Vazirani
2007	B	`conf`	Approximation Algorithms For Multipath Setup. GLOBECOM Tricha Anjali, Gruia Calinescu, Sanjiv Kapoor
2007	J	`jnl`	Bounded-Diameter Minimum-Cost Graph Problems. Theory Comput. Syst. Sanjiv Kapoor, Mohammad Sarwat
2007	—	`conf`	Finding a Rectilinear Shortest Path in R FSTTCS Rajasekhar Inkulu, Sanjiv Kapoor
2007	—	`conf`	Market Equilibrium Using Auctions for a Class of Gross-Substitute Utilities. WINE Rahul Garg, Sanjiv Kapoor
2006	J	`jnl`	Auction Algorithms for Market Equilibrium. Math. Oper. Res. Rahul Garg, Sanjiv Kapoor
2006	J	`jnl`	Bounded-hops power assignment in ad hoc wireless networks. Discret. Appl. Math. Gruia Calinescu, Sanjiv Kapoor, Mohammad Sarwat
2006	—	`conf`	Price Roll-Backs and Path Auctions: An Approximation Scheme for Computing the Market Equilibrium. WINE Rahul Garg, Sanjiv Kapoor
2005	—	`conf`	An Auction-Based Market Equilibrium Algorithm for a Production Model. WINE Sanjiv Kapoor, Aranyak Mehta, Vijay V. Vazirani
2004	—	`conf`	An Auction-Based Market Equilibrium Algorithm for the Separable Gross Substitutability Case. APPROX-RANDOM Rahul Garg, Sanjiv Kapoor, Vijay V. Vazirani
2004	A*	`conf`	Auction algorithms for market equilibrium. STOC Rahul Garg, Sanjiv Kapoor
2004	B	`conf`	Bounded-hops power assignment in ad-hoc wireless networks. WCNC Gruia Calinescu, Sanjiv Kapoor, Mohammad Sarwat
2003	A	`conf`	Network Lifetime and Power Assignment in ad hoc Wireless Networks. ESA Gruia Calinescu, Sanjiv Kapoor, Alexander Olshevsky, Alexander Zelikovsky
2003	B	`conf`	Proximity Structures for Geometric Graphs. WADS Sanjiv Kapoor, Xiang-Yang Li
2002	—	`conf`	Geometry Based Connectivity Compression of Triangular Meshes. ICVGIP S. Nachiappan, Sanjiv Kapoor, Prem Kalra
2001	Misc	`conf`	Stream-Packing: Resource Allocation in Web Server Farms with a QoS Guarantee. HiPC Johara Shahabuddin, Abhay Chrungoo, Vishu Gupta, Sandeep Juneja, Sanjiv Kapoor, Arun Kumar
2000	J	`jnl`	An Algorithm for Enumerating All Spanning Trees of a Directed Graph. Algorithmica Sanjiv Kapoor, H. Ramesh
2000	J	`jnl`	Dynamic Maintenance of Maxima of 2-d Point Sets. SIAM J. Comput. Sanjiv Kapoor
2000	J	`jnl`	Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles. SIAM J. Comput. Sanjiv Kapoor, S. N. Maheshwari
2000	—	`ed.`	Foundations of Software Technology and Theoretical Computer Science, 20th Conference, FST TCS 2000 New Delhi, India, December 13-15, 2000, Proceedings. FSTTCS Sanjiv Kapoor, Sanjiva Prasad
2000	B	`conf`	Improved multicast routing with delay and delay variation constraints. GLOBECOM Sanjiv Kapoor, Srivatsan Raghavan
2000	Misc	`conf`	Optimal Hardware/Software Partitioning for Concurrent Specification Using Dynamic Programming. VLSI Design Aviral Shrivastava, Mohit Kumar, Sanjiv Kapoor, Shashi Kumar, M. Balakrishnan
1999	A*	`conf`	Efficient Computation of Geodesic Shortest Paths. STOC Sanjiv Kapoor
1999	A	`conf`	Hardware/Software Partitioning Between Microprocessor and Reconfigurable Hardware. FPGA M. Anand, Sanjiv Kapoor, M. Balakrishnan
1997	J	`jnl`	An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane. Discret. Comput. Geom. Sanjiv Kapoor, S. N. Maheshwari, Joseph S. B. Mitchell
1997	J	`jnl`	On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. Algorithmica Gautam Das, Sanjiv Kapoor, Michiel H. M. Smid
1996	—	`conf`	Dynamic Maintenance of Shortest Path Trees in Simple Polygons. FSTTCS Sanjiv Kapoor, Tripurari Singh
1996	J	`jnl`	New Techniques for Exact and Approximate Dynamic Closest-Point Problems. SIAM J. Comput. Sanjiv Kapoor, Michiel H. M. Smid
1996	B	`conf`	On Minimum 3-Cuts and Approximating IPCO Sanjiv Kapoor
1996	—	`conf`	On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. FSTTCS Gautam Das, Sanjiv Kapoor, Michiel H. M. Smid
1996	J	`jnl`	Speeding up Karmarkar's algorithm for multicommodity flows. Math. Program. Sanjiv Kapoor, Pravin M. Vaidya
1995	J	`jnl`	Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs. SIAM J. Comput. Sanjiv Kapoor, H. Ramesh
1995	B	`conf`	Faster Enumeration of All Spanning Trees of a Directed Graph. WADS Ramesh Hariharan, Sanjiv Kapoor, Vijay Kumar
1994	—	`conf`	Dynamic Maintenance of Maximas of 2-P Point Sets. SCG Sanjiv Kapoor
1994	—	`conf`	New Techniques for Exact and Approximate Dynamic Closest-Point Problems. SCG Sanjiv Kapoor, Michiel H. M. Smid
1991	B	`conf`	Algorithms for Generating All Spanning Trees of Undirected, Directed and Weighted Graphs. WADS Sanjiv Kapoor, H. Ramesh
1991	J	`jnl`	Stochastic Rearrangement Rules for Self-Organizing Data Structures. Algorithmica Sanjiv Kapoor, Edward M. Reingold
1989	J	`jnl`	Lower Bounds for Maximal and Convex Layers Problems. Algorithmica Sanjiv Kapoor, Prakash V. Ramanan
1989	J	`jnl`	Optimum lopsided binary trees. J. ACM Sanjiv Kapoor, Edward M. Reingold
1988	—	`conf`	Efficient Algorithms for Euclidean Shortest Path and Visibility Problems with Polygonal Obstacles. SCG Sanjiv Kapoor, S. N. Maheshwari
1987	J	`jnl`	Minimizing Channel Density in Standard Cell Layout. Algorithmica Jean R. S. Blair, Sanjiv Kapoor, Errol L. Lloyd, Kenneth J. Supowit
1987	—	`conf`	Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n) SCG Kenneth L. Clarkson, Sanjiv Kapoor, Pravin M. Vaidya
1986	A*	`conf`	Fast Algorithms for Convex Quadratic Programming and Multicommodity Flows STOC Sanjiv Kapoor, Pravin M. Vaidya
1986	—	`—`	Topics in the Design and Analysis of Combinatorial Algorithms Sanjiv Kapoor