Author of the publication

finding Smallest Supertrees.

, and . ISAAC, volume 1004 of Lecture Notes in Computer Science, page 112-121. Springer, (1995)

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

Haplotype Inferring via Galled-Tree Networks Is NP-Complete., , , , and . J. Comput. Biol., 17 (10): 1435-1449 (2010)Using Amplification to Compute Majority with Small Majority Gates., and . Comput. Complex., 6 (1): 46-63 (1997)finding Smallest Supertrees., and . ISAAC, volume 1004 of Lecture Notes in Computer Science, page 112-121. Springer, (1995)Constructing Camin-Sokal Phylogenies Via Answer Set Programming., , , , , and . LPAR, volume 4246 of Lecture Notes in Computer Science, page 452-466. Springer, (2006)On the Complements of Partial k-Trees., , and . ICALP, volume 1644 of Lecture Notes in Computer Science, page 382-391. Springer, (1999)Computer-aided engineering analysis for the performance augmentation of a fin-tube heat exchanger using vortex generator., , and . Concurr. Eng. Res. Appl., (2020)The Chi-t-Coloring Problem., , and . STACS, volume 900 of Lecture Notes in Computer Science, page 409-420. Springer, (1995)Haplotype Inferring Via Galled-Tree Networks Is NP-Complete., , , and . COCOON, volume 5092 of Lecture Notes in Computer Science, page 287-298. Springer, (2008)Inverse protein folding in 3D hexagonal prism lattice under HP model., , , and . BIOCOMP, page 619-625. CSREA Press, (2008)Finding Largest Subtrees and Smallest Supertrees., and . Algorithmica, 21 (2): 183-210 (1998)