K. Varadarajan

PROFILE

Homepage
No homepage is listed.
ORCID
No ORCID is listed.
Affiliations
No affiliations are listed.
Aliases
K. Varadarajan, Kasturi Varadarajan, Kasturi R. Varadarajan
Publication record
107 papers · 4,642 citations · H-index 38

PAPERS

Relational Approximations for Subspace Primitives
20250 citationsauthor #2
A third of adults as young as early forties may be at nutritional risk: Findings from global handgrip strength study using a digital tool
20250 citationsauthor #2
Geometric Covering via Extraction Theorem
20241 citationsauthor #5
Algorithms for covering multiple submodular constraints and applications
202213 citationsauthor #4
Non-Uniform k-Center and Greedy Clustering
20212 citationsauthor #2
Capacitated Sum-Of-Radii Clustering: An FPT Approximation
202017 citationsauthor #2
Improved Approximation Bounds for the Minimum Constraint Removal Problem
202010 citationsauthor #4
Fault-Tolerant Covering Problems in Metric Spaces
20207 citationsauthor #3
Faster Algorithms for the Geometric Transportation Problem
201929 citationsauthor #4
Fault Tolerant Clustering with Outliers
20198 citationsauthor #2
A Constant Approximation for Colorful k-Center
201944 citationsauthor #4
Maximum Flows and Minimum Cuts
20180 citationsauthor #1
On the Partition Set Cover Problem
201810 citationsauthor #2
On Partial Covering For Geometric Set Systems
201718 citationsauthor #2
Epsilon-approximations and epsilon-nets
201725 citationsauthor #2
Capacitated Covering Problems in Geometric Spaces
20176 citationsauthor #4
Fe b 20 17 47 EPSILON-APPROXIMATIONS & EPSILON-NETS
20170 citationsauthor #2
Epsilon-Approximations & Epsilon-Nets
201738 citationsauthor #2
A Unified Framework for Capacitated Covering Problems in Metric and Geometric Spaces
20171 citationsauthor #4
2 01 7 47 EPSILON-APPROXIMATIONS & EPSILON-NETS
20170 citationsauthor #2
On Metric Multi-Covering Problems
20164 citationsauthor #3
47 EPSILON-APPROXIMATIONS & EPSILON-NETS
20160 citationsauthor #2
Lecture 9 & 10 : Local Search Algorithm for k-median Problem ( contd . ) , k-means Problem
20160 citationsauthor #1
Improved Approximation for Metric Multi-Cover
20162 citationsauthor #3
On isolating points using unit disks
20165 citationsauthor #4
A Constant Factor Approximation for Orthogonal Order Preserving Layout Adjustment
20150 citationsauthor #3
On the Approximability of Orthogonal Order Preserving Layout Adjustment
20150 citationsauthor #3
On Variants of k-means Clustering
201531 citationsauthor #2
Approximate Clustering via Metric Partitioning
201512 citationsauthor #2
Guarding Terrains via Local Search
201438 citationsauthor #4
Computing Regions Decomposable into m Stars
20141 citationsauthor #2
Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation
20146 citationsauthor #3
Diverse near neighbor problem
201342 citationsauthor #5
Combinatorial Optimization Problems in Geometric Settings
20130 citationsauthor #1
A constant-factor approximation for multi-covering with disks
201320 citationsauthor #2
On the Sensitivity of Shape Fitting Problems
201246 citationsauthor #1
A near-linear algorithm for projective clustering integer points
201233 citationsauthor #1
On Isolating Points Using Disks
201117 citationsauthor #3
Session details: Session 9B
20110 citationsauthor #1
Optimally Decomposing Coverings with Translates of a Convex Polygon
201121 citationsauthor #2
Max-coloring and online coloring with bandwidths on interval graphs
201113 citationsauthor #3
Clusters and covers: geometric set cover algorithms
20104 citationsauthor #1
Weighted geometric set cover via quasi-uniform sampling
2010134 citationsauthor #1
Approximation Algorithms for Domatic Partitions ∗
20092 citationsauthor #3
The Planar k-means Problem is NP-hard I
2009690 citationsauthor #3
Epsilon nets and union complexity
20098 citationsauthor #1
Approximation Algorithms for Domatic Partitions of Unit Disk Graphs
200930 citationsauthor #3
Epsilon Nets and Union Complexity
200952 citationsauthor #1
An Approximation Scheme for Terrain Guarding
200941 citationsauthor #4
Quasi-Polynomial Time Approximation Schemes for Target Tracking
20091 citationsauthor #4
Decomposing Coverings and the Planar Sensor Cover Problem
200950 citationsauthor #2
The complexity of equilibria: Hardness results for economies via a correspondence with games
200824 citationsauthor #3
Some perfect matchings and perfect half-integral matchings in NC
200816 citationsauthor #3
On Metric Clustering to Minimize the Sum of Radii
200845 citationsauthor #5
On clustering to minimize the sum of radii
200850 citationsauthor #5
An experimental study of different approaches to solve the market equilibrium problem
200810 citationsauthor #5
Algorithmic Game Theory: Computation of Market Equilibria by Convex Programming
200739 citationsauthor #2
Approximating the Radii of Point Sets
200720 citationsauthor #1
Efficient Subspace Approximation Algorithms
200756 citationsauthor #2
Geometric Approximation via Coresets
2007434 citationsauthor #3
Sampling-based dimension reduction for subspace approximation
200761 citationsauthor #2
Computing Equilibrium Prices in Exchange Economies with Tax Distortions
20062 citationsauthor #3
Fuzzy control of stochastic global optimization algorithms and very fast simulated rean- nealing
20062 citationsauthor #3
Leontief economies encode nonzero sum two-player games
200693 citationsauthor #3
Max-coloring and Online Coloring with Bandwidths on Interval Graphs
20060 citationsauthor #3
Equilibria for economies with production: constant-returns technologies and production planning constraints
200624 citationsauthor #2
Improved Approximation Algorithms for Geometric Set Cover
2005272 citationsauthor #2
Computing Equilibrium Prices: Does Theory Meet Practice?
20055 citationsauthor #4
On the polynomial time computation of equilibria for certain exchange economies
200579 citationsauthor #3
Market Equilibrium in Exchange Economies with Some Families of Concave Utility Functions
20055 citationsauthor #2
No Coreset, No Cry: II
200517 citationsauthor #2
Approximation Algorithms for a k-Line Center
200514 citationsauthor #3
Approximating the Radii of Point Sets ∗
20050 citationsauthor #1
Market Equilibrium for CES Exchange Economies: Existence, Multiplicity, and Computation
200538 citationsauthor #4
Market equilibrium via the excess demand function
200596 citationsauthor #3
The computation of market equilibria
200440 citationsauthor #3
Graph decomposition and a greedy algorithm for edge-disjoint paths
200457 citationsauthor #1
A near-linear constant-factor approximation for euclidean bipartite matching?
200460 citationsauthor #2
A note on the Computation of Equilibria in Exchange Markets with Gross Substitutability
20041 citationsauthor #3
Buffer minimization using max-coloring
200493 citationsauthor #3
Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets
200464 citationsauthor #4
Algorithms Column: The Computation of Market Equilibria
200414 citationsauthor #3
Approximating extent measures of points
2004385 citationsauthor #3
Efficient Computation of Equilibrium Prices for Markets with Leontief Utilities
200474 citationsauthor #2
On shortest paths in line arrangements
20030 citationsauthor #2
Facility Location on a Polyhedral Surface
20038 citationsauthor #4
High-Dimensional Shape Fitting in Linear Time
200345 citationsauthor #2
A (1+)-approximation algorithm for 2-line-center
200317 citationsauthor #3
Projective clustering in high dimensions using core-sets
200286 citationsauthor #2
On approximating the radii of point sets in high dimensions
200211 citationsauthor #1
Approximation Algorithms for k-Line Center
200266 citationsauthor #3
A Tight Bound on the Number of Geometric Permutations of Convex Fat Objects in Rd
200122 citationsauthor #2
Reductions among high dimensional proximity problems
200179 citationsauthor #3
Approximate shape fitting via linearization
200131 citationsauthor #2
A tight bound on the number of geometric permutations of convex fat objects in {\huge $\mathbf{\reals^d}$}
20014 citationsauthor #2
Efficient Algorithms for Approximating Polygonal Chains
200099 citationsauthor #2
A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract)
200051 citationsauthor #2
Efficient Hidden-Surface Removal in Theory and Practice
19997 citationsauthor #14
Approximation algorithms for bipartite and non-bipartite matching in the plane
199961 citationsauthor #1
A divide-and-conquer algorithm for min-cost perfect matching in the plane
199875 citationsauthor #1

TIMELINE

1995 0 citations

1996 83 citations

1997 120 citations

1998 147 citations

1999 68 citations

2000 150 citations

2001 136 citations

2002 163 citations

2003 70 citations

2004 788 citations

2005 526 citations

2006 121 citations

2007 610 citations

2008 145 citations

2009 874 citations

2010 138 citations

2011 51 citations

2012 79 citations

2013 62 citations

2014 45 citations

2015 43 citations

2016 11 citations

2017 88 citations

2018 10 citations

2019 81 citations

2020 34 citations

2021 2 citations

2022 13 citations

2024 1 citations

2025 0 citations

K. Varadarajan

PROFILE

PAPERS

TIMELINE

COAUTHOR MAP

CONCEPT FOOTPRINT