| O (√ log n) approximation algorithms for Min UnCut, Min 2CNF Deletion, and directed cut problems A Agarwal, M Charikar, K Makarychev, Y Makarychev Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005 | 216 | 2005 |
| Near-optimal algorithms for unique games M Charikar, K Makarychev, Y Makarychev Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006 | 164 | 2006 |
| A new class of non-Shannon-type inequalities for entropies K Makarychev, Y Makarychev, A Romashchenko, N Vereshchagin Communications in Information and Systems 2 (2), 147-166, 2002 | 149 | 2002 |
| Integrality gaps for Sherali-Adams relaxations M Charikar, K Makarychev, Y Makarychev Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 135 | 2009 |
| Performance of Johnson-Lindenstrauss transform for k-means and k-medians clustering K Makarychev, Y Makarychev, I Razenshteyn Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 101 | 2019 |
| The Grothendieck constant is strictly smaller than Krivine’s bound M Braverman, K Makarychev, Y Makarychev, A Naor Forum of Mathematics, Pi 1, e4, 2013 | 101 | 2013 |
| Near-optimal algorithms for maximum constraint satisfaction problems M Charikar, K Makarychev, Y Makarychev ACM Transactions on Algorithms (TALG) 5 (3), 32, 2009 | 98 | 2009 |
| Quadratic forms on graphs N Alon, K Makarychev, Y Makarychev, A Naor Inventiones mathematicae 163 (3), 499-522, 2006 | 97 | 2006 |
| How to play unique games using embeddings E Chlamtac, K Makarychev, Y Makarychev 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06 …, 2006 | 77 | 2006 |
| The power of asymmetry in binary hashing B Neyshabur, N Srebro, RR Salakhutdinov, Y Makarychev, ... Advances in neural information processing systems 26, 2013 | 74 | 2013 |
| Approximation algorithms for semi-random partitioning problems K Makarychev, Y Makarychev, A Vijayaraghavan Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 70 | 2012 |
| Subgraph sparsification and nearly optimal ultrasparsifiers A Kolla, Y Makarychev, A Saberi, SH Teng Proceedings of the forty-second ACM symposium on Theory of computing, 57-66, 2010 | 69 | 2010 |
| Bilu-Linial stable instances of max cut and minimum multiway cut K Makarychev, Y Makarychev, A Vijayaraghavan Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete …, 2014 | 63 | 2014 |
| Algorithms for stable and perturbation-resilient problems H Angelidakis, K Makarychev, Y Makarychev Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 59 | 2017 |
| Metric extension operators, vertex sparsifiers and Lipschitz extendability K Makarychev, Y Makarychev Israel Journal of Mathematics 212 (2), 913-959, 2016 | 59* | 2016 |
| How to play unique games against a semi-random adversary: Study of semi-random models of unique games A Kolla, K Makarychev, Y Makarychev 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 443-452, 2011 | 51 | 2011 |
| Minimizing the union: Tight approximations for small set bipartite vertex expansion E Chlamtáč, M Dinitz, Y Makarychev Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 48 | 2017 |
| Correlation Clustering with Noisy Partial Information K Makarychev, Y Makarychev, A Vijayaraghavan Proceedings of the Conference on Learning Theory (COLT) 6, 2015 | 47 | 2015 |
| A Bi-Criteria Approximation Algorithm for k-Means K Makarychev, Y Makarychev, M Sviridenko, J Ward Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2016 | 46 | 2016 |
| Quadratic forms on graphs N Alon, K Makarychev, Y Makarychev, A Naor Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005 | 45 | 2005 |
Konstantin MakarychevNorthwestern UniversityVerified email at northwestern.edu
