C. Seshadhri

88 papers receiving 1.6k citations

Peers

C. Seshadhri
Comparison fields: 5 of 77
  • Statistical and Nonlinear Physics 825
  • Artificial Intelligence 823
  • Computational Theory and Mathematics 474
  • Computer Vision and Pattern Recognition 448
  • Computer Networks and Communications 433
Replace Atish Das Sarma with:
Atish Das Sarma United States
Yiping Ke Singapore
Ziv Bar-Yossef Israel
Andrej Krevl Slovenia
Massimo Santini Italy
Colin Cooper United Kingdom
Flavio Chierichetti United States
Srikanta Tirthapura United States
Kamesh Madduri United States
Tamás Sarlós United States
C. Seshadhri relative to Atish Das Sarma United States Atish Das Sarma's profile →
Citations per field
00.5×1.5×2.4×
Atish Das Sarma · 1×
Citations per year

Countries citing papers authored by C. Seshadhri

Since Specialization
Citations

This map shows the geographic impact of C. Seshadhri'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 C. Seshadhri with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites C. Seshadhri more than expected).

Fields of papers citing papers by C. Seshadhri

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by C. Seshadhri. 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 C. Seshadhri. The network helps show where C. Seshadhri may publish in the future.

Co-authorship network of co-authors of C. Seshadhri

This figure shows the co-authorship network connecting the top 25 collaborators of C. Seshadhri. A scholar is included among the top collaborators of C. Seshadhri 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 C. Seshadhri. C. Seshadhri 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
#WorkIndexed citations
1 0
2 0
3
1
4
Finding forbidden minors in sublinear time: a O(n 1/2+o(1) )-query one-sided tester for minor closed properties on bounded degree graphs.
0
5
Parallel Local Algorithms for Core, Truss, and Nucleus Decompositions.
8
6 5
7 2
8
12
9
The importance of directed triangles with reciprocity: patterns and algorithms.
4
10
Fast triangle counting through wedge sampling.
13
11 136
12
From the Birthday Paradox to a Practical Sublinear Space Streaming Algorithm for Triangle Counting
2
13
Combinatorial Approximation Algorithms for MAXCUT using Random Walks.
6
14
A Hitchhiker's Guide to Choosing Parameters of Stochastic Kronecker Graphs
2
15
An In-Depth Study of Stochastic Kronecker Graphs.
1
16 12
17
Parallel monotonicity reconstruction
7
18
Testing Expansion in Bounded Degree Graphs
10
19 8
20
RAM Simulation of BGS Model of Abstract State Machines.
1

About C. Seshadhri

C. Seshadhri is a scholar working on Computational Theory and Mathematics, Statistical and Nonlinear Physics and Computer Graphics and Computer-Aided Design, having authored 91 papers that have together received 1.6k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (35 papers), Complex Network Analysis Techniques (33 papers) and Machine Learning and Algorithms (22 papers). The work is most often cited by research in Statistical and Nonlinear Physics (825 citations), Computational Theory and Mathematics (474 citations) and Artificial Intelligence (823 citations). C. Seshadhri has collaborated with scholars based in United States, Israel and United Kingdom. Frequent co-authors include Tamara G. Kolda, Ali Pınar, Ali Pınar, Madhav Jha, David F. Gleich, Ali Pinar, Todd Plantenga, Nitin Saxena, Ahmet Erdem Sarıyüce and Elad Hazan. Their work appears in journals such as Proceedings of the National Academy of Sciences, Physical Review Letters and Journal of the ACM.

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