Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Newman, Alantha - Max-Planck-Institut für Informatik
SAND REPORT SAND2002xxxx
Cuts and Orderings: On semide nite relaxations for the linear
A Note on Polyhedral Relaxations for the Maximum Cut Problem Alantha Newman #
Approximating the Maximum Acyclic Subgraph Alantha Newman
Combinatorial Problems on Strings with Applications to Protein Folding
The Maximum Acyclic Subgraph Problem and Degree-3 Graphs Alantha Newman
Algorithms for String and Graph Layout Alantha Newman
A New Algorithm for Protein Folding in the HP Model Alantha Newman
Protein Structure Prediction with Lattice Models
Bounding A Protein's Free Energy In Lattice Models Via Linear Programming
Decision Making Based on Approximate and Smoothed Pareto Curves
Bounding A Protein's Free Energy In Lattice Models Via Linear Programming
Fences Are Futile: On Relaxations for the Linear Ordering Problem
