Yury Makarychev

	2012
35		Julia Chuzhoy, Yury Makarychev, Aravindan Vijayaraghavan, Yuan Zhou: Approximation algorithms and hardness of the k-route cut problem. SODA 2012: 780-799
34		Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan: Approximation algorithms for semi-random partitioning problems. STOC 2012: 367-384
33		Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan: Approximation Algorithms for Semi-random Graph Partitioning Problems CoRR abs/1205.2234: (2012)
	2011
32		Alexandra Kolla, Konstantin Makarychev, Yury Makarychev: How to Play Unique Games Against a Semi-random Adversary: Study of Semi-random Models of Unique Games. FOCS 2011: 443-452
31		Mark Braverman, Konstantin Makarychev, Yury Makarychev, Assaf Naor: The Grothendieck Constant is Strictly Smaller than Krivine's Bound. FOCS 2011: 453-462
30		Venkatesan Guruswami, Yury Makarychev, Prasad Raghavendra, David Steurer, Yuan Zhou: Finding Almost-Perfect Graph Bisections. ICS 2011: 321-337
29		Julia Chuzhoy, Yury Makarychev, Anastasios Sidiropoulos: On Graph Crossing Number and Edge Planarization. SODA 2011: 1050-1069
28		Alexandra Kolla, Konstantin Makarychev, Yury Makarychev: How to Play Unique Games against a Semi-Random Adversary CoRR abs/1104.3806: (2011)
27		Julia Chuzhoy, Yury Makarychev, Aravindan Vijayaraghavan, Yuan Zhou: Approximation Algorithms and Hardness of the k-Route Cut Problem CoRR abs/1112.3611: (2011)
	2010
26		Konstantin Makarychev, Yury Makarychev: Metric Extension Operators, Vertex Sparsifiers and Lipschitz Extendability. FOCS 2010: 255-264
25		Alexandra Kolla, Yury Makarychev, Amin Saberi, Shang-Hua Teng: Subgraph sparsification and nearly optimal ultrasparsifiers. STOC 2010: 57-66
24		Konstantin Makarychev, Yury Makarychev: How to Play Unique Games on Expanders. WAOA 2010: 190-200
23		Konstantin Makarychev, Yury Makarychev: Metric Extension Operators, Vertex Sparsifiers and Lipschitz Extendability CoRR abs/1006.4607: (2010)
22		Julia Chuzhoy, Yury Makarychev, Anastasios Sidiropoulos: On Graph Crossing Number and Edge Planarization CoRR abs/1010.3976: (2010)
21		Moses Charikar, Konstantin Makarychev, Yury Makarychev: Local Global Tradeoffs in Metric Embeddings. SIAM J. Comput. 39(6): 2487-2512 (2010)
	2009
20		Moses Charikar, Konstantin Makarychev, Yury Makarychev: Integrality gaps for Sherali-Adams relaxations. STOC 2009: 283-292
19		Moses Charikar, Konstantin Makarychev, Yury Makarychev: Near-optimal algorithms for maximum constraint satisfaction problems. ACM Transactions on Algorithms 5(3): (2009)
18		Itai Benjamini, Yury Makarychev: Balanced Allocation: Memory Performance Tradeoffs CoRR abs/0901.1155: (2009)
17		Konstantin Makarychev, Yury Makarychev: How to Play Unique Games on Expanders CoRR abs/0903.0367: (2009)
16		Alexandra Kolla, Yury Makarychev, Amin Saberi, Shang-Hua Teng: Subgraph Sparsification and Nearly Optimal Ultrasparsifiers CoRR abs/0912.1623: (2009)
15		Konstantin Makarychev, Yury Makarychev: How to Play Unique Games on Expanders. Electronic Colloquium on Computational Complexity (ECCC) 16: 21 (2009)
	2007
14		Moses Charikar, Konstantin Makarychev, Yury Makarychev: On the Advantage over Random for Maximum Acyclic Subgraph. FOCS 2007: 625-633
13		Moses Charikar, Konstantin Makarychev, Yury Makarychev: Local Global Tradeoffs in Metric Embeddings. FOCS 2007: 713-723
12		Moses Charikar, Konstantin Makarychev, Yury Makarychev: A divide and conquer algorithm for d-dimensional arrangement. SODA 2007: 541-546
11		Moses Charikar, Konstantin Makarychev, Yury Makarychev: Near-optimal algorithms for maximum constraint satisfaction problems. SODA 2007: 62-68
10		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		Moses Charikar, Konstantin Makarychev, Yury Makarychev: Local Global Tradeoffs in Metric Embeddings. Electronic Colloquium on Computational Complexity (ECCC) 14(108): (2007)
	2006
8		Eden Chlamtac, Konstantin Makarychev, Yury Makarychev: How to Play Unique Games Using Embeddings. FOCS 2006: 687-696
7		Moses Charikar, Konstantin Makarychev, Yury Makarychev: Directed metrics and directed graph partitioning problems. SODA 2006: 51-60
6		Moses Charikar, Konstantin Makarychev, Yury Makarychev: Near-optimal algorithms for unique games. STOC 2006: 205-214
5		Moses Charikar, Konstantin Makarychev, Yury Makarychev: Approximation Algorithm for the Max k-CSP Problem. Electronic Colloquium on Computational Complexity (ECCC) 13(063): (2006)
4		Moses Charikar, Konstantin Makarychev, Yury Makarychev: Note on MAX 2SAT. Electronic Colloquium on Computational Complexity (ECCC) 13(064): (2006)
	2005
3		Noga Alon, Konstantin Makarychev, Yury Makarychev, Assaf Naor: Quadratic forms on graphs. STOC 2005: 486-493
2		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		Konstantin Makarychev, Yury Makarychev: Conditionally independent random variables CoRR abs/cs/0510029: (2005)

Coauthor Index

1	Amit Agarwal	[2]
2	Noga Alon	[3]
3	Itai Benjamini	[18]
4	Mark Braverman	[31]
5	Moses Charikar	[2] [4] [5] [6] [7] [9] [10] [11] [12] [13] [14] [19] [20] [21]
6	Eden Chlamtac	[8]
7	Julia Chuzhoy	[22] [27] [29] [35]
8	Venkatesan Guruswami	[30]
9	Alexandra Kolla	[16] [25] [28] [32]
10	Konstantin Makarychev	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [17] [19] [20] [21] [23] [24] [26] [28] [31] [32] [33] [34]
11	Assaf Naor	[3] [31]
12	Prasad Raghavendra	[30]
13	Amin Saberi	[16] [25]
14	Anastasios Sidiropoulos	[22] [29]
15	David Steurer	[30]
16	Shang-Hua Teng	[16] [25]
17	Aravindan Vijayaraghavan	[27] [33] [34] [35]
18	Yuan Zhou	[27] [30] [35]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page