Robert Krauthgamer

4.5k total citations
110 papers, 2.0k citations indexed

About

Robert Krauthgamer is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Robert Krauthgamer has authored 110 papers receiving a total of 2.0k indexed citations (citations by other indexed papers that have themselves been cited), including 81 papers in Computational Theory and Mathematics, 39 papers in Computer Networks and Communications and 31 papers in Artificial Intelligence. Recurrent topics in Robert Krauthgamer's work include Complexity and Algorithms in Graphs (71 papers), Advanced Graph Theory Research (44 papers) and Optimization and Search Problems (26 papers). Robert Krauthgamer is often cited by papers focused on Complexity and Algorithms in Graphs (71 papers), Advanced Graph Theory Research (44 papers) and Optimization and Search Problems (26 papers). Robert Krauthgamer collaborates with scholars based in Israel, United States and China. Robert Krauthgamer's co-authors include Uriel Feige, Yuval Rabani, Eran Halperin, Anupam Gupta, Alexandr Andoni, James R. Lee, Guy Kortsarz, Joseph Naor, D. Sivakumar and Shuchi Chawla and has published in prestigious journals such as Bioinformatics, IEEE Transactions on Information Theory and Journal of the ACM.

In The Last Decade

Robert Krauthgamer

106 papers receiving 1.8k citations

Peers

Robert Krauthgamer
Howard Karloff United States
Leonid Khachiyan United States
Tomás Feder United States
Jan Van Leeuwen Netherlands
Luca Trevisan United States
Robert Krauthgamer
Citations per year, relative to Robert Krauthgamer Robert Krauthgamer (= 1×) peers Yuval Rabani

Countries citing papers authored by Robert Krauthgamer

Since Specialization
Citations

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

Fields of papers citing papers by Robert Krauthgamer

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Robert Krauthgamer

This figure shows the co-authorship network connecting the top 25 collaborators of Robert Krauthgamer. A scholar is included among the top collaborators of Robert Krauthgamer 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 Robert Krauthgamer. Robert Krauthgamer 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.
Huang, Lingxiao, Shaofeng H.-C. Jiang, Robert Krauthgamer, & Dongsheng Yue. (2025). Near-Optimal Dimension Reduction for Facility Location. 665–676. 1 indexed citations
2.
Czumaj, Artur, et al.. (2024). Streaming Algorithms for Geometric Steiner Forest. ACM Transactions on Algorithms. 20(4). 1–38.
3.
Jiang, Shaofeng H.-C., et al.. (2024). Coresets for kernel clustering. Machine Learning. 113(8). 5891–5906. 1 indexed citations
4.
Abboud, Amir, et al.. (2021). . Theory of Computing. 17(1). 1–27. 2 indexed citations
5.
Abboud, Amir, Loukas Georgiadis, Giuseppe F. Italiano, et al.. (2019). Faster algorithms for all-pairs bounded min-cuts. IRIS - Institutional Research Information System (Libera Università Internazionale degli Studi Sociali Guido Carli). 9 indexed citations
6.
Krauthgamer, Robert, et al.. (2019). Flow-cut gaps and face covers in planar graphs. arXiv (Cornell University). 525–534. 2 indexed citations
7.
Krauthgamer, Robert, et al.. (2017). The Set Cover Conjecture and Subgraph Isomorphism with a Tree Pattern..
8.
Krauthgamer, Robert, Joseph Naor, Roy Schwartz, & Kunal Talwar. (2014). Non-uniform graph partitioning. Symposium on Discrete Algorithms. 1229–1243. 3 indexed citations
9.
Krauthgamer, Robert, Boaz Nadler, & Dan Vilenchik. (2013). Do Semidefinite Relaxations Really Solve Sparse PCA. arXiv (Cornell University). 8 indexed citations
10.
Krauthgamer, Robert & Tim Roughgarden. (2011). . Theory of Computing. 7(1). 49–74. 5 indexed citations
11.
Andoni, Alexandr & Robert Krauthgamer. (2010). The Computational Hardness of Estimating Edit Distance. SIAM Journal on Control and Optimization. 7 indexed citations
12.
Hazan, Elad & Robert Krauthgamer. (2009). How hard is it to approximate the best Nash equilibrium. Symposium on Discrete Algorithms. 720–727. 5 indexed citations
13.
Krauthgamer, Robert, Joseph Naor, & Roy Schwartz. (2009). Partitioning Graphs into Balanced Components. 942–949. 33 indexed citations
14.
Krauthgamer, Robert, Joseph Naor, & Roy Schwartz. (2009). Partitioning graphs into balanced components. Symposium on Discrete Algorithms. 942–949. 42 indexed citations
15.
Gopalan, Parikshit, T. S. Jayram, Robert Krauthgamer, & Ravi Kumar. (2007). Estimating the sortedness of a data stream. Symposium on Discrete Algorithms. 318–327. 29 indexed citations
16.
Andoni, Alexandr, Piotr Indyk, & Robert Krauthgamer. (2007). Earth Mover Distance over High-Dimensional Spaces.. 14. 46 indexed citations
17.
Krauthgamer, Robert & Yuval Rabani. (2006). Improved lower bounds for embeddings into L1. Symposium on Discrete Algorithms. 1010–1017. 49 indexed citations
18.
Charikar, Moses & Robert Krauthgamer. (2006). . Theory of Computing. 2(1). 207–224. 16 indexed citations
19.
Archer, Aaron, Jittat Fakcharoenphol, Chris Harrelson, et al.. (2004). Approximate classification via earthmover metrics. Symposium on Discrete Algorithms. 1079–1087. 16 indexed citations
20.
Halperin, Eran, Guy Kortsarz, & Robert Krauthgamer. (2003). Tight lower bounds for the asymmetric k-center problem. Electronic colloquium on computational complexity. 10. 8 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