( en | de | ru )

 

Disambiguation of "Hallett, Michael T."

Author of the publication

copydeleteadd this publication to your clipboard
A Fixed-Parameter Approach to Two-Layer Planarization.

, , , , , , , , , , , and . GD, volume 2265 of Lecture Notes in Computer Science, page 1-15. Springer, (2001)

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.

Mark Hallett

William Hallett

Michael R T Macnair

T Masselink

T Attin

 

Other publications of authors with the same name

Analogs and Duals of the MAST Problem for Sequences and Trees., , , and . ESA, volume 1461 of Lecture Notes in Computer Science, page 103-114. Springer, (1998)Ancestral Maximum Likelihood of Evolutionary Trees Is Hard., , , , , and . WABI, volume 2812 of Lecture Notes in Computer Science, page 202-215. Springer, (2003)Towards Identifying Lateral Gene Transfer Events., , and . Pacific Symposium on Biocomputing, page 279-290. (2003)A cross-comparison of a large dataset of genes., , , and . Bioinform., 16 (7): 654-655 (2000)A Fixed-Parameter Approach to Two-Layer Planarization., , , , , , , , , and 2 other author(s). GD, volume 2265 of Lecture Notes in Computer Science, page 1-15. Springer, (2001)Identifying the most significant pairwise correlations of residues in different positions of helices: the subset selection problem using least squares optimization., , and . SAC, page 51-55. ACM, (2001)A Faster FPT Algorithm for the Maximum Agreement Forest Problem., and . Theory Comput. Syst., 41 (3): 539-550 (2007)Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy., , and . STOC, page 449-458. ACM, (1994)The Parameterized Complexity of Some Problems in Logic and Linguistics., , , , and . LFCS, volume 813 of Lecture Notes in Computer Science, page 89-100. Springer, (1994)Hunting for Functionally Analogous Genes., and . FSTTCS, volume 1974 of Lecture Notes in Computer Science, page 465-476. Springer, (2000)