|
Search the dblp DataBase
Kasturi R. Varadarajan:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Bruno Codenotti, Benton McCune, Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan
An Experimental Study of Different Approaches to Solve the Market Equilibrium Problem. [Citation Graph (0, 0)][DBLP] ALENEX/ANALCO, 2005, pp:167-179 [Conf]
- Telikepalli Kavitha, Kasturi R. Varadarajan
On shortest paths in line arrangements. [Citation Graph (0, 0)][DBLP] CCCG, 2003, pp:170-173 [Conf]
- Pankaj K. Agarwal, Kasturi R. Varadarajan
A near-linear constant-factor approximation for euclidean bipartite matching? [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2004, pp:247-252 [Conf]
- Kenneth L. Clarkson, Kasturi R. Varadarajan
Improved approximation algorithms for geometric set cover. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2005, pp:135-141 [Conf]
- Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan
Approximating Shortest Paths on a Convex Polytope in Three Dimensions. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1996, pp:329-338 [Conf]
- Sariel Har-Peled, Kasturi R. Varadarajan
Projective clustering in high dimensions using core-sets. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2002, pp:312-318 [Conf]
- Sariel Har-Peled, Kasturi R. Varadarajan
High-dimensional shape fitting in linear time. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2003, pp:39-47 [Conf]
- Matthew J. Katz, Kasturi R. Varadarajan
A tight bound on the number of geometric permutations of convex fat objects in Rd. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2001, pp:249-251 [Conf]
- Kasturi R. Varadarajan
Approximating Monotone Polygonal Curves Using the Uniform Metric. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1996, pp:311-318 [Conf]
- Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kasturi R. Varadarajan
Practical methods for shape fitting and kinetic data structures using core sets. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2004, pp:263-272 [Conf]
- Pankaj K. Agarwal, Cecilia Magdalena Procopiuc, Kasturi R. Varadarajan
Approximation Algorithms for k-Line Center. [Citation Graph (0, 0)][DBLP] ESA, 2002, pp:54-63 [Conf]
- Bruno Codenotti, Benton McCune, Rajiv Raman, Kasturi R. Varadarajan
Computing Equilibrium Prices: Does Theory Meet Practice?. [Citation Graph (0, 0)][DBLP] ESA, 2005, pp:83-94 [Conf]
- Sariel Har-Peled, Kasturi R. Varadarajan
Approximate Shape Fitting via Linearization. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:66-73 [Conf]
- Kasturi R. Varadarajan
A Divide-and-Conquer Algorithm for Min-Cost Perfect Matching in the Plane. [Citation Graph (0, 0)][DBLP] FOCS, 1998, pp:320-331 [Conf]
- Kasturi R. Varadarajan, Pankaj K. Agarwal
Approximating Shortest Paths on an Nonconvex Polyhedron. [Citation Graph (0, 0)][DBLP] FOCS, 1997, pp:182-191 [Conf]
- Kasturi R. Varadarajan, Srinivasan Venkatesh, Jiawei Zhang
On Approximating the Radii of Point Sets in High Dimensions. [Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:561-569 [Conf]
- Michael Edwards, Kasturi R. Varadarajan
No Coreset, No Cry: II. [Citation Graph (0, 0)][DBLP] FSTTCS, 2005, pp:107-115 [Conf]
- Bruno Codenotti, Benton McCune, Sriram Penumatcha, Kasturi R. Varadarajan
Market Equilibrium for CES Exchange Economies: Existence, Multiplicity, and Computation. [Citation Graph (0, 0)][DBLP] FSTTCS, 2005, pp:505-516 [Conf]
- Bruno Codenotti, Luis Rademacher, Kasturi R. Varadarajan
Computing Equilibrium Prices in Exchange Economies with Tax Distortions. [Citation Graph (0, 0)][DBLP] ICALP (1), 2006, pp:584-595 [Conf]
- Bruno Codenotti, Kasturi R. Varadarajan
Efficient Computation of Equilibrium Prices for Markets with Leontief Utilities. [Citation Graph (0, 0)][DBLP] ICALP, 2004, pp:371-382 [Conf]
- Boris Aronov, Marc J. van Kreveld, René van Oostrum, Kasturi R. Varadarajan
Facility Location on Terrains. [Citation Graph (0, 0)][DBLP] ISAAC, 1998, pp:19-28 [Conf]
- Pankaj K. Agarwal, Lars Arge, T. M. Murali, Kasturi R. Varadarajan, Jeffrey Scott Vitter
I/O-Efficient Algorithms for Contour-line Extraction and Planar Graph Blocking (Extended Abstract). [Citation Graph (0, 0)][DBLP] SODA, 1998, pp:117-126 [Conf]
- Bruno Codenotti, Sriram V. Pemmaraju, Kasturi R. Varadarajan
On the polynomial time computation of equilibria for certain exchange economies. [Citation Graph (0, 0)][DBLP] SODA, 2005, pp:72-81 [Conf]
- Bruno Codenotti, Amin Saberi, Kasturi R. Varadarajan, Yinyu Ye
Leontief economies encode nonzero sum two-player games. [Citation Graph (0, 0)][DBLP] SODA, 2006, pp:659-667 [Conf]
- Ashish Goel, Piotr Indyk, Kasturi R. Varadarajan
Reductions among high dimensional proximity problems. [Citation Graph (0, 0)][DBLP] SODA, 2001, pp:769-778 [Conf]
- Kamal Jain, Kasturi R. Varadarajan
Equilibria for economies with production: constant-returns technologies and production planning constraints. [Citation Graph (0, 0)][DBLP] SODA, 2006, pp:688-697 [Conf]
- Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan
Buffer minimization using max-coloring. [Citation Graph (0, 0)][DBLP] SODA, 2004, pp:562-571 [Conf]
- Kasturi R. Varadarajan, Pankaj K. Agarwal
Approximation Algorithms for Bipartite and Non-Bipartite Matching in the Plane. [Citation Graph (0, 0)][DBLP] SODA, 1999, pp:805-814 [Conf]
- Kasturi R. Varadarajan, Ganesh Venkataraman
Graph decomposition and a greedy algorithm for edge-disjoint paths. [Citation Graph (0, 0)][DBLP] SODA, 2004, pp:379-380 [Conf]
- Bruno Codenotti, Benton McCune, Kasturi R. Varadarajan
Market equilibrium via the excess demand function. [Citation Graph (0, 0)][DBLP] STOC, 2005, pp:74-83 [Conf]
- Meena Mahajan, Kasturi R. Varadarajan
A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract). [Citation Graph (0, 0)][DBLP] STOC, 2000, pp:351-357 [Conf]
- Pankaj K. Agarwal, Cecilia Magdalena Procopiuc, Kasturi R. Varadarajan
Approximation Algorithms for a k-Line Center. [Citation Graph (0, 0)][DBLP] Algorithmica, 2005, v:42, n:3-4, pp:221-230 [Journal]
- Pankaj K. Agarwal, Cecilia Magdalena Procopiuc, Kasturi R. Varadarajan
A (1+)-approximation algorithm for 2-line-center. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2003, v:26, n:2, pp:119-128 [Journal]
- Boris Aronov, Marc J. van Kreveld, René van Oostrum, Kasturi R. Varadarajan
Facility Location on a Polyhedral Surface. [Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2003, v:30, n:3, pp:357-372 [Journal]
- Pankaj K. Agarwal, Kasturi R. Varadarajan
Efficient Algorithms for Approximating Polygonal Chains. [Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2000, v:23, n:2, pp:273-291 [Journal]
- Sariel Har-Peled, Kasturi R. Varadarajan
High-Dimensional Shape Fitting in Linear Time. [Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2004, v:32, n:2, pp:269-288 [Journal]
- Matthew J. Katz, Kasturi R. Varadarajan
A Tight Bound on the Number of Geometric Permutations of Convex Fat Objects in Rd. [Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2001, v:26, n:4, pp:543-548 [Journal]
- Bruno Codenotti, Amin Saberi, Kasturi R. Varadarajan, Yinyu Ye
Leontief Economies Encode Nonzero Sum Two-Player Games [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:055, pp:- [Journal]
- Kasturi R. Varadarajan, Pankaj K. Agarwal
Linear Approximation of Simple Objects. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:62, n:2, pp:89-94 [Journal]
- Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan
Approximating shortest paths on a convex polytope in three dimensions. [Citation Graph (0, 0)][DBLP] J. ACM, 1997, v:44, n:4, pp:567-584 [Journal]
- Pankaj K. Agarwal, Sariel Har-Peled, Kasturi R. Varadarajan
Approximating extent measures of points. [Citation Graph (0, 0)][DBLP] J. ACM, 2004, v:51, n:4, pp:606-635 [Journal]
- Kasturi R. Varadarajan, Pankaj K. Agarwal
Approximating Shortest Paths on a Nonconvex Polyhedron. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2000, v:30, n:4, pp:1321-1340 [Journal]
- Kasturi R. Varadarajan, S. Venkatesh, Yinyu Ye, Jiawei Zhang
Approximating the Radii of Point Sets. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2007, v:36, n:6, pp:1764-1776 [Journal]
- Nariankadu D. Shyamalkumar, Kasturi Varadarajan
Efficient subspace approximation algorithms. [Citation Graph (0, 0)][DBLP] SODA, 2007, pp:532-540 [Conf]
- Amit Deshpande, Kasturi R. Varadarajan
Sampling-based dimension reduction for subspace approximation. [Citation Graph (0, 0)][DBLP] STOC, 2007, pp:641-650 [Conf]
- Kenneth L. Clarkson, Kasturi Varadarajan
Improved Approximation Algorithms for Geometric Set Cover [Citation Graph (0, 0)][DBLP] CoRR, 2005, v:0, n:, pp:- [Journal]
- Kenneth L. Clarkson, Kasturi Varadarajan
Improved Approximation Algorithms for Geometric Set Cover. [Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2007, v:37, n:1, pp:43-58 [Journal]
Approximation Algorithms for Domatic Partitions of Unit Disk Graphs. [Citation Graph (, )][DBLP]
An Approximation Scheme for Terrain Guarding. [Citation Graph (, )][DBLP]
Epsilon nets and union complexity. [Citation Graph (, )][DBLP]
Decomposing Coverings and the Planar Sensor Cover Problem. [Citation Graph (, )][DBLP]
On clustering to minimize the sum of radii. [Citation Graph (, )][DBLP]
On Metric Clustering to Minimize the Sum of Radii. [Citation Graph (, )][DBLP]
The Planar k-Means Problem is NP-Hard. [Citation Graph (, )][DBLP]
Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets. [Citation Graph (, )][DBLP]
Decomposing Coverings and the Planar Sensor Cover Problem [Citation Graph (, )][DBLP]
Quasi-Polynomial Time Approximation Schemes for Target Tracking [Citation Graph (, )][DBLP]
Algorithms and Hardness for Subspace Approximation [Citation Graph (, )][DBLP]
Search in 0.008secs, Finished in 0.425secs
|