default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKasturi R. Varadarajan
Person information
- affiliation: University of Iowa, Department of Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c61]Sayan Bandyapadhyay, Anil Maheshwari, Sasanka Roy, Michiel Smid, Kasturi R. Varadarajan:
Geometric Covering via Extraction Theorem. ITCS 2024: 7:1-7:20- 2022
- [j30]Chandra Chekuri, Tanmay Inamdar
, Kent Quanrud, Kasturi R. Varadarajan, Zhao Zhang:
Algorithms for covering multiple submodular constraints and applications. J. Comb. Optim. 44(2): 979-1010 (2022) - [c60]Tanmay Inamdar, Kasturi R. Varadarajan:
Non-Uniform k-Center and Greedy Clustering. SWAT 2022: 28:1-28:20 - 2021
- [j29]Santanu Bhowmick, Tanmay Inamdar, Kasturi R. Varadarajan:
Fault-Tolerant Covering Problems in Metric Spaces. Algorithmica 83(2): 413-446 (2021) - [i20]Tanmay Inamdar, Kasturi R. Varadarajan:
Non-Uniform k-Center and Greedy Clustering. CoRR abs/2111.06362 (2021) - 2020
- [j28]Sayan Bandyapadhyay, Neeraj Kumar, Subhash Suri, Kasturi R. Varadarajan:
Improved approximation bounds for the minimum constraint removal problem. Comput. Geom. 90: 101650 (2020) - [j27]Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar, Kasturi R. Varadarajan:
Capacitated Covering Problems in Geometric Spaces. Discret. Comput. Geom. 63(4): 768-798 (2020) - [c59]Tanmay Inamdar, Kasturi R. Varadarajan:
Capacitated Sum-Of-Radii Clustering: An FPT Approximation. ESA 2020: 62:1-62:17
2010 – 2019
- 2019
- [c58]Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Kasturi R. Varadarajan:
A Constant Approximation for Colorful k-Center. ESA 2019: 12:1-12:14 - [c57]Tanmay Inamdar, Kasturi R. Varadarajan:
Fault Tolerant Clustering with Outliers. WAOA 2019: 188-201 - [i19]Pankaj K. Agarwal, Kyle Fox, Debmalya Panigrahi, Kasturi R. Varadarajan, Allen Xiao:
Faster Algorithms for the Geometric Transportation Problem. CoRR abs/1903.08263 (2019) - [i18]Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Kasturi R. Varadarajan:
A Constant Approximation for Colorful k-Center. CoRR abs/1907.08906 (2019) - 2018
- [c56]Sayan Bandyapadhyay, Neeraj Kumar, Subhash Suri, Kasturi R. Varadarajan:
Improved Approximation Bounds for the Minimum Constraint Removal Problem. APPROX-RANDOM 2018: 2:1-2:19 - [c55]Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar, Kasturi R. Varadarajan:
Capacitated Covering Problems in Geometric Spaces. SoCG 2018: 7:1-7:15 - [c54]Tanmay Inamdar, Kasturi R. Varadarajan:
On Partial Covering For Geometric Set Systems. SoCG 2018: 47:1-47:14 - [i17]Tanmay Inamdar, Kasturi R. Varadarajan:
On the Partition Set Cover Problem. CoRR abs/1809.06506 (2018) - 2017
- [c53]Pankaj K. Agarwal, Kyle Fox, Debmalya Panigrahi, Kasturi R. Varadarajan, Allen Xiao:
Faster Algorithms for the Geometric Transportation Problem. SoCG 2017: 7:1-7:16 - [i16]Nabil H. Mustafa, Kasturi R. Varadarajan:
Epsilon-approximations and epsilon-nets. CoRR abs/1702.03676 (2017) - [i15]Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar, Kasturi R. Varadarajan:
A Unified Framework for Capacitated Covering Problems in Metric and Geometric Spaces. CoRR abs/1707.05170 (2017) - [i14]Tanmay Inamdar, Kasturi R. Varadarajan:
On Partial Covering For Geometric Set Systems. CoRR abs/1711.04882 (2017) - 2016
- [j26]Matt Gibson, Gaurav Kanade, Rainer Penninger, Kasturi R. Varadarajan, Ivo Vigan:
On isolating points using unit disks. J. Comput. Geom. 7(1): 540-557 (2016) - [c52]Sayan Bandyapadhyay, Kasturi R. Varadarajan:
On Variants of k-means Clustering. SoCG 2016: 14:1-14:15 - [c51]Sayan Bandyapadhyay, Kasturi R. Varadarajan:
Approximate Clustering via Metric Partitioning. ISAAC 2016: 15:1-15:13 - [i13]Santanu Bhowmick, Tanmay Inamdar, Kasturi R. Varadarajan:
Improved Approximation for Metric Multi-Cover. CoRR abs/1602.04152 (2016) - 2015
- [j25]Santanu Bhowmick, Kasturi R. Varadarajan, Shi-Ke Xue:
A constant-factor approximation for multi-covering with disks. J. Comput. Geom. 6(1): 220-234 (2015) - [c50]Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi R. Varadarajan:
Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation. SODA 2015: 1457-1470 - [c49]Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi R. Varadarajan:
On the Approximability of Orthogonal Order Preserving Layout Adjustment. WADS 2015: 54-65 - [i12]Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi R. Varadarajan:
A Constant Factor Approximation for Orthogonal Order Preserving Layout Adjustment. CoRR abs/1502.03847 (2015) - [i11]Sayan Bandyapadhyay, Kasturi R. Varadarajan:
Approximate Clustering via Metric Partitioning. CoRR abs/1507.02222 (2015) - [i10]Sayan Bandyapadhyay, Kasturi R. Varadarajan:
On Variants of k-means Clustering. CoRR abs/1512.02985 (2015) - 2014
- [j24]Matt Gibson, Gaurav Kanade, Erik Krohn, Kasturi R. Varadarajan:
Guarding Terrains via Local Search. J. Comput. Geom. 5(1): 168-178 (2014) - [c48]Matt Gibson, Kasturi R. Varadarajan, Xiaodong Wu:
Computing Regions Decomposable into m Stars. ESA 2014: 480-491 - [i9]Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi R. Varadarajan:
Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation. CoRR abs/1404.3776 (2014) - [i8]Santanu Bhowmick, Kasturi R. Varadarajan, Shi-Ke Xue:
A Constant-Factor Approximation for Multi-Covering with Disks. CoRR abs/1407.5674 (2014) - 2013
- [c47]Sofiane Abbar, Sihem Amer-Yahia, Piotr Indyk, Sepideh Mahabadi, Kasturi R. Varadarajan:
Diverse near neighbor problem. SoCG 2013: 207-214 - [c46]Santanu Bhowmick, Kasturi R. Varadarajan, Shi-Ke Xue:
A constant-factor approximation for multi-covering with disks. SoCG 2013: 243-248 - 2012
- [j23]Nariankadu D. Shyamalkumar, Kasturi R. Varadarajan:
Efficient Subspace Approximation Algorithms. Discret. Comput. Geom. 47(1): 44-63 (2012) - [j22]Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan:
On Clustering to Minimize the Sum of Radii. SIAM J. Comput. 41(1): 47-60 (2012) - [j21]Meena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan:
The planar k-means problem is NP-hard. Theor. Comput. Sci. 442: 13-21 (2012) - [c45]Kasturi R. Varadarajan, Xin Xiao:
On the Sensitivity of Shape Fitting Problems. FSTTCS 2012: 486-497 - [c44]Kasturi R. Varadarajan, Xin Xiao:
A near-linear algorithm for projective clustering integer points. SODA 2012: 1329-1342 - [i7]Kasturi R. Varadarajan, Xin Xiao:
On the Sensitivity of Shape Fitting Problems. CoRR abs/1209.4893 (2012) - 2011
- [j20]Matt Gibson, Kasturi R. Varadarajan:
Optimally Decomposing Coverings with Translates of a Convex Polygon. Discret. Comput. Geom. 46(2): 313-333 (2011) - [j19]Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan:
Max-coloring and online coloring with bandwidths on interval graphs. ACM Trans. Algorithms 7(3): 35:1-35:21 (2011) - [c43]Matt Gibson, Gaurav Kanade, Kasturi R. Varadarajan:
On Isolating Points Using Disks. ESA 2011: 61-69 - [i6]Matt Gibson, Gaurav Kanade, Kasturi R. Varadarajan:
On Isolating Points Using Disks. CoRR abs/1104.5043 (2011) - 2010
- [j18]Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan:
On Metric Clustering to Minimize the Sum of Radii. Algorithmica 57(3): 484-498 (2010) - [c42]Kasturi R. Varadarajan:
Weighted geometric set cover via quasi-uniform sampling. STOC 2010: 641-648
2000 – 2009
- 2009
- [c41]Matt Gibson, Gaurav Kanade, Erik Krohn, Kasturi R. Varadarajan:
An Approximation Scheme for Terrain Guarding. APPROX-RANDOM 2009: 140-148 - [c40]Saurav Pandit, Sriram V. Pemmaraju, Kasturi R. Varadarajan:
Approximation Algorithms for Domatic Partitions of Unit Disk Graphs. APPROX-RANDOM 2009: 312-325 - [c39]Kasturi R. Varadarajan:
Epsilon nets and union complexity. SCG 2009: 11-16 - [c38]Matt Gibson, Kasturi R. Varadarajan:
Decomposing Coverings and the Planar Sensor Cover Problem. FOCS 2009: 159-168 - [c37]Meena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan:
The Planar k-Means Problem is NP-Hard. WALCOM 2009: 274-285 - [i5]Matt Gibson, Kasturi R. Varadarajan:
Decomposing Coverings and the Planar Sensor Cover Problem. CoRR abs/0905.1093 (2009) - [i4]Matt Gibson, Gaurav Kanade, Erik Krohn, Kasturi R. Varadarajan:
Quasi-Polynomial Time Approximation Schemes for Target Tracking. CoRR abs/0907.1080 (2009) - [i3]Amit Deshpande, Kasturi R. Varadarajan, Madhur Tulsiani, Nisheeth K. Vishnoi:
Algorithms and Hardness for Subspace Approximation. CoRR abs/0912.1403 (2009) - 2008
- [j17]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) - [j16]Raghav Kulkarni, Meena Mahajan, Kasturi R. Varadarajan:
Some perfect matchings and perfect half-integral matchings in NC. Chic. J. Theor. Comput. Sci. 2008 (2008) - [j15]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 J. Exp. Algorithmics 12: 3.3:1-3.3:21 (2008) - [j14]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) - [c36]Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan:
On clustering to minimize the sum of radii. SODA 2008: 819-825 - [c35]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 - 2007
- [j13]Kenneth L. Clarkson, Kasturi R. Varadarajan:
Improved Approximation Algorithms for Geometric Set Cover. Discret. Comput. Geom. 37(1): 43-58 (2007) - [j12]Kasturi R. Varadarajan, Srinivasan Venkatesh, Yinyu Ye, Jiawei Zhang:
Approximating the Radii of Point Sets. SIAM J. Comput. 36(6): 1764-1776 (2007) - [c34]Nariankadu D. Shyamalkumar, Kasturi R. Varadarajan:
Efficient subspace approximation algorithms. SODA 2007: 532-540 - [c33]Amit Deshpande, Kasturi R. Varadarajan:
Sampling-based dimension reduction for subspace approximation. STOC 2007: 641-650 - 2006
- [c32]Bruno Codenotti, Luis Rademacher, Kasturi R. Varadarajan:
Computing Equilibrium Prices in Exchange Economies with Tax Distortions. ICALP (1) 2006: 584-595 - [c31]Bruno Codenotti, Amin Saberi, Kasturi R. Varadarajan, Yinyu Ye:
Leontief economies encode nonzero sum two-player games. SODA 2006: 659-667 - [c30]Kamal Jain, Kasturi R. Varadarajan:
Equilibria for economies with production: constant-returns technologies and production planning constraints. SODA 2006: 688-697 - 2005
- [j11]Pankaj K. Agarwal, Cecilia Magdalena Procopiuc, Kasturi R. Varadarajan:
Approximation Algorithms for a k-Line Center. Algorithmica 42(3-4): 221-230 (2005) - [c29]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 - [c28]Kenneth L. Clarkson, Kasturi R. Varadarajan:
Improved approximation algorithms for geometric set cover. SCG 2005: 135-141 - [c27]Bruno Codenotti, Benton McCune, Rajiv Raman, Kasturi R. Varadarajan:
Computing Equilibrium Prices: Does Theory Meet Practice?. ESA 2005: 83-94 - [c26]Michael Edwards, Kasturi R. Varadarajan:
No Coreset, No Cry: II. FSTTCS 2005: 107-115 - [c25]Bruno Codenotti, Benton McCune, Sriram Penumatcha, Kasturi R. Varadarajan:
Market Equilibrium for CES Exchange Economies: Existence, Multiplicity, and Computation. FSTTCS 2005: 505-516 - [c24]Bruno Codenotti, Sriram V. Pemmaraju, Kasturi R. Varadarajan:
On the polynomial time computation of equilibria for certain exchange economies. SODA 2005: 72-81 - [c23]Bruno Codenotti, Benton McCune, Kasturi R. Varadarajan:
Market equilibrium via the excess demand function. STOC 2005: 74-83 - [i2]Kenneth L. Clarkson, Kasturi R. Varadarajan:
Improved Approximation Algorithms for Geometric Set Cover. CoRR abs/cs/0501045 (2005) - [i1]Bruno Codenotti, Amin Saberi, Kasturi R. Varadarajan, Yinyu Ye:
Leontief Economies Encode Nonzero Sum Two-Player Games. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j10]Sariel Har-Peled, Kasturi R. Varadarajan:
High-Dimensional Shape Fitting in Linear Time. Discret. Comput. Geom. 32(2): 269-288 (2004) - [j9]Pankaj K. Agarwal, Sariel Har-Peled, Kasturi R. Varadarajan:
Approximating extent measures of points. J. ACM 51(4): 606-635 (2004) - [j8]Bruno Codenotti, Sriram V. Pemmaraju, Kasturi R. Varadarajan:
The computation of market equilibria. SIGACT News 35(4): 23-37 (2004) - [c22]Pankaj K. Agarwal, Kasturi R. Varadarajan:
A near-linear constant-factor approximation for euclidean bipartite matching? SCG 2004: 247-252 - [c21]Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kasturi R. Varadarajan:
Practical methods for shape fitting and kinetic data structures using core sets. SCG 2004: 263-272 - [c20]Bruno Codenotti, Kasturi R. Varadarajan:
Efficient Computation of Equilibrium Prices for Markets with Leontief Utilities. ICALP 2004: 371-382 - [c19]Kasturi R. Varadarajan, Ganesh Venkataraman:
Graph decomposition and a greedy algorithm for edge-disjoint paths. SODA 2004: 379-380 - [c18]Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan:
Buffer minimization using max-coloring. SODA 2004: 562-571 - 2003
- [j7]Pankaj K. Agarwal, Cecilia Magdalena Procopiuc, Kasturi R. Varadarajan:
A (1+)-approximation algorithm for 2-line-center. Comput. Geom. 26(2): 119-128 (2003) - [j6]Boris Aronov, Marc J. van Kreveld, René van Oostrum, Kasturi R. Varadarajan:
Facility Location on a Polyhedral Surface. Discret. Comput. Geom. 30(3): 357-372 (2003) - [c17]Telikepalli Kavitha, Kasturi R. Varadarajan:
On shortest paths in line arrangements. CCCG 2003: 170-173 - [c16]Sariel Har-Peled, Kasturi R. Varadarajan:
High-dimensional shape fitting in linear time. SCG 2003: 39-47 - 2002
- [c15]Sariel Har-Peled, Kasturi R. Varadarajan:
Projective clustering in high dimensions using core-sets. SCG 2002: 312-318 - [c14]Pankaj K. Agarwal, Cecilia Magdalena Procopiuc, Kasturi R. Varadarajan:
Approximation Algorithms for k-Line Center. ESA 2002: 54-63 - [c13]Kasturi R. Varadarajan, Srinivasan Venkatesh, Jiawei Zhang:
On Approximating the Radii of Point Sets in High Dimensions. FOCS 2002: 561-569 - 2001
- [j5]Matthew J. Katz, Kasturi R. Varadarajan:
A Tight Bound on the Number of Geometric Permutations of Convex Fat Objects in Rd. Discret. Comput. Geom. 26(4): 543-548 (2001) - [c12]Matthew J. Katz, Kasturi R. Varadarajan:
A tight bound on the number of geometric permutations of convex fat objects in Rd. SCG 2001: 249-251 - [c11]Sariel Har-Peled, Kasturi R. Varadarajan:
Approximate Shape Fitting via Linearization. FOCS 2001: 66-73 - [c10]Ashish Goel, Piotr Indyk, Kasturi R. Varadarajan:
Reductions among high dimensional proximity problems. SODA 2001: 769-778 - 2000
- [j4]Pankaj K. Agarwal, Kasturi R. Varadarajan:
Efficient Algorithms for Approximating Polygonal Chains. Discret. Comput. Geom. 23(2): 273-291 (2000) - [j3]Kasturi R. Varadarajan, Pankaj K. Agarwal:
Approximating Shortest Paths on a Nonconvex Polyhedron. SIAM J. Comput. 30(4): 1321-1340 (2000) - [c9]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
1990 – 1999
- 1999
- [c8]Kasturi R. Varadarajan, Pankaj K. Agarwal:
Approximation Algorithms for Bipartite and Non-Bipartite Matching in the Plane. SODA 1999: 805-814 - 1998
- [c7]Kasturi R. Varadarajan:
A Divide-and-Conquer Algorithm for Min-Cost Perfect Matching in the Plane. FOCS 1998: 320-331 - [c6]Boris Aronov, Marc J. van Kreveld, René van Oostrum, Kasturi R. Varadarajan:
Facility Location on Terrains. ISAAC 1998: 19-28 - [c5]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
- [j2]Kasturi R. Varadarajan, Pankaj K. Agarwal:
Linear Approximation of Simple Objects. Inf. Process. Lett. 62(2): 89-94 (1997) - [j1]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) - [c4]Kasturi R. Varadarajan, Pankaj K. Agarwal:
Approximating Shortest Paths on an Nonconvex Polyhedron. FOCS 1997: 182-191 - 1996
- [c3]Kasturi R. Varadarajan:
Approximating Monotone Polygonal Curves Using the Uniform Metric. SCG 1996: 311-318 - [c2]Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan:
Approximating Shortest Paths on a Convex Polytope in Three Dimensions. SCG 1996: 329-338 - 1995
- [c1]Kasturi R. Varadarajan, Pankaj K. Agarwal:
Linear approximation of simple objects. CCCG 1995: 13-18
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
