Kasturi Varadarajan - Concepedia

Author

Kasturi Varadarajan

Also Known As

Har-Peled, Sariel, Inamdar, Tanmay, K. R. Varadarajan, K.R. Varadarajan, Kasturi R. Varadarajan, Kasturi Varadarajan, Leniowski, Dariusz, Varadarajan, Kasturi, Varadarajan, Kasturi R.

116

Publications

3.7K

Citations

H-Index

Concepts

All Affiliations

University of Iowa Duke University Stanford University University of Illinois Urbana-Champaign Toyota Technological Institute at Chicago

About

Kasturi Varadarajan is an author at University of Iowa specializing in engineering, combinatorial optimization, and computational geometry.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	25	42	2.1K
2	Natural Sciences	16	19	912
3	Business	10	10	518
4	Computer Engineering	3	3	204
5	Education	1	1	19

Kasturi Varadarajan

Publications

2.6K

Citations

H-Index

Page 1

	Year	Citations
Approximating extent measures of points Pankaj K. Agarwal, Sariel Har-Peled, Kasturi Varadarajan Journal of the ACM EngineeringGeometryStatistical Shape AnalysisShape AnalysisFunctional Analysis	2004	353
The planar<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-means problem is NP-hard Meena Mahajan, Prajakta Nimbhorkar, Kasturi Varadarajan Theoretical Computer Science	2010	274
Improved Approximation Algorithms for Geometric Set Cover Kenneth L. Clarkson, Kasturi Varadarajan Discrete & Computational Geometry EngineeringGeometric AlgorithmConvex HullRange SearchingCombinatorial Optimization	2006	191
Market equilibrium via the excess demand function Bruno Codenotti, Benton McCune, Kasturi Varadarajan Mathematical ProgrammingEngineeringMarket EquilibriumMarket Equilibrium ComputationPolynomial Time	2005	102
Weighted geometric set cover via quasi-uniform sampling Kasturi Varadarajan Mathematical ProgrammingWeighted GeometricEngineeringGeometric AlgorithmRandomized Algorithm	2010	97
Efficient Algorithms for Approximating Polygonal Chains Pankaj Agarwal, Kasturi Varadarajan Discrete & Computational Geometry Numerical AnalysisGeometric ModelingEngineeringGeometric AlgorithmApproximating Polygonal Chains	2000	91
A divide-and-conquer algorithm for min-cost perfect matching in the plane Kasturi Varadarajan Mathematical ProgrammingEngineeringAnalysis Of AlgorithmComputational ComplexityRange Searching	2002	77
Projective clustering in high dimensions using core-sets Sariel Har-Peled, Kasturi Varadarajan Cluster ComputingComputational Complexity TheoryEngineeringComputational ComplexityConvex Hull	2002	76
Leontief economies encode nonzero sum two-player games Bruno Codenotti, Amin Saberi, Kasturi Varadarajan, Symposium on Discrete Algorithms Mathematical ProgrammingEngineeringLeontief EconomiesGame TheoryComputational Game Theory	2006	73
Approximating shortest paths on a convex polytope in three dimensions Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Journal of the ACM Mathematical ProgrammingEngineeringComputational ComplexityConvex HullConvex Polytope	1997	72

Page 1