World's Best Scientists 2026 revealed!
Konstantin Makarychev

Konstantin Makarychev

D-Index & Metrics

Computer Science

D-Index
34
Citations
4631
World Ranking
12218
National Ranking
4958

Best Publications

  • Random access in large-scale DNA data storage

    Lee Organick;Siena Dumas Ang;Yuan Jyue Chen;Randolph Lopez

  • O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems

    Amit Agarwal;Moses Charikar;Konstantin Makarychev;Yury Makarychev

  • Network-Aware Scheduling for Data-Parallel Jobs: Plan When You Can

    Virajith Jalaparti;Peter Bodik;Ishai Menache;Sriram Rao

  • Space-Efficient Identity Based EncryptionWithout Pairings

    D. Boneh;C. Gentry;M. Hamburg

  • Near-optimal algorithms for unique games

    Moses Charikar;Konstantin Makarychev;Yury Makarychev

  • A NEW CLASS OF NON-SHANNON-TYPE INEQUALITIES FOR ENTROPIES

    Unknown

  • Near-optimal algorithms for maximum constraint satisfaction problems

    Moses Charikar;Konstantin Makarychev;Yury Makarychev

  • DNA assembly for nanopore data storage readout.

    Randolph Lopez;Yuan Jyue Chen;Siena Dumas Ang;Sergey Yekhanin

  • Min-Max Graph Partitioning and Small Set Expansion

    Nikhil Bansal;Uriel Feige;Robert Krauthgamer;Konstantin Makarychev

  • Integrality gaps for Sherali-Adams relaxations

    Moses Charikar;Konstantin Makarychev;Yury Makarychev

  • Quadratic forms on graphs

    Noga Mordechai Alon;Konstantin Makarychev;Yury Makarychev;Assaf Naor

  • Performance of Johnson-Lindenstrauss transform for k-means and k-medians clustering

    Unknown

  • Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs

    Shuchi Chawla;Konstantin Makarychev;Tselil Schramm;Grigory Yaroslavtsev

  • THE GROTHENDIECK CONSTANT IS STRICTLY SMALLER THAN KRIVINE’S BOUND

    Mark Braverman;Konstantin Makarychev;Yury Makarychev;Assaf Naor

  • How to Play Unique Games Using Embeddings

    Eden Chlamtac;Konstantin Makarychev;Yury Makarychev

  • Approximation algorithms for semi-random partitioning problems

    Konstantin Makarychev;Yury Makarychev;Aravindan Vijayaraghavan

  • Metric extension operators, vertex sparsifiers and Lipschitz extendability

    Konstantin Makarychev;Yury Makarychev

  • Sparse Random Linear Codes are Locally Decodable and Testable

    T. Kaufman;M. Sudan

  • Bilu-linial stable instances of max cut and minimum multiway cut

    Konstantin Makarychev;Yury Makarychev;Aravindan Vijayaraghavan

  • Near-optimal algorithms for maximum constraint satisfaction problems

    Moses Charikar;Konstantin Makarychev;Yury Makarychev

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Recently Published Articles