Konstantin Makarychev's Photo


 

About me

I am an Associate Professor of Computer Science at Northwestern University. I am interested in designing efficient algorithms for computationally hard problems. The aim of my research is to introduce new core techniques and design general principles for developing and analyzing algorithms that work in theory and practice. My research interests include approximation algorithms, beyond worst-case analysis, theory of machine learning, and applications of high-dimension geometry in computer science.

Before joining Northwestern, I was a researcher at Microsoft and IBM Research Labs. I graduated from Princeton University in 2007. My PhD advisor was Moses Charikar. I received my undergraduate degree at the Department of Mathematics at Moscow State University. I finished Moscow Math High School #57.

See my CV for more info.

Talks

  • Tel Aviv University, December 9, 2019: Dimensionality Reduction for k-Means and k-Medians Clustering
  • Technion, December 2, 2019: Dimensionality Reduction for k-Means and k-Medians Clustering
  • Illinois Institute of Technology, November 19, 2019: Dimensionality Reduction for k-Means and k-Medians Clustering
  • FOCS Workshop on Beyond the Worst Case Analysis of Algorithms, November 9, 2019: Perturbation Stability and Certified Algorithms
  • UPenn, October 25, 2019: Dimensionality Reduction for k-Means and k-Medians Clustering
  • TTIC Workshop on Recent Trends in Clustering, September 18, 2019: Correlation Clustering

Events at Northwestern

Teaching

Northwestern University

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

University of Washington

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

PhD Students

Surveys

  1. Approximation Algorithms for CSPs (a survey of results)
    • Konstantin Makarychev and Yury Makarychev
    • The Constraint Satisfaction Problem: Complexity and Approximability, Andrei Krokhin and Stanislav Zivny (Eds.), Dagstuhl Follow-Ups.
    •  
  2. 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 (Eds.). MIT Press, 2016.

Publications

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

PhD Thesis

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

Publications

Surveys (2)
STOC (10)
FOCS (9)
SODA (8)
ICALP (5)
NeurIPS (2)
ITCS (3)
ICASSP (1)
SC (1)
  • Indexing Genomic Sequences on the IBM Blue Gene
    • Amol Ghoting and Konstantin Makarychev
    • SC 2009
    • ACM Gordon Bell Prize Finalist
SIGMOD (1)
  • Serial and Parallel Methods for I/O Efficient Suffix Tree Construction
    • Amol Ghoting and Konstantin Makarychev
    • SIGMOD 2009, pp. 827-840
    • ACM Transactions on Database Systems (TODS), vol. 35(4), pp. 25:1-25:37
    • IBM Pat Goldberg Best Paper Award
WAOA (1)
Journals* (6)
PhD Thesis (1)

Contact Information

  • 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