Alantha Newman

	2011
15		Konstantin Makarychev, Alantha Newman: Complex Semidefinite Programming Revisited and the Assembly of Circular Genomes. ICS 2011: 444-459
14		Moses Charikar, Alantha Newman, Aleksandar Nikolov: Tight Hardness Results for Minimizing Discrepancy. SODA 2011: 1607-1614
13		Alantha Newman, Aleksandar Nikolov: A counterexample to Beck's conjecture on the discrepancy of three permutations CoRR abs/1104.2922: (2011)
	2010
12		Prahladh Harsha, Moses Charikar, Matthew Andrews, Sanjeev Arora, Subhash Khot, Dana Moshkovitz, Lisa Zhang, Ashkan Aazami, Dev Desai, Igor Gorodezky, Geetha Jagannathan, Alexander S. Kulikov, Darakhshan J. Mir, Alantha Newman, Aleksandar Nikolov, David Pritchard, Gwen Spencer: Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes) CoRR abs/1002.3864: (2010)
	2008
11		Alantha Newman: Max Cut. Encyclopedia of Algorithms 2008
10		Nir Ailon, Moses Charikar, Alantha Newman: Aggregating inconsistent information: Ranking and clustering. J. ACM 55(5): (2008)
9		Fumei Lam, Alantha Newman: Traveling salesman path problems. Math. Program. 113(1): 39-59 (2008)
	2007
8		Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking: Decision-making based on approximate and smoothed Pareto curves. Theor. Comput. Sci. 378(3): 253-270 (2007)
	2005
7		Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking: Decision Making Based on Approximate and Smoothed Pareto Curves. ISAAC 2005: 675-684
6		Nir Ailon, Moses Charikar, Alantha Newman: Aggregating inconsistent information: ranking and clustering. STOC 2005: 684-693
	2004
5		Alantha Newman: Cuts and Orderings: On Semidefinite Relaxations for the Linear Ordering Problem. APPROX-RANDOM 2004: 195-206
4		Alantha Newman, Matthias Ruhl: Combinatorial Problems on Strings with Applications to Protein Folding. LATIN 2004: 369-378
	2002
3		Alantha Newman: A new algorithm for protein folding in the HP model. SODA 2002: 876-884
	2001
2		Alantha Newman, Santosh Vempala: Fences Are Futile: On Relaxations for the Linear Ordering Problem. IPCO 2001: 333-347
1		Alantha Newman: The Maximum Acyclic Subgraph Problem and Degree-3 Graphs. RANDOM-APPROX 2001: 147-158

Coauthor Index

1	Ashkan Aazami	[12]
2	Heiner Ackermann	[7] [8]
3	Nir Ailon	[6] [10]
4	Matthew Andrews	[12]
5	Sanjeev Arora	[12]
6	Moses Charikar	[6] [10] [12] [14]
7	Dev Desai	[12]
8	Igor Gorodezky	[12]
9	Prahladh Harsha	[12]
10	Geetha Jagannathan	[12]
11	Subhash Khot	[12]
12	Alexander S. Kulikov	[12]
13	Fumei Lam	[9]
14	Konstantin Makarychev	[15]
15	Darakhshan J. Mir	[12]
16	Dana Moshkovitz	[12]
17	Aleksandar Nikolov	[12] [13] [14]
18	David Pritchard	[12]
19	Heiko Röglin (Heiko Roeglin)	[7] [8]
20	Matthias Ruhl	[4]
21	Gwen Spencer	[12]
22	Santosh Vempala	[2]
23	Berthold Vöcking	[7] [8]
24	Lisa Zhang	[12]

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