Konstantin Makarychev

  • Department of Computer Science
  • Northwestern University
  • Mudd Hall, Room 3009
  • 2233 Tech Drive, Third Floor
  • Evanston, IL 60208
  • Email: my_first_name [at] northwestern.edu


02/2017 – present
  • Northwestern University, Evanston, IL
  • Associate Professor of Computer Science (with tenure)
01/2017 – present
04/2012 – 01/2017
  • Microsoft Research, Redmond, WA
  • Researcher, Theory Group
07/2007 – 04/2012
  • IBM Research, Yorktown Heights, NY
  • Research Staff Member, Algorithms Group
06/2006 – 09/2006
  • IBM Research, Yorktown Heights, NY
  • Intern, Algorithms Group
  • Mentor: Maxim Sviridenko
06/2005 – 09/2005
  • Microsoft Research, Redmond, WA
  • Intern, Theory Group
  • Mentor: Assaf Naor
01/2002 – 08/2003
  • Siebel Systems, San Mateo, CA
  • Software Engineer, Core Engineering


2003 – 2007
  • Department of Computer Science, Princeton University
  • Ph.D. in Computer Science
  • Advisor: Moses Charikar
1996 – 2001
  • Department of Mathematics, Moscow University
  • M.S. in Pure and Applied Mathematics
  • Diploma with Honors; GPA 5.0/5.0
  • Advisors: Alexander Shen and Nikolai Vereshchagin
1992 – 1996
  • Moscow Math High School #57


Northwestern University

  • Design and Analysis of Algorithms: Spring 2021, Winter 2020, Winter 2019, Spring 2018, and Winter 2018
  • Graduate Algorithms: Fall 2020, Spring 2020
  • Approximation Algorithms: Winter 2021, Spring 2019, and Spring 2017
  • Math Toolkit for Theoretical Computer Scientists: Spring 2019
  • Advanced Topics in Approximation Algorithms: Spring 2020

University of Washington

  • Linear and Semi-Definite Programming in Approximation Algorithms (with Mohit Singh): Fall 2014

Summer Schools

  • Metric Geometry and Its Applications in Computer Science (CS Club, Saint Petersburg, Russia): Fall 2017
  • Approximation Algorithms (CSR Conference): Summer 2013

Teaching Assistant at Princeton University

Math Instructor

  • Math circle classes for high school students at Moscow High School #57, Moscow University, and Moscow Center for Continuous Mathematical Education: 1996 – 1998, 2000 – 2001

Professional Service

  • Editorial Board Member: SICOMP (2019 – present)
  • Program Committee Member: ICALP 2021, SODA 2020, ESA 2018, STOC 2016, APPROX 2014, CSR 2014, ICALP 2013, CSR 2013, SODA 2013, APPROX 2012, STOC 2008
  • General co-chair for STOC 2020
  • PhD Dissertation Committees: Abhratanu Dutta (Northwestern University), Tarik Kaced (Montpellier University), Aravindan Vijayaraghavan (Princeton University)
  • Grant reviewing for the National Science Foundation (NSF) and Israel Science Foundation (ISF)
  • Refereeing for APPROX, COLT, CSR, ESA, FOCS, ICALP, ICML, PODC, SODA, STACS, STOC, WINE (conferences); and Algorithmica, Combinatorica, Discrete Optimization, Information Processing Letters, Journal of ACM, Journal of Global Optimization, Mathematics of Operations Research, SIAM Journal on Computing, SIAM Journal on Discrete Mathematics, Theoretical Computer Science (journals)

Research Funding

2020 – 2024
NSF Award CCF-1955351 for Collaborative Medium Research Project “Design and Analysis of Models and Algorithms for Real-life Problems.” This is a joint project with Yury Makarychev.
2019 – 2022
Team member of the Institute for Data, Econometrics, Algorithms, and Learning (IDEAL). The institute is supported by NSF Award CCF-1934931.

Awards and Honors

IBM A-Level Accomplishment for work on Semidefinite Programming
IBM Research 2009 Pat Goldberg Memorial Best Paper Award
2006 – 2007
IBM Ph.D. Fellowship
2003 – 2007
Gordon Wu Fellowship
Siebel Engineering Outstanding Contributor Award
1996 – 1997
George Soros Fellowship
Russian Mathematical Olympiad – Silver Medal

Surveys and Book Chapters

  1. Perturbation Resilience
    • Konstantin Makarychev and Yury Makarychev
    • Beyond the Worst-Case Analysis of Algorithms. Editor: Tim Roughgarden. Cambridge University Press. 2020.
  2. Approximation Algorithms for CSPs (a survey of results)
    • Konstantin Makarychev and Yury Makarychev
    • The Constraint Satisfaction Problem: Complexity and Approximability. Editors: Andrei Krokhin and Stanislav Zivny. Dagstuhl Follow-Ups. 2017.
  3. Bilu–Linial Stability (a survey on Bilu–Linial stability and perturbation resilience)
    • Konstantin Makarychev and Yury Makarychev
    • Advanced Structured Prediction. Editors: T. Hazan, G. Papandreou, D. Tarlow. MIT Press. 2016.


  1. Improved Guarantees for k-means++ and k-means++ Parallel
  2. Batch Optimization for DNA Synthesis
  3. Correlation Clustering with Asymmetric Classification Errors
  4. Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection
  5. Certified Algorithms: Worst-Case Analysis and Beyond
  6. Correlation Clustering with Local Objectives
  7. Performance of Johnson-Lindenstrauss Transform for k-Means and k-Medians Clustering
  8. DNA assembly for nanopore data storage readout
  9. Scaling up DNA data storage and random access retrieval
  10. Nonlinear Dimension Reduction via Outer Bi-Lipschitz Extensions
  11. Clustering Billions of Reads for DNA Data Storage
  12. Algorithms for Stable and Perturbation-Resilient Problems
  13. Robust algorithms with polynomial loss for near-unanimity CSPs
  14. Learning Communities in the Presence of Errors
  15. Union of Euclidean Metric Spaces is Euclidean
  16. A bi-criteria approximation algorithm for k-Means
  17. Satisfiability of Ordering CSPs Above Average
  18. Correlation Clustering with Noisy Partial Information
  19. Near Optimal LP Rounding Algorithm for Correlation Clustering on Complete Graphs
  20. Network-Aware Scheduling for Data-Parallel Jobs: Plan When You Can
  21. Solving Optimization Problems with Diseconomies of Scale
  22. Nonuniform Graph Partitioning with Unrelated Weights
    • Konstantin Makarychev and Yury Makarychev
    • ICALP 2014
    • Sbornik: Mathematics (Russian Academy of Sciences), vol. 208
  23. Precedence-constrained Scheduling of Malleable Jobs with Preemption
  24. Constant Factor Approximation for Balanced Cut in the PIE Model
  25. Bilu-Linial Stable Instances of Max Cut
  26. Approximation Algorithm for Sparsest k-Partitioning
  27. Speed Regularization and Optimality in Word Classing
  28. Local Search is Better than Random Assignment for Bounded Occurrence Ordering k-CSPs
    • Konstantin Makarychev
    • STACS 2013
  29. Sorting Noisy Data with Partial Information
  30. Approximation Algorithm for Non-Boolean MAX k-CSP
  31. Approximation Algorithms for Semi-random Graph Partitioning Problems
  32. Concentration Inequalities for Nonlinear Matroid Intersection
  33. The Grothendieck Constant is Strictly Smaller than Krivine's Bound
  34. How to Play Unique Games Against a Semi-random Adversary
  35. Min-Max Graph Partitioning and Small Set Expansion
  36. Improved Approximation for the Directed Spanner Problem
  37. Maximizing Polynomials Subject to Assignment Constraints
  38. On Parsimonious Explanations For 2-D Tree- and Linearly-Ordered Data
  39. Assembly of Circular Genomes
  40. Metric Extension Operators, Vertex Sparsifiers and Lipschitz Extendability
  41. Maximum Quadratic Assignment Problem
  42. How to Play Unique Games on Expanders
  43. On Hardness of Pricing Items for Single-Minded Bidders
  44. Integrality Gaps for Sherali-Adams Relaxations
  45. Indexing Genomic Sequences on the IBM Blue Gene
    • Amol Ghoting and Konstantin Makarychev
    • SC 2009
    • ACM Gordon Bell Prize Finalist
  46. Serial and Parallel Methods for I/O Efficient Suffix Tree Construction
    • Amol Ghoting and Konstantin Makarychev
    • SIGMOD 2009
    • ACM Transactions on Database Systems (TODS), vol. 35(4), pp. 25:1-25:37
    • IBM Pat Goldberg Best Paper Award
  47. Online Make-to-Order Joint Replenishment Model: Primal Dual Competitive Algorithms
  48. Local Global Tradeoffs in Metric Embeddings
  49. On the Advantage over Random for Maximum Acyclic Subgraph
  50. Near-Optimal Algorithms for Maximum Constraint Satisfaction Problems
  51. A Divide and Conquer Algorithm for d-Dimensional Linear Arrangement
  52. How to Play Unique Games Using Embeddings
  53. Near-Optimal Algorithms for Unique Games
  54. Directed Metrics and Directed Graph Partitioning Problems
  55. Square root log n approximation algorithms for Min UnCut, Min 2CNF Deletion, and directed cut problems
  56. Quadratic Forms on Graphs
  57. Chain Independence and Common Information
    • Konstantin Makarychev and Yury Makarychev
    • IEEE Transactions on Information Theory, 58(8), pp. 5279-5286, 2012
  58. A new class of non Shannon type inequalities for entropies
  59. The Importance of Being Formal
    • Konstantin Makarychev and Yury Makarychev
    • The Mathematical Intelligencer, vol. 23 no. 1, 2001
  60. Proof of Pak's conjecture on tilings by T-tetrominoes (in Russian)

PhD Thesis

  1. Quadratic Forms on Graphs and Their Applications
    • Konstantin Makarychev