Kevin Matulef
Impact in
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
-
- Limits and Structures in Graph Theory
Papers in
-
- Machine Learning and Algorithms 4
- Cryptography and Data Security 2
-
- Complexity and Algorithms in Graphs 6
- Advanced Graph Theory Research 1
- Co-authors
- Ronitt Rubinfeld (6 shared papers)Eric Blais (1 shared paper)Joshua Brody (1 shared paper)Rocco A. Servedio (6 shared papers)Ryan O’Donnell (2 shared papers)Ning Xie (1 shared paper)Ilias Diakonikolas (4 shared papers)Alexandr Andoni (1 shared paper)
- Journals
- Algorithmica (1 paper)SIAM Journal on Computing (1 paper)Computational Complexity (1 paper)Electronic colloquium on computational complexity (1 paper)Canadian Conference on Computational Geometry (1 paper)
- Partner nations
- United StatesChinaDenmark
In The Last Decade
Kevin Matulef
11 papers receiving 180 citations
Peers
Comparison fields: 5 of 30
- Computational Theory and Mathematics 150
- Discrete Mathematics and Combinatorics 13
- Artificial Intelligence 124
- Computer Graphics and Computer-Aided Design 11
- Computer Networks and Communications 48
Countries citing papers authored by Kevin Matulef
This map shows the geographic impact of Kevin Matulef'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 Kevin Matulef with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Kevin Matulef more than expected).
Fields of papers citing papers by Kevin Matulef
This network shows the impact of papers produced by Kevin Matulef. 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 Kevin Matulef. The network helps show where Kevin Matulef may publish in the future.
Co-authors
The 15 scholars most cited alongside Kevin Matulef, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2012 | 56 | |
| 2 | 2007 | 47 | |
| 3 | 2007 | 45 | |
| 4 | 2010 | 29 | |
| 5 | 2009 | 9 | |
| 6 | 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings | 2007 | 6 |
| 7 | 2017 | 3 | |
| 8 | 2007 | 2 | |
| 9 | Property Testing on Linked Lists. | 2013 | 1 |
| 10 | 2010 | 1 | |
| 11 | Finding the Maximum Area Parallelogram in a Convex Polygon | 2011 | 1 |
About Kevin Matulef
Kevin Matulef is a scholar working on Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications, Signal Processing and Computer Graphics and Computer-Aided Design, having authored 11 papers that have together received 200 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (6 papers), Machine Learning and Algorithms (4 papers), Cryptography and Data Security (2 papers), Optimization and Search Problems (2 papers), Data Management and Algorithms (2 papers), Computational Geometry and Mesh Generation (2 papers), Web Data Mining and Analysis (1 paper) and Advanced Graph Theory Research (1 paper). The work is most often cited by research in Computational Theory and Mathematics (150 citations), Discrete Mathematics and Combinatorics (13 citations), Artificial Intelligence (124 citations), Computer Graphics and Computer-Aided Design (11 citations) and Computer Networks and Communications (48 citations). Kevin Matulef has collaborated with scholars based in United States, China and Denmark. Frequent co-authors include Ronitt Rubinfeld, Eric Blais, Joshua Brody, Rocco A. Servedio, Ryan O’Donnell, Ning Xie, Ilias Diakonikolas, Alexandr Andoni, Noga Alon and Krzysztof Onak. Their work appears in journals such as Algorithmica, SIAM Journal on Computing, Computational Complexity, Electronic colloquium on computational complexity and Canadian Conference on Computational Geometry.
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.