Author of the publication

Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference.

, , , , and . IEEE ACM Trans. Comput. Biol. Bioinform., 5 (3): 323-331 (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design., , and . SIAM J. Comput., 44 (5): 1202-1229 (2015)Improved approximations for two-stage min-cut and shortest path problems under uncertainty., , , , and . Math. Program., 149 (1-2): 167-194 (2015)Redeeming Nested Dissection: Parallelism Implies Fill., , , and . PPSC, (1999)Approximation algorithms for the test cover problem., , , , , , and . Math. Program., 98 (1-3): 477-491 (2003)Approximating k-cuts via network strength., and . SODA, page 621-622. ACM/SIAM, (2002)An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set., and . Oper. Res. Lett., 41 (2): 191-196 (2013)Reconstructing edge-disjoint paths., , and . Oper. Res. Lett., 31 (3): 273-276 (2003)A linear-time algorithm to compute a MAD tree of an interval graph., , and . Inf. Process. Lett., 89 (5): 255-259 (2004)When cycles collapse: A general approximation technique for constrained two-connectivity problems., and . IPCO, page 39-55. CIACO, (1993)An Approximate Max-Flow Min-Cut Relation for Unidirected Multicommodity Flow, with Applications., , , and . Combinatorica, 15 (2): 187-202 (1995)