Yury Makarychev

发表

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

Amit Agarwal, Moses Charikar, Konstantin Makarychev, 2005, STOC '05.

Quadratic forms on graphs

N. Alon, A. Naor, K. Makarychev, 2006 .

Near-optimal algorithms for unique games

Moses Charikar, Konstantin Makarychev, Yury Makarychev, 2006, STOC '06.

Clustering, Hamming Embedding, Generalized LSH and the Max Norm pdf

Nathan Srebro, Yury Makarychev, Behnam Neyshabur, 2014, ALT.

Subgraph sparsification and nearly optimal ultrasparsifiers pdf

Amin Saberi, Alexandra Kolla, Shang-Hua Teng, 2009, STOC '10.

Quadratic forms on graphs

Noga Alon, Assaf Naor, Konstantin Makarychev, 2005, STOC '05.

Correlation Clustering with Noisy Partial Information

Aravindan Vijayaraghavan, Konstantin Makarychev, Yury Makarychev, 2014, COLT.

1 Bilu – Linial Stability

K. Makarychev, Yury Makarychev, 2016 .

Metric extension operators, vertex sparsifiers and Lipschitz extendability

Konstantin Makarychev, Yury Makarychev, K. Makarychev, 2016 .

Dimension Reduction for the Hyperbolic Space

I. Benjamini, Yury Makarychev, 2007, 0710.1343.

Dimension reduction for hyperbolic space

Yury Makarychev, I. Benjamini, Yury Makarychev, 2008 .

A Union of Euclidean Metric Spaces is Euclidean

K. Makarychev, Yury Makarychev, 2016, 1602.08426.

Approximation Algorithm for Non-Boolean Max-k-CSP

Konstantin Makarychev, Yury Makarychev, K. Makarychev, 2014, Theory Comput..

Streaming Algorithms for Ellipsoidal Approximation of Convex Polytopes

Yury Makarychev, Naren Manoj, Max Ovsiankin, 2022, COLT.

Bilu-Linial Stable Instances of Max Cut pdf

Aravindan Vijayaraghavan, Konstantin Makarychev, Yury Makarychev, 2013, arXiv.org.

Perturbation Resilience

Konstantin Makarychev, Yury Makarychev, K. Makarychev, 2020, Beyond the Worst-Case Analysis of Algorithms.

Nonlinear dimension reduction via outer Bi-Lipschitz extensions

Konstantin Makarychev, Yury Makarychev, Sepideh Mahabadi, 2018, STOC.

Approximating Fair Clustering with Cascaded Norm Objectives pdf

Yury Makarychev, Eden Chlamtác, Ali Vakilian, 2021, SODA.

Local Global Tradeoffs in Metric Embeddings

Moses Charikar, Konstantin Makarychev, Yury Makarychev, 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

Learning Communities in the Presence of Errors pdf

Aravindan Vijayaraghavan, Konstantin Makarychev, Yury Makarychev, 2015, COLT.

Stereoselectivity of halomethoxylation of 1-phenyltricyclo-[4.1.0.02,7]heptane and methyl 7-phenyltricyclo[4.1.0.02,7]-heptane-1-carboxylate

Yury Makarychev, L. Hennig, J. Baldamus, 2007 .

A short proof of Kuratowski's graph planarity criterion

Yury Makarychev, Yury Makarychev, 1997, J. Graph Theory.

Local Correlation Clustering with Asymmetric Classification Errors pdf

Konstantin Makarychev, Yury Makarychev, Jafar Jafarov, 2021, ICML.

Correlation Clustering with Asymmetric Classification Errors

Konstantin Makarychev, Yury Makarychev, Jafar Jafarov, 2020, ICML.

Algorithms for Semi-random Correlation Clustering pdf

Aravindan Vijayaraghavan, Konstantin Makarychev, Yury Makarychev, 2014, ArXiv.

Bilu-Linial Stable Instances of Max Cut and Minimum Multiway Cut

Aravindan Vijayaraghavan, Konstantin Makarychev, Yury Makarychev, 2013, SODA.

On the Advantage over Random for Maximum Acyclic Subgraph

Moses Charikar, Konstantin Makarychev, Yury Makarychev, 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

Sorting noisy data with partial information

Aravindan Vijayaraghavan, Konstantin Makarychev, Yury Makarychev, 2013, ITCS '13.

The Power of Asymmetry in Binary Hashing

Ruslan Salakhutdinov, Nathan Srebro, Yury Makarychev, 2013, NIPS.

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

Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn, 2018, STOC.

The Grothendieck Constant is Strictly Smaller than Krivine's Bound

Mark Braverman, Assaf Naor, Konstantin Makarychev, 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

Metric extension operators, vertex sparsifiers and Lipschitz extendability

Konstantin Makarychev, Yury Makarychev, K. Makarychev, 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

Approximation algorithms for semi-random partitioning problems

Aravindan Vijayaraghavan, Konstantin Makarychev, Yury Makarychev, 2012, STOC '12.

Near-optimal algorithms for maximum constraint satisfaction problems

Moses Charikar, Konstantin Makarychev, Yury Makarychev, 2007, SODA '07.

Performance of Johnson--Lindenstrauss Transform for $k$-Means and $k$-Medians Clustering

Ilya P. Razenshteyn, K. Makarychev, Yury Makarychev, 2022, SIAM Journal on Computing.

Efficient Kirszbraun Extension with Applications to Regression

Yury Makarychev, A. Kontorovich, A. Biess, 2019, 1905.11930.

How to Play Unique Games Against a Semi-random Adversary: Study of Semi-random Models of Unique Games

Alexandra Kolla, Konstantin Makarychev, Yury Makarychev, 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

A Bi-Criteria Approximation Algorithm for k-Means

Maxim Sviridenko, Konstantin Makarychev, Yury Makarychev, 2015, APPROX-RANDOM.

Integrality gaps for Sherali-Adams relaxations

Moses Charikar, Konstantin Makarychev, Yury Makarychev, 2009, STOC '09.

Fair Representation Clustering with Several Protected Classes

Yury Makarychev, A. Vakilian, Zhen Dai, 2022, FAccT.

Approximation Algorithms for Socially Fair Clustering

Yury Makarychev, Ali Vakilian, Yury Makarychev, 2021, COLT.

Approximation Algorithms for CSPs

Konstantin Makarychev, Yury Makarychev, K. Makarychev, 2017, The Constraint Satisfaction Problem.

Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion

Michael Dinitz, Yury Makarychev, Eden Chlamtác, 2016, SODA.

Approximation Algorithms and Hardness of the k-Route Cut Problem pdf

Yuan Zhou, Aravindan Vijayaraghavan, Yury Makarychev, 2011, TALG.

Directed metrics and directed graph partitioning problems

Moses Charikar, Konstantin Makarychev, Yury Makarychev, 2006, SODA '06.

Regression via Kirszbraun Extension

Aryeh Kontorovich, Yury Makarychev, Armin Biess, 2019 .

Regression via Kirszbraun Extension with Applications to Imitation Learning pdf

Aryeh Kontorovich, Yury Makarychev, Armin Biess, 2019, ArXiv.

Finding Almost-Perfect Graph Bisections

Prasad Raghavendra, Venkatesan Guruswami, Yuan Zhou, 2011, ICS.

Approximation Algorithms for Hypergraph Small-Set Expansion and Small-Set Vertex Expansion pdf

Yury Makarychev, Anand Louis, Yury Makarychev, 2014, Theory Comput..

How to Play Unique Games Using Embeddings

Konstantin Makarychev, Yury Makarychev, Eden Chlamtác, 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

Algorithms for stable and perturbation-resilient problems

Konstantin Makarychev, Yury Makarychev, Haris Angelidakis, 2017, STOC.

Robust algorithms with polynomial loss for near-unanimity CSPs

Konstantin Makarychev, Yury Makarychev, Marcin Kozik, 2016, SODA.

Balanced Allocation: Memory Performance Tradeoffs

I. Benjamini, Yury Makarychev, 2009, ArXiv.

Near-optimal algorithms for unique games

K. Makarychev, M. Charikar, Yury Makarychev, 2006, STOC '06.

Constant factor approximation for balanced cut in the PIE model

Aravindan Vijayaraghavan, Konstantin Makarychev, Yury Makarychev, 2014, STOC.

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

A. Agarwal, K. Makarychev, M. Charikar, 2005, STOC '05.

Certified Algorithms: Worst-Case Analysis and Beyond

Konstantin Makarychev, Yury Makarychev, K. Makarychev, 2020, ITCS.