.879-approximation algorithms for MAX CUT and MAX 2SAT
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Approximation algorithms for NP-hard problems
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Inapproximability of Flip-Cut, Shift-Cut and Other Problems from Optical Mapping
Inapproximability of Flip-Cut, Shift-Cut and Other Problems from Optical Mapping
A Uniform Framework for Ordered Restriction Map Problems
A Uniform Framework for Ordered Restriction Map Problems
A Model and Solution to the DNA Flipping String Problem
A Model and Solution to the DNA Flipping String Problem
Computing physical maps of chromosomes with nonoverlapping probes by branch-and-cut
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
| Hi-index | 0.00 |