 | 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 |
