Kasturi R. Varadarajan

According to our database1, Kasturi R. Varadarajan authored at least 81 papers between 1996 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Fault Tolerant Clustering with Outliers.
Proceedings of the Approximation and Online Algorithms - 17th International Workshop, 2019

A Constant Approximation for Colorful k-Center.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
On the Partition Set Cover Problem.
CoRR, 2018

Capacitated Covering Problems in Geometric Spaces.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

On Partial Covering For Geometric Set Systems.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

Improved Approximation Bounds for the Minimum Constraint Removal Problem.
Proceedings of the Approximation, 2018

2017
Epsilon-approximations and epsilon-nets.
CoRR, 2017

A Unified Framework for Capacitated Covering Problems in Metric and Geometric Spaces.
CoRR, 2017

Faster Algorithms for the Geometric Transportation Problem.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016
On isolating points using unit disks.
JoCG, 2016

Improved Approximation for Metric Multi-Cover.
CoRR, 2016

Approximate Clustering via Metric Partitioning.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

On Variants of k-means Clustering.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
A constant-factor approximation for multi-covering with disks.
JoCG, 2015

A Constant Factor Approximation for Orthogonal Order Preserving Layout Adjustment.
CoRR, 2015

On the Approximability of Orthogonal Order Preserving Layout Adjustment.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014
Guarding Terrains via Local Search.
JoCG, 2014

Computing Regions Decomposable into m Stars.
Proceedings of the Algorithms - ESA 2014, 2014

2013
Diverse near neighbor problem.
Proceedings of the Symposuim on Computational Geometry 2013, 2013

2012
The planar k-means problem is NP-hard.
Theor. Comput. Sci., 2012

On Clustering to Minimize the Sum of Radii.
SIAM J. Comput., 2012

Efficient Subspace Approximation Algorithms.
Discrete & Computational Geometry, 2012

A near-linear algorithm for projective clustering integer points.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

On the Sensitivity of Shape Fitting Problems.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2011
Max-coloring and online coloring with bandwidths on interval graphs.
ACM Trans. Algorithms, 2011

Optimally Decomposing Coverings with Translates of a Convex Polygon.
Discrete & Computational Geometry, 2011

On Isolating Points Using Disks.
Proceedings of the Algorithms - ESA 2011, 2011

2010
On Metric Clustering to Minimize the Sum of Radii.
Algorithmica, 2010

Weighted geometric set cover via quasi-uniform sampling.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

2009
Algorithms and Hardness for Subspace Approximation
CoRR, 2009

Quasi-Polynomial Time Approximation Schemes for Target Tracking
CoRR, 2009

Decomposing Coverings and the Planar Sensor Cover Problem.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

Epsilon nets and union complexity.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

Approximation Algorithms for Domatic Partitions of Unit Disk Graphs.
Proceedings of the Approximation, 2009

An Approximation Scheme for Terrain Guarding.
Proceedings of the Approximation, 2009

2008
The complexity of equilibria: Hardness results for economies via a correspondence with games.
Theor. Comput. Sci., 2008

An experimental study of different approaches to solve the market equilibrium problem.
ACM Journal of Experimental Algorithmics, 2008

Some perfect matchings and perfect half-integral matchings in NC.
Chicago J. Theor. Comput. Sci., 2008

Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets.
Algorithmica, 2008

2007
Approximating the Radii of Point Sets.
SIAM J. Comput., 2007

Improved Approximation Algorithms for Geometric Set Cover.
Discrete & Computational Geometry, 2007

Sampling-based dimension reduction for subspace approximation.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

2006
Equilibria for economies with production: constant-returns technologies and production planning constraints.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Computing Equilibrium Prices in Exchange Economies with Tax Distortions.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
Leontief Economies Encode Nonzero Sum Two-Player Games
Electronic Colloquium on Computational Complexity (ECCC), 2005

Approximation Algorithms for a k-Line Center.
Algorithmica, 2005

Market equilibrium via the excess demand function.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

On the polynomial time computation of equilibria for certain exchange economies.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

No Coreset, No Cry: II.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

Market Equilibrium for CES Exchange Economies: Existence, Multiplicity, and Computation.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

Computing Equilibrium Prices: Does Theory Meet Practice?.
Proceedings of the Algorithms, 2005

2004
The computation of market equilibria.
SIGACT News, 2004

Approximating extent measures of points.
J. ACM, 2004

High-Dimensional Shape Fitting in Linear Time.
Discrete & Computational Geometry, 2004

Graph decomposition and a greedy algorithm for edge-disjoint paths.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Buffer minimization using max-coloring.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Efficient Computation of Equilibrium Prices for Markets with Leontief Utilities.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Practical methods for shape fitting and kinetic data structures using core sets.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

A near-linear constant-factor approximation for euclidean bipartite matching?
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

2003
Facility Location on a Polyhedral Surface.
Discrete & Computational Geometry, 2003

A (1+)-approximation algorithm for 2-line-center.
Comput. Geom., 2003

On shortest paths in line arrangements.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002
On Approximating the Radii of Point Sets in High Dimensions.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

Projective clustering in high dimensions using core-sets.
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, 2002

2001
A Tight Bound on the Number of Geometric Permutations of Convex Fat Objects in Rd.
Discrete & Computational Geometry, 2001

Reductions among high dimensional proximity problems.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Approximate Shape Fitting via Linearization.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

A tight bound on the number of geometric permutations of convex fat objects in Rd.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

2000
Approximating Shortest Paths on a Nonconvex Polyhedron.
SIAM J. Comput., 2000

Efficient Algorithms for Approximating Polygonal Chains.
Discrete & Computational Geometry, 2000

A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract).
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1999
Approximation Algorithms for Bipartite and Non-Bipartite Matching in the Plane.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998
I/O-Efficient Algorithms for Contour-line Extraction and Planar Graph Blocking (Extended Abstract).
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Facility Location on Terrains.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

A Divide-and-Conquer Algorithm for Min-Cost Perfect Matching in the Plane.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997
Approximating shortest paths on a convex polytope in three dimensions.
J. ACM, 1997

Linear Approximation of Simple Objects.
Inf. Process. Lett., 1997

Approximating Shortest Paths on an Nonconvex Polyhedron.
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996
Approximating Monotone Polygonal Curves Using the Uniform Metric.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

Approximating Shortest Paths on a Convex Polytope in Three Dimensions.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996


  Loading...