Konstantin Makarychev

	2012
45		Konstantin Makarychev, Warren Schudy, Maxim Sviridenko: Concentration inequalities for nonlinear matroid intersection. SODA 2012: 420-436
44		Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan: Approximation algorithms for semi-random partitioning problems. STOC 2012: 367-384
43		Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan: Approximation Algorithms for Semi-random Graph Partitioning Problems CoRR abs/1205.2234: (2012)
	2011
42		Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz: Min-max Graph Partitioning and Small Set Expansion. FOCS 2011: 17-26
41		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
40		Mark Braverman, Konstantin Makarychev, Yury Makarychev, Assaf Naor: The Grothendieck Constant is Strictly Smaller than Krivine's Bound. FOCS 2011: 453-462
39		Piotr Berman, Arnab Bhattacharyya, Konstantin Makarychev, Sofya Raskhodnikova, Grigory Yaroslavtsev: Improved Approximation for the Directed Spanner Problem. ICALP (1) 2011: 1-12
38		Konstantin Makarychev, Maxim Sviridenko: Maximizing Polynomials Subject to Assignment Constraints. ICALP (1) 2011: 510-520
37		Konstantin Makarychev, Alantha Newman: Complex Semidefinite Programming Revisited and the Assembly of Circular Genomes. ICS 2011: 444-459
36		Guojing Cong, Konstantin Makarychev: Optimizing Large-Scale Graph Analysis on a Multi-threaded, Multi-core Platform. IPDPS 2011: 688-697
35		Howard J. Karloff, Flip Korn, Konstantin Makarychev, Yuval Rabani: On Parsimonious Explanations For 2-D Tree- and Linearly-Ordered Data. STACS 2011: 332-343
34		Amol Ghoting, Konstantin Makarychev: Suffix Trees. Encyclopedia of Parallel Computing 2011: 1949-1955
33		Howard J. Karloff, Flip Korn, Konstantin Makarychev, Yuval Rabani: On Parsimonious Explanations for 2-D Tree- and Linearly-Ordered Data CoRR abs/1101.1941: (2011)
32		Alexandra Kolla, Konstantin Makarychev, Yury Makarychev: How to Play Unique Games against a Semi-Random Adversary CoRR abs/1104.3806: (2011)
31		Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz: Min-Max Graph Partitioning and Small Set Expansion CoRR abs/1110.4319: (2011)
	2010
30		Konstantin Makarychev, Yury Makarychev: Metric Extension Operators, Vertex Sparsifiers and Lipschitz Extendability. FOCS 2010: 255-264
29		Konstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko: Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm. ICALP (1) 2010: 594-604
28		Konstantin Makarychev, Yury Makarychev: How to Play Unique Games on Expanders. WAOA 2010: 190-200
27		Amol Ghoting, Konstantin Makarychev: I/O efficient algorithms for serial and parallel suffix tree construction. ACM Trans. Database Syst. 35(4): 25 (2010)
26		Konstantin Makarychev, Yury Makarychev: Metric Extension Operators, Vertex Sparsifiers and Lipschitz Extendability CoRR abs/1006.4607: (2010)
25		Arnab Bhattacharyya, Konstantin Makarychev: Improved Approximation for the Directed Spanner Problem CoRR abs/1012.4062: (2010)
24		Moses Charikar, Konstantin Makarychev, Yury Makarychev: Local Global Tradeoffs in Metric Embeddings. SIAM J. Comput. 39(6): 2487-2512 (2010)
	2009
23		Rohit Khandekar, Tracy Kimbrel, Konstantin Makarychev, Maxim Sviridenko: On Hardness of Pricing Items for Single-Minded Bidders. APPROX-RANDOM 2009: 202-216
22		Guojing Cong, Konstantin Makarychev: Improving Memory Access Locality for Large-Scale Graph Analysis Applications. ISCA PDCCS 2009: 121-127
21		Amol Ghoting, Konstantin Makarychev: Indexing genomic sequences on the IBM Blue Gene. SC 2009
20		Amol Ghoting, Konstantin Makarychev: Serial and parallel methods for i/o efficient suffix tree construction. SIGMOD Conference 2009: 827-840
19		Moses Charikar, Konstantin Makarychev, Yury Makarychev: Integrality gaps for Sherali-Adams relaxations. STOC 2009: 283-292
18		Moses Charikar, Konstantin Makarychev, Yury Makarychev: Near-optimal algorithms for maximum constraint satisfaction problems. ACM Transactions on Algorithms 5(3): (2009)
17		Konstantin Makarychev, Yury Makarychev: How to Play Unique Games on Expanders CoRR abs/0903.0367: (2009)
16		Konstantin Makarychev, Yury Makarychev: How to Play Unique Games on Expanders. Electronic Colloquium on Computational Complexity (ECCC) 16: 21 (2009)
	2008
15		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		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	Nikhil Bansal	[31] [42]
4	Piotr Berman	[39]
5	Arnab Bhattacharyya	[25] [39]
6	Mark Braverman	[40]
7	Niv Buchbinder	[15]
8	Moses Charikar	[2] [4] [5] [6] [7] [9] [10] [11] [12] [13] [14] [18] [19] [24]
9	Eden Chlamtac	[8]
10	Guojing Cong	[22] [36]
11	Uriel Feige	[31] [42]
12	Amol Ghoting	[20] [21] [27] [34]
13	Howard J. Karloff	[33] [35]
14	Rohit Khandekar	[23]
15	Tracy Kimbrel	[15] [23]
16	Alexandra Kolla	[32] [41]
17	Flip Korn	[33] [35]
18	Robert Krauthgamer	[31] [42]
19	Retsef Levi	[15]
20	Yury Makarychev	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [16] [17] [18] [19] [24] [26] [28] [30] [32] [40] [41] [43] [44]
21	Rajsekar Manokaran	[29]
22	Viswanath Nagarajan	[31] [42]
23	Assaf Naor	[3] [40]
24	Joseph Naor (Seffi Naor)	[31] [42]
25	Alantha Newman	[37]
26	Yuval Rabani	[33] [35]
27	Sofya Raskhodnikova	[39]
28	Warren Schudy	[45]
29	Roy Schwartz	[31] [42]
30	Maxim Sviridenko	[15] [23] [29] [38] [45]
31	Aravindan Vijayaraghavan	[43] [44]
32	Grigory Yaroslavtsev	[39]

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