Alantha Newman

Alantha Newman, Ofer Neiman, Aleksandar Nikolov: Beck's Three Permutations Conjecture: A Counterexample and Some Consequences. FOCS 2012: 253-262

Konstantin Makarychev, Alantha Newman: Complex Semidefinite Programming Revisited and the Assembly of Circular Genomes. ICS 2011: 444-459

Moses Charikar, Alantha Newman, Aleksandar Nikolov: Tight Hardness Results for Minimizing Discrepancy. SODA 2011: 1607-1614

Alantha Newman, Aleksandar Nikolov: A counterexample to Beck's conjecture on the discrepancy of three permutations. CoRR abs/1104.2922 (2011)

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)

Nir Ailon, Moses Charikar, Alantha Newman: Aggregating inconsistent information: Ranking and clustering. J. ACM 55(5) (2008)

Fumei Lam, Alantha Newman: Traveling salesman path problems. Math. Program. 113(1): 39-59 (2008)

Alantha Newman: Max Cut. Encyclopedia of Algorithms 2008

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)

Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking: Decision Making Based on Approximate and Smoothed Pareto Curves. ISAAC 2005: 675-684

Nir Ailon, Moses Charikar, Alantha Newman: Aggregating inconsistent information: ranking and clustering. STOC 2005: 684-693

Alantha Newman: Cuts and Orderings: On Semidefinite Relaxations for the Linear Ordering Problem. APPROX-RANDOM 2004: 195-206

Alantha Newman, Matthias Ruhl: Combinatorial Problems on Strings with Applications to Protein Folding. LATIN 2004: 369-378

Alantha Newman: A new algorithm for protein folding in the HP model. SODA 2002: 876-884

Alantha Newman, Santosh Vempala: Fences Are Futile: On Relaxations for the Linear Ordering Problem. IPCO 2001: 333-347

Alantha Newman: The Maximum Acyclic Subgraph Problem and Degree-3 Graphs. RANDOM-APPROX 2001: 147-158