Konstantin Makarychev
-
- Complexity and Algorithms in Graphs 35
- Advanced Graph Theory Research 30
-
- Computational Geometry and Mesh Generation 11
-
- Optimization and Search Problems 12
-
- Limits and Structures in Graph Theory 6
-
- Algorithms and Data Compression 6
-
- Genomics and Phylogenetic Studies 4
-
- VLSI and FPGA Design Techniques 4
- Co-authors
- Yury MakarychevMoses CharikarVirajith JalapartiMatthew CaesarPeter BodíkIshai MenacheSriram RaoAmit Agarwal
- Cited by
- Computational Theory and MathematicsComputer Graphics and Computer-Aided DesignComputer Networks and Communications
- Journals
- SIAM Journal on Computing (4 papers)ACM Transactions on Algorithms (2 papers)IEEE Transactions on Information Theory (2 papers)
- Partner nations
- United StatesUnited KingdomIsrael
In The Last Decade
Konstantin Makarychev
65 papers receiving 1.1k citations
Peers
Comparison fields: 5 of 74
- Computational Theory and Mathematics 553
- Computer Graphics and Computer-Aided Design 78
- Computer Networks and Communications 427
- Computational Mathematics 7
- Discrete Mathematics and Combinatorics 36
Countries citing papers authored by Konstantin Makarychev
This map shows the geographic impact of Konstantin Makarychev'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 Konstantin Makarychev with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Konstantin Makarychev more than expected).
Fields of papers citing papers by Konstantin Makarychev
This network shows the impact of papers produced by Konstantin Makarychev. 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 Konstantin Makarychev. The network helps show where Konstantin Makarychev may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Konstantin Makarychev, 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 | 2023 | 1 | |
| 2 | 2021 | 5 | |
| 3 | Correlation clustering with local objectives | 2019 | 2 |
| 4 | 2019 | 98 | |
| 5 | Clustering Billions of Reads for DNA Data Storage | 2017 | 22 |
| 6 | 2014 | 8 | |
| 7 | 2014 | 3 | |
| 8 | Algorithms for Semi-random Correlation Clustering. | 2014 | 1 |
| 9 | Bilu-Linial Stable Instances of Max Cut | 2013 | 1 |
| 10 | 2012 | 12 | |
| 11 | 2011 | 5 | |
| 12 | Improving Memory Access Locality for Large-Scale Graph Analysis Applications. | 2009 | 1 |
| 13 | Quadratic forms on graphs and their applications | 2008 | 1 |
| 14 | 2007 | 17 | |
| 15 | 2007 | 5 | |
| 16 | 2007 | 2 | |
| 17 | 2006 | 12 | |
| 18 | Note on MAX 2SAT | 2006 | 1 |
| 19 | 2006 | 6 | |
| 20 | 2005 | 48 |
About Konstantin Makarychev
Konstantin Makarychev is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Computer Networks and Communications and Artificial Intelligence, having authored 68 papers that have together received 1.2k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (35 papers), Advanced Graph Theory Research (30 papers), Optimization and Search Problems (12 papers), Computational Geometry and Mesh Generation (11 papers), Limits and Structures in Graph Theory (6 papers), Algorithms and Data Compression (6 papers), Genomics and Phylogenetic Studies (4 papers) and VLSI and FPGA Design Techniques (4 papers). The work is most often cited by research in Computational Theory and Mathematics (553 citations), Computer Graphics and Computer-Aided Design (78 citations), Computer Networks and Communications (427 citations), Computational Mathematics (7 citations) and Discrete Mathematics and Combinatorics (36 citations). Konstantin Makarychev has collaborated with scholars based in United States, United Kingdom and Israel. Frequent co-authors include Yury Makarychev, Moses Charikar, Virajith Jalaparti, Matthew Caesar, Peter Bodík, Ishai Menache, Sriram Rao, Amit Agarwal, Assaf Naor and Andrei Romashchenko. Their work appears in journals such as SIAM Journal on Computing, ACM Transactions on Algorithms, IEEE Transactions on Information Theory, ACM Transactions on Database Systems and ACM SIGCOMM Computer Communication Review.
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.