| 2009 |
|---|
| 16 | EE | Konstantin Makarychev,
Yury Makarychev:
How to Play Unique Games on Expanders
CoRR abs/0903.0367: (2009) |
| 2008 |
|---|
| 15 | EE | Niv Buchbinder,
Tracy Kimbrel,
Retsef Levi,
Konstantin Makarychev,
Maxim Sviridenko:
Online make-to-order joint replenishment model: primal dual competitive algorithms.
SODA 2008: 952-961 |
| 2007 |
|---|
| 14 | EE | Moses Charikar,
Konstantin Makarychev,
Yury Makarychev:
On the Advantage over Random for Maximum Acyclic Subgraph.
FOCS 2007: 625-633 |
| 13 | EE | Moses Charikar,
Konstantin Makarychev,
Yury Makarychev:
Local Global Tradeoffs in Metric Embeddings.
FOCS 2007: 713-723 |
| 12 | EE | Moses Charikar,
Konstantin Makarychev,
Yury Makarychev:
A divide and conquer algorithm for d-dimensional arrangement.
SODA 2007: 541-546 |
| 11 | EE | Moses Charikar,
Konstantin Makarychev,
Yury Makarychev:
Near-optimal algorithms for maximum constraint satisfaction problems.
SODA 2007: 62-68 |
| 10 | EE | Moses Charikar,
Konstantin Makarychev,
Yury Makarychev:
On the Advantage over Random for Maximum Acyclic Subgraph.
Electronic Colloquium on Computational Complexity (ECCC) 14(104): (2007) |
| 9 | EE | Moses Charikar,
Konstantin Makarychev,
Yury Makarychev:
Local Global Tradeoffs in Metric Embeddings.
Electronic Colloquium on Computational Complexity (ECCC) 14(108): (2007) |
| 2006 |
|---|
| 8 | EE | Eden Chlamtac,
Konstantin Makarychev,
Yury Makarychev:
How to Play Unique Games Using Embeddings.
FOCS 2006: 687-696 |
| 7 | EE | Moses Charikar,
Konstantin Makarychev,
Yury Makarychev:
Directed metrics and directed graph partitioning problems.
SODA 2006: 51-60 |
| 6 | EE | Moses Charikar,
Konstantin Makarychev,
Yury Makarychev:
Near-optimal algorithms for unique games.
STOC 2006: 205-214 |
| 5 | EE | Moses Charikar,
Konstantin Makarychev,
Yury Makarychev:
Approximation Algorithm for the Max k-CSP Problem.
Electronic Colloquium on Computational Complexity (ECCC) 13(063): (2006) |
| 4 | EE | Moses Charikar,
Konstantin Makarychev,
Yury Makarychev:
Note on MAX 2SAT.
Electronic Colloquium on Computational Complexity (ECCC) 13(064): (2006) |
| 2005 |
|---|
| 3 | EE | Noga Alon,
Konstantin Makarychev,
Yury Makarychev,
Assaf Naor:
Quadratic forms on graphs.
STOC 2005: 486-493 |
| 2 | EE | Amit Agarwal,
Moses Charikar,
Konstantin Makarychev,
Yury Makarychev:
O(sqrt(log n)) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems.
STOC 2005: 573-581 |
| 1 | EE | Konstantin Makarychev,
Yury Makarychev:
Conditionally independent random variables
CoRR abs/cs/0510029: (2005) |
