Search the dblp DataBase

Publications of Author

1. Eden Chlamtac, Konstantin Makarychev, Yury Makarychev
   How to Play Unique Games Using Embeddings. [Citation Graph (0, 0)][DBLP]
   FOCS, 2006, pp:687-696 [Conf]
   
2. Moses Charikar, Konstantin Makarychev, Yury Makarychev
   Directed metrics and directed graph partitioning problems. [Citation Graph (0, 0)][DBLP]
   SODA, 2006, pp:51-60 [Conf]
   
3. Amit Agarwal, Moses Charikar, Konstantin Makarychev, Yury Makarychev
   O(sqrt(log n)) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems. [Citation Graph (0, 0)][DBLP]
   STOC, 2005, pp:573-581 [Conf]
   
4. Noga Alon, Konstantin Makarychev, Yury Makarychev, Assaf Naor
   Quadratic forms on graphs. [Citation Graph (0, 0)][DBLP]
   STOC, 2005, pp:486-493 [Conf]
   
5. Moses Charikar, Konstantin Makarychev, Yury Makarychev
   Near-optimal algorithms for unique games. [Citation Graph (0, 0)][DBLP]
   STOC, 2006, pp:205-214 [Conf]
   
6. Moses Charikar, Konstantin Makarychev, Yury Makarychev
   Near-optimal algorithms for maximum constraint satisfaction problems. [Citation Graph (0, 0)][DBLP]
   SODA, 2007, pp:62-68 [Conf]
   
7. Moses Charikar, Konstantin Makarychev, Yury Makarychev
   A divide and conquer algorithm for d-dimensional arrangement. [Citation Graph (0, 0)][DBLP]
   SODA, 2007, pp:541-546 [Conf]
   
8. 
   Local Global Tradeoffs in Metric Embeddings. [Citation Graph (, )][DBLP]
   
   
9. 
   On the Advantage over Random for Maximum Acyclic Subgraph. [Citation Graph (, )][DBLP]
   
   
10. 
    Integrality gaps for Sherali-Adams relaxations. [Citation Graph (, )][DBLP]
    
    
11. 
    Subgraph sparsification and nearly optimal ultrasparsifiers. [Citation Graph (, )][DBLP]
    
    
12. 
    Conditionally independent random variables [Citation Graph (, )][DBLP]
    
    
13. 
    Balanced Allocation: Memory Performance Tradeoffs [Citation Graph (, )][DBLP]
    
    
14. 
    How to Play Unique Games on Expanders [Citation Graph (, )][DBLP]
    
    
15. 
    Subgraph Sparsification and Nearly Optimal Ultrasparsifiers [Citation Graph (, )][DBLP]
    
    
16. 
    Metric Extension Operators, Vertex Sparsifiers and Lipschitz Extendability [Citation Graph (, )][DBLP]
    
    
17. 
    Local Global Tradeoffs in Metric Embeddings. [Citation Graph (, )][DBLP]
    
    
18. 
    On the Advantage over Random for Maximum Acyclic Subgraph. [Citation Graph (, )][DBLP]
    
    
19. 
    Approximation Algorithm for the Max k-CSP Problem. [Citation Graph (, )][DBLP]
    
    
20. 
    Note on MAX 2SAT. [Citation Graph (, )][DBLP]