Guy Kindler
Impact in
-
- Limits and Structures in Graph Theory
- Computational Theory and Mathematics top 0.5%
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
- Computability, Logic, AI Algorithms
Papers in
-
- Complexity and Algorithms in Graphs 42
- Computability, Logic, AI Algorithms 8
-
- Limits and Structures in Graph Theory 19
- Co-authors
- Ryan O’Donnell (11 shared papers)Subhash Khot (6 shared papers)Elchanan Mossel (5 shared papers)Muli Safra (13 shared papers)Irit Dinur (11 shared papers)Michael Schapira (2 shared papers)Marco Chiesa (2 shared papers)Ran Raz (4 shared papers)
- Journals
- Israel Journal of Mathematics (3 papers)SIAM Journal on Computing (3 papers)COMBINATORICA (3 papers)SIAM Journal on Discrete Mathematics (2 papers)Computational Complexity (2 papers)
- Partner nations
- IsraelUnited StatesUnited Kingdom
In The Last Decade
Guy Kindler
49 papers receiving 1.4k citations
Guy Kindler's Hit Papers
Peers
Comparison fields: 5 of 35
- Discrete Mathematics and Combinatorics 263
- Computational Theory and Mathematics 925
- Numerical Analysis 76
- Artificial Intelligence 396
- Computer Networks and Communications 246
Countries citing papers authored by Guy Kindler
This map shows the geographic impact of Guy Kindler'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 Guy Kindler with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Guy Kindler more than expected).
Fields of papers citing papers by Guy Kindler
This network shows the impact of papers produced by Guy Kindler. 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 Guy Kindler. The network helps show where Guy Kindler may publish in the future.
Co-authors
The 25 scholars most cited alongside Guy Kindler, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 55 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? Hit paper breakdown → | 2007 | 373 |
| 2 | 2003 | 110 | |
| 3 | 2016 | 106 | |
| 4 | 2004 | 90 | |
| 5 | 2004 | 88 | |
| 6 | 2005 | 64 | |
| 7 | 2005 | 49 | |
| 8 | 2018 | 38 | |
| 9 | 2014 | 36 | |
| 10 | 1999 | 35 | |
| 11 | 2002 | 35 | |
| 12 | 2007 | 31 | |
| 13 | 2010 | 31 | |
| 14 | Noise-Resistant Boolean-Functions are Juntas | 2003 | 30 |
| 15 | 2018 | 30 | |
| 16 | 2008 | 29 | |
| 17 | 2007 | 26 | |
| 18 | 2010 | 22 | |
| 19 | On Non-Approximability for Quadratic Programs | 2005 | 20 |
| 20 | 2005 | 20 |
About Guy Kindler
Guy Kindler is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Numerical Analysis, Applied Mathematics and Artificial Intelligence, having authored 55 papers that have together received 1.5k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (42 papers), Limits and Structures in Graph Theory (19 papers), Computability, Logic, AI Algorithms (8 papers), Cryptography and Data Security (4 papers), Mathematical Approximation and Integration (4 papers), Geometric Analysis and Curvature Flows (3 papers), Coding theory and cryptography (3 papers) and Computational Geometry and Mesh Generation (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (263 citations), Computational Theory and Mathematics (925 citations), Numerical Analysis (76 citations), Artificial Intelligence (396 citations) and Computer Networks and Communications (246 citations). Guy Kindler has collaborated with scholars based in Israel, United States and United Kingdom. Frequent co-authors include Ryan O’Donnell, Subhash Khot, Elchanan Mossel, Muli Safra, Irit Dinur, Michael Schapira, Marco Chiesa, Ran Raz, Eldar Fischer and Boaz Barak. Their work appears in journals such as Israel Journal of Mathematics, SIAM Journal on Computing, COMBINATORICA, SIAM Journal on Discrete Mathematics and Computational Complexity.
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.