Preyas Popat

929 total citations · 1 hit paper
5 papers, 535 citations indexed

About

Preyas Popat is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Preyas Popat has authored 5 papers receiving a total of 535 indexed citations (citations by other indexed papers that have themselves been cited), including 3 papers in Artificial Intelligence, 3 papers in Computational Theory and Mathematics and 2 papers in Computer Networks and Communications. Recurrent topics in Preyas Popat's work include Complexity and Algorithms in Graphs (3 papers), Optimization and Search Problems (2 papers) and Advanced Clustering Algorithms Research (2 papers). Preyas Popat is often cited by papers focused on Complexity and Algorithms in Graphs (3 papers), Optimization and Search Problems (2 papers) and Advanced Clustering Algorithms Research (2 papers). Preyas Popat collaborates with scholars based in United States, India and Canada. Preyas Popat's co-authors include Pierre Hansen, Amit Deshpande, Daniel Aloise, Nisheeth K. Vishnoi and Subhash Khot and has published in prestigious journals such as Machine Learning, SIAM Journal on Computing and PolyPublie (École Polytechnique de Montréal).

In The Last Decade

Preyas Popat

5 papers receiving 499 citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

NP-hardness of Euclidean sum-of-squares clustering

2009 510 citations Daniel Aloise, Amit Deshpande et al. Machine Learning profile →

Peers

Preyas Popat

AI

CVPR

SP

CNC

IS

Mary Inaba Japan

Sami Sieranoja Finland

Yogish Sabharwal India

Daniel Greene United States

Heiko Röglin Germany

Martin Pfeifle Germany

Guangquan Cheng China

Grzegorz Świrszcz United States

Mary Inaba Japan

Preyas Popat

193 ×0.7

AI

133 ×0.8

CVPR

101 ×0.8

SP

215 ×3.2

CNC

75 ×1.4

IS

Citations per year, relative to Preyas Popat Preyas Popat (= 1×) peers Mary Inaba

Countries citing papers authored by Preyas Popat

Since Specialization

Citations

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

Fields of papers citing papers by Preyas Popat

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Preyas Popat

This figure shows the co-authorship network connecting the top 25 collaborators of Preyas Popat. A scholar is included among the top collaborators of Preyas Popat 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 Preyas Popat. Preyas Popat is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

5 of 5 papers shown

1.

Khot, Subhash, Preyas Popat, & Nisheeth K. Vishnoi. (2014). Almost Polynomial Factor Hardness for Closest Vector Problem with Preprocessing. SIAM Journal on Computing. 43(3). 1184–1205. 2 indexed citations

2.

Popat, Preyas, et al.. (2012). On the Hardness of Pricing Loss-leaders. 735–749. 1 indexed citations

3.

Khot, Subhash, Preyas Popat, & Nisheeth K. Vishnoi. (2012). 2 ^{log1-ε n} hardness for the closest vector problem with preprocessing. 277–288. 1 indexed citations

4.

Aloise, Daniel, Amit Deshpande, Pierre Hansen, & Preyas Popat. (2009). NP-hardness of Euclidean sum-of-squares clustering. Machine Learning. 75(2). 245–248. 510 indexed citations breakdown →

5.

Aloise, Daniel, Amit Deshpande, Pierre Hansen, & Preyas Popat. (2008). NP-Hardness of Euclidean Sum-of-Squares Clustering. PolyPublie (École Polytechnique de Montréal). 1–10. 21 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