Kasturi Varadarajan
Kasturi Varadarajan
Professor of Computer Science, University of Iowa
Verified email at uiowa.edu
Title
Cited by
Cited by
Year
The planar k-means problem is NP-hard
M Mahajan, P Nimbhorkar, K Varadarajan
International Workshop on Algorithms and Computation, 274-285, 2009
4332009
Geometric approximation via coresets
PK Agarwal, S Har-Peled, KR Varadarajan
Combinatorial and computational geometry 52, 1-30, 2005
3972005
Approximating extent measures of points
PK Agarwal, S Har-Peled, KR Varadarajan
Journal of the ACM (JACM) 51 (4), 606-635, 2004
3422004
Improved approximation algorithms for geometric set cover
KL Clarkson, K Varadarajan
Discrete & Computational Geometry 37 (1), 43-58, 2007
2502007
The planar k-means problem is NP-hard
M Mahajan, P Nimbhorkar, K Varadarajan
Theoretical Computer Science 442, 13-21, 2012
1952012
Efficient algorithms for approximating polygonal chains
PK Agarwal, KR Varadarajan
Discrete & Computational Geometry 23 (2), 273-291, 2000
1162000
Approximating shortest paths on a convex polytope in three dimensions
PK Agarwal, S Har-Peled, M Sharir, KR Varadarajan
Journal of the ACM (JACM) 44 (4), 567-584, 1997
1041997
Buffer minimization using max-coloring.
SV Pemmaraju, R Raman, KR Varadarajan
SODA 4, 562-571, 2004
1022004
Weighted geometric set cover via quasi-uniform sampling
K Varadarajan
Proceedings of the forty-second ACM symposium on Theory of computing, 641-648, 2010
972010
Projective clustering in high dimensions using core-sets
S Har-Peled, K Varadarajan
Proceedings of the eighteenth annual symposium on Computational geometry …, 2002
932002
Market equilibrium via the excess demand function
B Codenotti, B McCune, K Varadarajan
Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005
902005
Reductions among high dimensional proximity problems
A Goel, P Indyk, KR Varadarajan
SODA 1, 769-778, 2001
882001
Leontief economies encode nonzero sum two-player games
B Codenotti, A Saberi, K Varadarajan, Y Ye
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006
782006
Approximating shortest paths on a nonconvex polyhedron
KR Varadarajan, PK Agarwal
SIAM Journal on Computing 30 (4), 1321-1340, 2000
782000
I/O-efficient algorithms for contour-line extraction and planar graph blocking
PK Agarwal, L Arge, TM Murali, KR Varadarajan, JS Vitter
SODA, 117-126, 1998
781998
A divide-and-conquer algorithm for min-cost perfect matching in the plane
KR Varadarajan
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat …, 1998
771998
Efficient computation of equilibrium prices for markets with Leontief utilities
B Codenotti, K Varadarajan
International Colloquium on Automata, Languages, and Programming, 371-382, 2004
762004
On the polynomial time computation of equilibria for certain exchange economies
B Codenotti, SV Pemmaraju, KR Varadarajan
SODA 5, 72-81, 2005
742005
Practical methods for shape fitting and kinetic data structures using coresets
H Yu, PK Agarwal, R Poreddy, KR Varadarajan
Algorithmica 52 (3), 378-402, 2008
662008
Graph decomposition and a greedy algorithm for edge-disjoint paths
K Varadarajan, G Venkataraman
SODA, 379-380, 2004
572004
The system can't perform the operation now. Try again later.
Articles 1–20