Kasturi Varadarajan

3.7k total citations
71 papers, 1.4k citations indexed

About

Kasturi Varadarajan is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Computer Vision and Pattern Recognition. According to data from OpenAlex, Kasturi Varadarajan has authored 71 papers receiving a total of 1.4k indexed citations (citations by other indexed papers that have themselves been cited), including 47 papers in Computer Graphics and Computer-Aided Design, 27 papers in Computational Theory and Mathematics and 19 papers in Computer Vision and Pattern Recognition. Recurrent topics in Kasturi Varadarajan's work include Computational Geometry and Mesh Generation (47 papers), Complexity and Algorithms in Graphs (24 papers) and Advanced Graph Theory Research (13 papers). Kasturi Varadarajan is often cited by papers focused on Computational Geometry and Mesh Generation (47 papers), Complexity and Algorithms in Graphs (24 papers) and Advanced Graph Theory Research (13 papers). Kasturi Varadarajan collaborates with scholars based in United States, Italy and Israel. Kasturi Varadarajan's co-authors include Pankaj K. Agarwal, Sariel Har-Peled, Meena Mahajan, Kenneth L. Clarkson, Prajakta Nimbhorkar, Bruno Codenotti, Sriram V. Pemmaraju, Pankaj Agarwal, Yinyu Ye and Amin Saberi and has published in prestigious journals such as SHILAP Revista de lepidopterología, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Kasturi Varadarajan

69 papers receiving 1.3k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Kasturi Varadarajan United States 22 572 413 336 290 290 71 1.4k
Sanjiv Kapoor United States 17 288 0.5× 327 0.8× 184 0.5× 158 0.5× 85 0.3× 68 917
Giuseppe Liotta Italy 20 741 1.3× 436 1.1× 648 1.9× 188 0.6× 162 0.6× 166 1.3k
Yair Bartal Israel 24 182 0.3× 728 1.8× 126 0.4× 94 0.3× 298 1.0× 74 1.9k
Kenneth J. Supowit United States 17 503 0.9× 520 1.3× 278 0.8× 184 0.6× 223 0.8× 33 1.6k
Fabrizio Luccio Italy 19 210 0.4× 580 1.4× 201 0.6× 379 1.3× 586 2.0× 102 1.7k
Chia-Hoang Lee Taiwan 18 148 0.3× 118 0.3× 490 1.5× 218 0.8× 682 2.4× 53 1.5k
Donald W. Hearn United States 22 194 0.3× 399 1.0× 87 0.3× 73 0.3× 76 0.3× 48 1.7k
Satoru Fujishige Japan 21 206 0.4× 1.1k 2.7× 94 0.3× 51 0.2× 418 1.4× 131 1.9k
Gruiă Cälinescu United States 22 274 0.5× 652 1.6× 121 0.4× 63 0.2× 256 0.9× 59 2.3k
Reuven Bar-Yehuda Israel 23 294 0.5× 757 1.8× 109 0.3× 53 0.2× 220 0.8× 58 1.9k

Countries citing papers authored by Kasturi Varadarajan

Since Specialization
Citations

This map shows the geographic impact of Kasturi Varadarajan's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Kasturi Varadarajan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Kasturi Varadarajan more than expected).

Fields of papers citing papers by Kasturi Varadarajan

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Kasturi Varadarajan. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Kasturi Varadarajan. The network helps show where Kasturi Varadarajan may publish in the future.

Co-authorship network of co-authors of Kasturi Varadarajan

This figure shows the co-authorship network connecting the top 25 collaborators of Kasturi Varadarajan. A scholar is included among the top collaborators of Kasturi Varadarajan based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Kasturi Varadarajan. Kasturi Varadarajan is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Suri, Subhash, et al.. (2020). Improved approximation bounds for the minimum constraint removal problem. Computational Geometry. 90. 101650–101650.
2.
Agarwal, Pankaj K., et al.. (2017). Faster Algorithms for the Geometric Transportation Problem. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3 indexed citations
3.
Varadarajan, Kasturi, et al.. (2016). Approximate Clustering via Metric Partitioning. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 64. 13. 4 indexed citations
4.
Varadarajan, Kasturi, et al.. (2016). On Variants of k-means Clustering. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3 indexed citations
5.
Varadarajan, Kasturi, et al.. (2013). Guarding terrains via local search. SHILAP Revista de lepidopterología. 11 indexed citations
6.
Pirwani, Imran A., et al.. (2008). On clustering to minimize the sum of radii. Symposium on Discrete Algorithms. 819–825. 7 indexed citations
7.
Kulkarni, Raghav, Meena Mahajan, & Kasturi Varadarajan. (2008). Some perfect matchings and perfect half-integral matchings in NC ∗. 2008. 5 indexed citations
8.
Varadarajan, Kasturi, et al.. (2007). Efficient subspace approximation algorithms. Symposium on Discrete Algorithms. 532–540. 19 indexed citations
9.
Codenotti, Bruno, Amin Saberi, Kasturi Varadarajan, & Yinyu Ye. (2006). Leontief economies encode nonzero sum two-player games. Symposium on Discrete Algorithms. 659–667. 39 indexed citations
10.
Jain, Kamal & Kasturi Varadarajan. (2006). Equilibria for economies with production: constant-returns technologies and production planning constraints. Symposium on Discrete Algorithms. 688–697. 9 indexed citations
11.
Codenotti, Bruno, Sriram V. Pemmaraju, & Kasturi Varadarajan. (2005). On the polynomial time computation of equilibria for certain exchange economies. Symposium on Discrete Algorithms. 72–81. 35 indexed citations
12.
Clarkson, Kenneth L. & Kasturi Varadarajan. (2005). Improved approximation algorithms for geometric set cover. 135–141. 21 indexed citations
13.
Pemmaraju, Sriram V., Rajiv Raman, & Kasturi Varadarajan. (2004). Buffer minimization using max-coloring. Symposium on Discrete Algorithms. 562–571. 31 indexed citations
14.
Varadarajan, Kasturi & Ganesh Venkataraman. (2004). Graph decomposition and a greedy algorithm for edge-disjoint paths. Symposium on Discrete Algorithms. 379–380. 27 indexed citations
15.
Katz, Matthew J. & Kasturi Varadarajan. (2001). A tight bound on the number of geometric permutations of convex fat objects in R d .. 249–251. 1 indexed citations
16.
Mahajan, Meena & Kasturi Varadarajan. (2000). A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract). 351–357. 13 indexed citations
17.
Varadarajan, Kasturi & Pankaj K. Agarwal. (1999). Approximation algorithms for bipartite and non-bipartite matching in the plane. Symposium on Discrete Algorithms. 805–814. 25 indexed citations
18.
Agarwal, Pankaj, Lars Arge, T. M. Murali, Kasturi Varadarajan, & Jeffrey Scott Vitter. (1998). I/O-Efficient Algorithms for Contour-line Extraction and Planar Graph Blocking (Extended Abstract).. Symposium on Discrete Algorithms. 117–126. 1 indexed citations
19.
Agarwal, Pankaj K., Lars Arge, T. M. Murali, Kasturi Varadarajan, & Jeffrey Scott Vitter. (1998). I/O-efficient algorithms for contour-line extraction and planar graph blocking. Symposium on Discrete Algorithms. 117–126. 21 indexed citations
20.
Varadarajan, Kasturi & Pankaj K. Agarwal. (1995). Linear approximation of simple objects.. Canadian Conference on Computational Geometry. 13–18. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026