| 2009 | ||
|---|---|---|
| 59 | Matt Gibson, Gaurav Kanade, Erik Krohn, Kasturi R. Varadarajan: An Approximation Scheme for Terrain Guarding. APPROX-RANDOM 2009: 140-148 | |
| 58 | Saurav Pandit, Sriram V. Pemmaraju, Kasturi R. Varadarajan: Approximation Algorithms for Domatic Partitions of Unit Disk Graphs. APPROX-RANDOM 2009: 312-325 | |
| 57 | Kasturi R. Varadarajan: Epsilon nets and union complexity. Symposium on Computational Geometry 2009: 11-16 | |
| 56 | Meena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan: The Planar k-Means Problem is NP-Hard. WALCOM 2009: 274-285 | |
| 55 | Matt Gibson, Kasturi R. Varadarajan: Decomposing Coverings and the Planar Sensor Cover Problem CoRR abs/0905.1093: (2009) | |
| 54 | Matt Gibson, Gaurav Kanade, Erik Krohn, Kasturi R. Varadarajan: Quasi-Polynomial Time Approximation Schemes for Target Tracking CoRR abs/0907.1080: (2009) | |
| 2008 | ||
| 53 | Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan: On clustering to minimize the sum of radii. SODA 2008: 819-825 | |
| 52 | Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan: On Metric Clustering to Minimize the Sum of Radii. SWAT 2008: 282-293 | |
| 51 | Bruno Codenotti, Benton McCune, Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan: An experimental study of different approaches to solve the market equilibrium problem. ACM Journal of Experimental Algorithmics 12: (2008) | |
| 50 | Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kasturi R. Varadarajan: Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets. Algorithmica 52(3): 378-402 (2008) | |
| 49 | Bruno Codenotti, Amin Saberi, Kasturi R. Varadarajan, Yinyu Ye: The complexity of equilibria: Hardness results for economies via a correspondence with games. Theor. Comput. Sci. 408(2-3): 188-198 (2008) | |
| 2007 | ||
| 48 | Nariankadu D. Shyamalkumar, Kasturi R. Varadarajan: Efficient subspace approximation algorithms. SODA 2007: 532-540 | |
| 47 | Amit Deshpande, Kasturi R. Varadarajan: Sampling-based dimension reduction for subspace approximation. STOC 2007: 641-650 | |
| 46 | Kenneth L. Clarkson, Kasturi R. Varadarajan: Improved Approximation Algorithms for Geometric Set Cover. Discrete & Computational Geometry 37(1): 43-58 (2007) | |
| 45 | Kasturi R. Varadarajan, Srinivasan Venkatesh, Yinyu Ye, Jiawei Zhang: Approximating the Radii of Point Sets. SIAM J. Comput. 36(6): 1764-1776 (2007) | |
| 2006 | ||
| 44 | Bruno Codenotti, Luis Rademacher, Kasturi R. Varadarajan: Computing Equilibrium Prices in Exchange Economies with Tax Distortions. ICALP (1) 2006: 584-595 | |
| 43 | Bruno Codenotti, Amin Saberi, Kasturi R. Varadarajan, Yinyu Ye: Leontief economies encode nonzero sum two-player games. SODA 2006: 659-667 | |
| 42 | Kamal Jain, Kasturi R. Varadarajan: Equilibria for economies with production: constant-returns technologies and production planning constraints. SODA 2006: 688-697 | |
| 2005 | ||
| 41 | Bruno Codenotti, Benton McCune, Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan: An Experimental Study of Different Approaches to Solve the Market Equilibrium Problem. ALENEX/ANALCO 2005: 167-179 | |
| 40 | Bruno Codenotti, Benton McCune, Rajiv Raman, Kasturi R. Varadarajan: Computing Equilibrium Prices: Does Theory Meet Practice?. ESA 2005: 83-94 | |
| 39 | Michael Edwards, Kasturi R. Varadarajan: No Coreset, No Cry: II. FSTTCS 2005: 107-115 | |
| 38 | Bruno Codenotti, Benton McCune, Sriram Penumatcha, Kasturi R. Varadarajan: Market Equilibrium for CES Exchange Economies: Existence, Multiplicity, and Computation. FSTTCS 2005: 505-516 | |
| 37 | Bruno Codenotti, Sriram V. Pemmaraju, Kasturi R. Varadarajan: On the polynomial time computation of equilibria for certain exchange economies. SODA 2005: 72-81 | |
| 36 | Bruno Codenotti, Benton McCune, Kasturi R. Varadarajan: Market equilibrium via the excess demand function. STOC 2005: 74-83 | |
| 35 | Kenneth L. Clarkson, Kasturi R. Varadarajan: Improved approximation algorithms for geometric set cover. Symposium on Computational Geometry 2005: 135-141 | |
| 34 | Pankaj K. Agarwal, Cecilia Magdalena Procopiuc, Kasturi R. Varadarajan: Approximation Algorithms for a k-Line Center. Algorithmica 42(3-4): 221-230 (2005) | |
| 33 | Kenneth L. Clarkson, Kasturi R. Varadarajan: Improved Approximation Algorithms for Geometric Set Cover CoRR abs/cs/0501045: (2005) | |
| 32 | Bruno Codenotti, Amin Saberi, Kasturi R. Varadarajan, Yinyu Ye: Leontief Economies Encode Nonzero Sum Two-Player Games Electronic Colloquium on Computational Complexity (ECCC)(055): (2005) | |
| 2004 | ||
| 31 | Bruno Codenotti, Kasturi R. Varadarajan: Efficient Computation of Equilibrium Prices for Markets with Leontief Utilities. ICALP 2004: 371-382 | |
| 30 | Kasturi R. Varadarajan, Ganesh Venkataraman: Graph decomposition and a greedy algorithm for edge-disjoint paths. SODA 2004: 379-380 | |
| 29 | Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan: Buffer minimization using max-coloring. SODA 2004: 562-571 | |
| 28 | Pankaj K. Agarwal, Kasturi R. Varadarajan: A near-linear constant-factor approximation for euclidean bipartite matching? Symposium on Computational Geometry 2004: 247-252 | |
| 27 | Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kasturi R. Varadarajan: Practical methods for shape fitting and kinetic data structures using core sets. Symposium on Computational Geometry 2004: 263-272 | |
| 26 | Sariel Har-Peled, Kasturi R. Varadarajan: High-Dimensional Shape Fitting in Linear Time. Discrete & Computational Geometry 32(2): 269-288 (2004) | |
| 25 | Pankaj K. Agarwal, Sariel Har-Peled, Kasturi R. Varadarajan: Approximating extent measures of points. J. ACM 51(4): 606-635 (2004) | |
| 24 | Bruno Codenotti, Sriram V. Pemmaraju, Kasturi R. Varadarajan: The computation of market equilibria. SIGACT News 35(4): 23-37 (2004) | |
| 2003 | ||
| 23 | Telikepalli Kavitha, Kasturi R. Varadarajan: On shortest paths in line arrangements. CCCG 2003: 170-173 | |
| 22 | Sariel Har-Peled, Kasturi R. Varadarajan: High-dimensional shape fitting in linear time. Symposium on Computational Geometry 2003: 39-47 | |
| 21 | Pankaj K. Agarwal, Cecilia Magdalena Procopiuc, Kasturi R. Varadarajan: A (1+)-approximation algorithm for 2-line-center. Comput. Geom. 26(2): 119-128 (2003) | |
| 20 | Boris Aronov, Marc J. van Kreveld, René van Oostrum, Kasturi R. Varadarajan: Facility Location on a Polyhedral Surface. Discrete & Computational Geometry 30(3): 357-372 (2003) | |
| 2002 | ||
| 19 | Pankaj K. Agarwal, Cecilia Magdalena Procopiuc, Kasturi R. Varadarajan: Approximation Algorithms for k-Line Center. ESA 2002: 54-63 | |
| 18 | Kasturi R. Varadarajan, Srinivasan Venkatesh, Jiawei Zhang: On Approximating the Radii of Point Sets in High Dimensions. FOCS 2002: 561-569 | |
| 17 | Sariel Har-Peled, Kasturi R. Varadarajan: Projective clustering in high dimensions using core-sets. Symposium on Computational Geometry 2002: 312-318 | |
| 2001 | ||
| 16 | Sariel Har-Peled, Kasturi R. Varadarajan: Approximate Shape Fitting via Linearization. FOCS 2001: 66-73 | |
| 15 | Ashish Goel, Piotr Indyk, Kasturi R. Varadarajan: Reductions among high dimensional proximity problems. SODA 2001: 769-778 | |
| 14 | Matthew J. Katz, Kasturi R. Varadarajan: A tight bound on the number of geometric permutations of convex fat objects in Rd. Symposium on Computational Geometry 2001: 249-251 | |
| 13 | Matthew J. Katz, Kasturi R. Varadarajan: A Tight Bound on the Number of Geometric Permutations of Convex Fat Objects in Rd. Discrete & Computational Geometry 26(4): 543-548 (2001) | |
| 2000 | ||
| 12 | Meena Mahajan, Kasturi R. Varadarajan: A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract). STOC 2000: 351-357 | |
| 11 | Pankaj K. Agarwal, Kasturi R. Varadarajan: Efficient Algorithms for Approximating Polygonal Chains. Discrete & Computational Geometry 23(2): 273-291 (2000) | |
| 10 | Kasturi R. Varadarajan, Pankaj K. Agarwal: Approximating Shortest Paths on a Nonconvex Polyhedron. SIAM J. Comput. 30(4): 1321-1340 (2000) | |
| 1999 | ||
| 9 | Kasturi R. Varadarajan, Pankaj K. Agarwal: Approximation Algorithms for Bipartite and Non-Bipartite Matching in the Plane. SODA 1999: 805-814 | |
| 1998 | ||
| 8 | Kasturi R. Varadarajan: A Divide-and-Conquer Algorithm for Min-Cost Perfect Matching in the Plane. FOCS 1998: 320-331 | |
| 7 | Boris Aronov, Marc J. van Kreveld, René van Oostrum, Kasturi R. Varadarajan: Facility Location on Terrains. ISAAC 1998: 19-28 | |
| 6 | 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). SODA 1998: 117-126 | |
| 1997 | ||
| 5 | Kasturi R. Varadarajan, Pankaj K. Agarwal: Approximating Shortest Paths on an Nonconvex Polyhedron. FOCS 1997: 182-191 | |
| 4 | Kasturi R. Varadarajan, Pankaj K. Agarwal: Linear Approximation of Simple Objects. Inf. Process. Lett. 62(2): 89-94 (1997) | |
| 3 | Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan: Approximating shortest paths on a convex polytope in three dimensions. J. ACM 44(4): 567-584 (1997) | |
| 1996 | ||
| 2 | Kasturi R. Varadarajan: Approximating Monotone Polygonal Curves Using the Uniform Metric. Symposium on Computational Geometry 1996: 311-318 | |
| 1 | Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan: Approximating Shortest Paths on a Convex Polytope in Three Dimensions. Symposium on Computational Geometry 1996: 329-338 | |