Kasturi R. Varadarajan

112 papers A* 28A 8B 5Journal 50Unranked 21

Year	Rank	Type	Title / Venue / Authors
2025	A	`conf`	Relational Approximations for Subspace Primitives. APPROX/RANDOM Xiang Liu, Kasturi R. Varadarajan
2024	A	`conf`	Geometric Covering via Extraction Theorem. ITCS Sayan Bandyapadhyay, Anil Maheshwari, Sasanka Roy, Michiel Smid, Kasturi R. Varadarajan
2022	J	`jnl`	Algorithms for covering multiple submodular constraints and applications. J. Comb. Optim. Chandra Chekuri, Tanmay Inamdar, Kent Quanrud, Kasturi R. Varadarajan, Zhao Zhang
2022	—	`conf`	Non-Uniform k-Center and Greedy Clustering. SWAT Tanmay Inamdar, Kasturi R. Varadarajan
2021	J	`jnl`	Fault-Tolerant Covering Problems in Metric Spaces. Algorithmica Santanu Bhowmick, Tanmay Inamdar, Kasturi R. Varadarajan
2021	J	`jnl`	Non-Uniform k-Center and Greedy Clustering. CoRR Tanmay Inamdar, Kasturi R. Varadarajan
2020	J	`jnl`	Capacitated Covering Problems in Geometric Spaces. Discret. Comput. Geom. Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar, Kasturi R. Varadarajan
2020	A	`conf`	Capacitated Sum-Of-Radii Clustering: An FPT Approximation. ESA Tanmay Inamdar, Kasturi R. Varadarajan
2020	J	`jnl`	Improved approximation bounds for the minimum constraint removal problem. Comput. Geom. Sayan Bandyapadhyay, Neeraj Kumar, Subhash Suri, Kasturi R. Varadarajan
2019	A	`conf`	A Constant Approximation for Colorful k-Center. ESA Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Kasturi R. Varadarajan
2019	J	`jnl`	A Constant Approximation for Colorful k-Center. CoRR Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Kasturi R. Varadarajan
2019	J	`jnl`	Faster Algorithms for the Geometric Transportation Problem. CoRR Pankaj K. Agarwal, Kyle Fox, Debmalya Panigrahi, Kasturi R. Varadarajan, Allen Xiao
2019	B	`conf`	Fault Tolerant Clustering with Outliers. WAOA Tanmay Inamdar, Kasturi R. Varadarajan
2018	A*	`conf`	Capacitated Covering Problems in Geometric Spaces. SoCG Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar, Kasturi R. Varadarajan
2018	—	`conf`	Improved Approximation Bounds for the Minimum Constraint Removal Problem. APPROX-RANDOM Sayan Bandyapadhyay, Neeraj Kumar, Subhash Suri, Kasturi R. Varadarajan
2018	A*	`conf`	On Partial Covering For Geometric Set Systems. SoCG Tanmay Inamdar, Kasturi R. Varadarajan
2018	J	`jnl`	On the Partition Set Cover Problem. CoRR Tanmay Inamdar, Kasturi R. Varadarajan
2017	J	`jnl`	A Unified Framework for Capacitated Covering Problems in Metric and Geometric Spaces. CoRR Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar, Kasturi R. Varadarajan
2017	J	`jnl`	Epsilon-approximations and epsilon-nets. CoRR Nabil H. Mustafa, Kasturi R. Varadarajan
2017	A*	`conf`	Faster Algorithms for the Geometric Transportation Problem. SoCG Pankaj K. Agarwal, Kyle Fox, Debmalya Panigrahi, Kasturi R. Varadarajan, Allen Xiao
2017	J	`jnl`	On Partial Covering For Geometric Set Systems. CoRR Tanmay Inamdar, Kasturi R. Varadarajan
2016	B	`conf`	Approximate Clustering via Metric Partitioning. ISAAC Sayan Bandyapadhyay, Kasturi R. Varadarajan
2016	J	`jnl`	Improved Approximation for Metric Multi-Cover. CoRR Santanu Bhowmick, Tanmay Inamdar, Kasturi R. Varadarajan
2016	A*	`conf`	On Variants of k-means Clustering. SoCG Sayan Bandyapadhyay, Kasturi R. Varadarajan
2016	J	`jnl`	On isolating points using unit disks. J. Comput. Geom. Matt Gibson, Gaurav Kanade, Rainer Penninger, Kasturi R. Varadarajan, Ivo Vigan
2015	J	`jnl`	A Constant Factor Approximation for Orthogonal Order Preserving Layout Adjustment. CoRR Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi R. Varadarajan
2015	J	`jnl`	A constant-factor approximation for multi-covering with disks. J. Comput. Geom. Santanu Bhowmick, Kasturi R. Varadarajan, Shi-Ke Xue
2015	J	`jnl`	Approximate Clustering via Metric Partitioning. CoRR Sayan Bandyapadhyay, Kasturi R. Varadarajan
2015	A*	`conf`	Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation. SODA Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi R. Varadarajan
2015	J	`jnl`	On Variants of k-means Clustering. CoRR Sayan Bandyapadhyay, Kasturi R. Varadarajan
2015	B	`conf`	On the Approximability of Orthogonal Order Preserving Layout Adjustment. WADS Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi R. Varadarajan
2014	J	`jnl`	A Constant-Factor Approximation for Multi-Covering with Disks. CoRR Santanu Bhowmick, Kasturi R. Varadarajan, Shi-Ke Xue
2014	J	`jnl`	Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation. CoRR Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi R. Varadarajan
2014	A	`conf`	Computing Regions Decomposable into m Stars. ESA Matt Gibson, Kasturi R. Varadarajan, Xiaodong Wu
2014	J	`jnl`	Guarding Terrains via Local Search. J. Comput. Geom. Matt Gibson, Gaurav Kanade, Erik Krohn, Kasturi R. Varadarajan
2013	A*	`conf`	A constant-factor approximation for multi-covering with disks. SoCG Santanu Bhowmick, Kasturi R. Varadarajan, Shi-Ke Xue
2013	A*	`conf`	Diverse near neighbor problem. SoCG Sofiane Abbar, Sihem Amer-Yahia, Piotr Indyk, Sepideh Mahabadi, Kasturi R. Varadarajan
2012	A*	`conf`	A near-linear algorithm for projective clustering integer points. SODA Kasturi R. Varadarajan, Xin Xiao
2012	J	`jnl`	Efficient Subspace Approximation Algorithms. Discret. Comput. Geom. Nariankadu D. Shyamalkumar, Kasturi R. Varadarajan
2012	J	`jnl`	On Clustering to Minimize the Sum of Radii. SIAM J. Comput. Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan
2012	J	`jnl`	On the Sensitivity of Shape Fitting Problems CoRR Kasturi R. Varadarajan, Xin Xiao
2012	—	`conf`	On the Sensitivity of Shape Fitting Problems. FSTTCS Kasturi R. Varadarajan, Xin Xiao
2012	J	`jnl`	The planar k-means problem is NP-hard. Theor. Comput. Sci. Meena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan
2011	J	`jnl`	Max-coloring and online coloring with bandwidths on interval graphs. ACM Trans. Algorithms Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan
2011	J	`jnl`	On Isolating Points Using Disks CoRR Matt Gibson, Gaurav Kanade, Kasturi R. Varadarajan
2011	A	`conf`	On Isolating Points Using Disks. ESA Matt Gibson, Gaurav Kanade, Kasturi R. Varadarajan
2011	J	`jnl`	Optimally Decomposing Coverings with Translates of a Convex Polygon. Discret. Comput. Geom. Matt Gibson, Kasturi R. Varadarajan
2010	J	`jnl`	On Metric Clustering to Minimize the Sum of Radii. Algorithmica Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan
2010	A*	`conf`	Weighted geometric set cover via quasi-uniform sampling. STOC Kasturi R. Varadarajan
2009	J	`jnl`	Algorithms and Hardness for Subspace Approximation CoRR Amit Deshpande, Kasturi R. Varadarajan, Madhur Tulsiani, Nisheeth K. Vishnoi
2009	—	`conf`	An Approximation Scheme for Terrain Guarding. APPROX-RANDOM Matt Gibson, Gaurav Kanade, Erik Krohn, Kasturi R. Varadarajan
2009	—	`conf`	Approximation Algorithms for Domatic Partitions of Unit Disk Graphs. APPROX-RANDOM Saurav Pandit, Sriram V. Pemmaraju, Kasturi R. Varadarajan
2009	J	`jnl`	Decomposing Coverings and the Planar Sensor Cover Problem CoRR Matt Gibson, Kasturi R. Varadarajan
2009	A*	`conf`	Decomposing Coverings and the Planar Sensor Cover Problem. FOCS Matt Gibson, Kasturi R. Varadarajan
2009	—	`conf`	Epsilon nets and union complexity. SCG Kasturi R. Varadarajan
2009	J	`jnl`	Quasi-Polynomial Time Approximation Schemes for Target Tracking CoRR Matt Gibson, Gaurav Kanade, Erik Krohn, Kasturi R. Varadarajan
2009	B	`conf`	The Planar k-Means Problem is NP-Hard. WALCOM Meena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan
2008	J	`jnl`	An experimental study of different approaches to solve the market equilibrium problem. ACM J. Exp. Algorithmics Bruno Codenotti, Benton McCune, Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan
2008	—	`conf`	On Metric Clustering to Minimize the Sum of Radii. SWAT Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan
2008	A*	`conf`	On clustering to minimize the sum of radii. SODA Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan
2008	J	`jnl`	Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets. Algorithmica Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kasturi R. Varadarajan
2008	J	`jnl`	Some perfect matchings and perfect half-integral matchings in NC. Chic. J. Theor. Comput. Sci. Raghav Kulkarni, Meena Mahajan, Kasturi R. Varadarajan
2008	J	`jnl`	The complexity of equilibria: Hardness results for economies via a correspondence with games. Theor. Comput. Sci. Bruno Codenotti, Amin Saberi, Kasturi R. Varadarajan, Yinyu Ye
2007	J	`jnl`	Approximating the Radii of Point Sets. SIAM J. Comput. Kasturi R. Varadarajan, Srinivasan Venkatesh, Yinyu Ye, Jiawei Zhang
2007	A*	`conf`	Efficient subspace approximation algorithms. SODA Nariankadu D. Shyamalkumar, Kasturi R. Varadarajan
2007	J	`jnl`	Improved Approximation Algorithms for Geometric Set Cover. Discret. Comput. Geom. Kenneth L. Clarkson, Kasturi R. Varadarajan
2007	A*	`conf`	Sampling-based dimension reduction for subspace approximation. STOC Amit Deshpande, Kasturi R. Varadarajan
2006	—	`conf`	Computing Equilibrium Prices in Exchange Economies with Tax Distortions. ICALP (1) Bruno Codenotti, Luis Rademacher, Kasturi R. Varadarajan
2006	A*	`conf`	Equilibria for economies with production: constant-returns technologies and production planning constraints. SODA Kamal Jain, Kasturi R. Varadarajan
2006	A*	`conf`	Leontief economies encode nonzero sum two-player games. SODA Bruno Codenotti, Amin Saberi, Kasturi R. Varadarajan, Yinyu Ye
2005	—	`conf`	An Experimental Study of Different Approaches to Solve the Market Equilibrium Problem. ALENEX/ANALCO Bruno Codenotti, Benton McCune, Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan
2005	J	`jnl`	Approximation Algorithms for a k-Line Center. Algorithmica Pankaj K. Agarwal, Cecilia Magdalena Procopiuc, Kasturi R. Varadarajan
2005	A	`conf`	Computing Equilibrium Prices: Does Theory Meet Practice?. ESA Bruno Codenotti, Benton McCune, Rajiv Raman, Kasturi R. Varadarajan
2005	J	`jnl`	Improved Approximation Algorithms for Geometric Set Cover CoRR Kenneth L. Clarkson, Kasturi R. Varadarajan
2005	—	`conf`	Improved approximation algorithms for geometric set cover. SCG Kenneth L. Clarkson, Kasturi R. Varadarajan
2005	J	`jnl`	Leontief Economies Encode Nonzero Sum Two-Player Games Electron. Colloquium Comput. Complex. Bruno Codenotti, Amin Saberi, Kasturi R. Varadarajan, Yinyu Ye
2005	—	`conf`	Market Equilibrium for CES Exchange Economies: Existence, Multiplicity, and Computation. FSTTCS Bruno Codenotti, Benton McCune, Sriram Penumatcha, Kasturi R. Varadarajan
2005	A*	`conf`	Market equilibrium via the excess demand function. STOC Bruno Codenotti, Benton McCune, Kasturi R. Varadarajan
2005	—	`conf`	No Coreset, No Cry: II. FSTTCS Michael Edwards, Kasturi R. Varadarajan
2005	A*	`conf`	On the polynomial time computation of equilibria for certain exchange economies. SODA Bruno Codenotti, Sriram V. Pemmaraju, Kasturi R. Varadarajan
2004	—	`conf`	A near-linear constant-factor approximation for euclidean bipartite matching? SCG Pankaj K. Agarwal, Kasturi R. Varadarajan
2004	J	`jnl`	Approximating extent measures of points. J. ACM Pankaj K. Agarwal, Sariel Har-Peled, Kasturi R. Varadarajan
2004	A*	`conf`	Buffer minimization using max-coloring. SODA Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan
2004	A*	`conf`	Efficient Computation of Equilibrium Prices for Markets with Leontief Utilities. ICALP Bruno Codenotti, Kasturi R. Varadarajan
2004	A*	`conf`	Graph decomposition and a greedy algorithm for edge-disjoint paths. SODA Kasturi R. Varadarajan, Ganesh Venkataraman
2004	J	`jnl`	High-Dimensional Shape Fitting in Linear Time. Discret. Comput. Geom. Sariel Har-Peled, Kasturi R. Varadarajan
2004	—	`conf`	Practical methods for shape fitting and kinetic data structures using core sets. SCG Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kasturi R. Varadarajan
2004	J	`jnl`	The computation of market equilibria. SIGACT News Bruno Codenotti, Sriram V. Pemmaraju, Kasturi R. Varadarajan
2003	J	`jnl`	A (1+)-approximation algorithm for 2-line-center. Comput. Geom. Pankaj K. Agarwal, Cecilia Magdalena Procopiuc, Kasturi R. Varadarajan
2003	J	`jnl`	Facility Location on a Polyhedral Surface. Discret. Comput. Geom. Boris Aronov, Marc J. van Kreveld, René van Oostrum, Kasturi R. Varadarajan
2003	—	`conf`	High-dimensional shape fitting in linear time. SCG Sariel Har-Peled, Kasturi R. Varadarajan
2003	—	`conf`	On shortest paths in line arrangements. CCCG Telikepalli Kavitha, Kasturi R. Varadarajan
2002	A	`conf`	Approximation Algorithms for k-Line Center. ESA Pankaj K. Agarwal, Cecilia Magdalena Procopiuc, Kasturi R. Varadarajan
2002	A*	`conf`	On Approximating the Radii of Point Sets in High Dimensions. FOCS Kasturi R. Varadarajan, Srinivasan Venkatesh, Jiawei Zhang
2002	—	`conf`	Projective clustering in high dimensions using core-sets. SCG Sariel Har-Peled, Kasturi R. Varadarajan
2001	J	`jnl`	A Tight Bound on the Number of Geometric Permutations of Convex Fat Objects in Discret. Comput. Geom. Matthew J. Katz, Kasturi R. Varadarajan
2001	—	`conf`	A tight bound on the number of geometric permutations of convex fat objects in R SCG Matthew J. Katz, Kasturi R. Varadarajan
2001	A*	`conf`	Approximate Shape Fitting via Linearization. FOCS Sariel Har-Peled, Kasturi R. Varadarajan
2001	A*	`conf`	Reductions among high dimensional proximity problems. SODA Ashish Goel, Piotr Indyk, Kasturi R. Varadarajan
2000	A*	`conf`	A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract). STOC Meena Mahajan, Kasturi R. Varadarajan
2000	J	`jnl`	Approximating Shortest Paths on a Nonconvex Polyhedron. SIAM J. Comput. Kasturi R. Varadarajan, Pankaj K. Agarwal
2000	J	`jnl`	Efficient Algorithms for Approximating Polygonal Chains. Discret. Comput. Geom. Pankaj K. Agarwal, Kasturi R. Varadarajan
1999	A*	`conf`	Approximation Algorithms for Bipartite and Non-Bipartite Matching in the Plane. SODA Kasturi R. Varadarajan, Pankaj K. Agarwal
1998	A*	`conf`	A Divide-and-Conquer Algorithm for Min-Cost Perfect Matching in the Plane. FOCS Kasturi R. Varadarajan
1998	B	`conf`	Facility Location on Terrains. ISAAC Boris Aronov, Marc J. van Kreveld, René van Oostrum, Kasturi R. Varadarajan
1998	A*	`conf`	I/O-Efficient Algorithms for Contour-line Extraction and Planar Graph Blocking (Extended Abstract). SODA Pankaj K. Agarwal, Lars Arge, T. M. Murali, Kasturi R. Varadarajan, Jeffrey Scott Vitter
1997	A*	`conf`	Approximating Shortest Paths on an Nonconvex Polyhedron. FOCS Kasturi R. Varadarajan, Pankaj K. Agarwal
1997	J	`jnl`	Approximating shortest paths on a convex polytope in three dimensions. J. ACM Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan
1997	J	`jnl`	Linear Approximation of Simple Objects. Inf. Process. Lett. Kasturi R. Varadarajan, Pankaj K. Agarwal
1996	—	`conf`	Approximating Monotone Polygonal Curves Using the Uniform Metric. SCG Kasturi R. Varadarajan
1996	—	`conf`	Approximating Shortest Paths on a Convex Polytope in Three Dimensions. SCG Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan
1995	—	`conf`	Linear approximation of simple objects. CCCG Kasturi R. Varadarajan, Pankaj K. Agarwal