Aravindan Vijayaraghavan
- Computational Theory and Mathematics top 5%
- Artificial Intelligence top 10%
- Computer Networks and Communications top 10%
- Signal Processing
- Computational Mathematics top 5%
- Co-authors
- Aditya BhaskaraMoses CharikarEden ChlamtáčUriel FeigeYury MakarychevAnkur MoitraKonstantin MakarychevYuan Zhou
- Topics
- Complexity and Algorithms in Graphs (14 papers)Optimization and Search Problems (8 papers)Advanced Graph Theory Research (8 papers)
- Cited by
- Computational MathematicsComputational Theory and MathematicsComputer Graphics and Computer-Aided Design
- Partner nations
- United StatesCanadaIsrael
In The Last Decade
Aravindan Vijayaraghavan
25 papers receiving 322 citations
Peers
Comparison fields: 5 of 50
- Computational Theory and Mathematics 182
- Artificial Intelligence 140
- Computer Networks and Communications 82
- Signal Processing 36
- Computational Mathematics 35
Countries citing papers authored by Aravindan Vijayaraghavan
This map shows the geographic impact of Aravindan Vijayaraghavan'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 Aravindan Vijayaraghavan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Aravindan Vijayaraghavan more than expected).
Fields of papers citing papers by Aravindan Vijayaraghavan
This network shows the impact of papers produced by Aravindan Vijayaraghavan. 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 Aravindan Vijayaraghavan. The network helps show where Aravindan Vijayaraghavan may publish in the future.
Co-authorship network of co-authors of Aravindan Vijayaraghavan
This figure shows the co-authorship network connecting the top 25 collaborators of Aravindan Vijayaraghavan. A scholar is included among the top collaborators of Aravindan Vijayaraghavan 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 Aravindan Vijayaraghavan. Aravindan Vijayaraghavan is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 0 | |
| 3 | 1 | |
| 4 | 2 | |
| 5 | 3 | |
| 6 | Clustering stable instances of euclidean k-means | 6 |
| 7 | 3 | |
| 8 | 15 | |
| 9 | 8 | |
| 10 | Open Problem: Tensor Decompositions: Algorithms up to the Uniqueness Threshold? | 1 |
| 11 | Algorithms for Semi-random Correlation Clustering. | 1 |
| 12 | 41 | |
| 13 | 13 | |
| 14 | Bilu-Linial Stable Instances of Max Cut | 1 |
| 15 | 6 | |
| 16 | 34 | |
| 17 | 15 | |
| 18 | Beyond worst-case analysis in approximation algorithms | 1 |
| 19 | 12 | |
| 20 | Computing the Matrix p-norm | 1 |
About Aravindan Vijayaraghavan
Aravindan Vijayaraghavan is a scholar working on Computational Mathematics, Computer Graphics and Computer-Aided Design and Computational Theory and Mathematics, having authored 28 papers that have together received 340 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (14 papers), Optimization and Search Problems (8 papers) and Advanced Graph Theory Research (8 papers). The work is most often cited by research in Computational Mathematics (35 citations), Computational Theory and Mathematics (182 citations) and Computer Graphics and Computer-Aided Design (34 citations). Aravindan Vijayaraghavan has collaborated with scholars based in United States, Canada and Israel. Frequent co-authors include Aditya Bhaskara, Moses Charikar, Eden Chlamtáč, Uriel Feige, Yury Makarychev, Ankur Moitra, Konstantin Makarychev, Yuan Zhou, Venkatesan Guruswami and Pranjal Awasthi. Their work appears in journals such as Mathematical Programming, Physical review. A and ACM Transactions on Algorithms.
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.