From post

Beaches of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems.

, , , и . WABI, том 4175 из Lecture Notes in Computer Science, стр. 80-91. Springer, (2006)

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.

 

Другие публикации лиц с тем же именем

The traveling salesman problem on cubic and subcubic graphs., , , и . Math. Program., 144 (1-2): 227-245 (2014)Split Scheduling with Uniform Setup Times, , , , , и . CoRR, (2012)Scheduling Real-Time Mixed-Criticality Jobs., , , , , , и . MFCS, том 6281 из Lecture Notes in Computer Science, стр. 90-101. Springer, (2010)A Competitive Algorithm for the General 2-Server Problem., , и . ICALP, том 2719 из Lecture Notes in Computer Science, стр. 624-636. Springer, (2003)Prefix Reversals on Binary and Ternary Strings., , , , , и . SIAM J. Discret. Math., 21 (3): 592-611 (2007)Strain-Aware Assembly of Genomes from Mixed Samples Using Flow Variation Graphs., , и . RECOMB, том 12074 из Lecture Notes in Computer Science, стр. 221-222. Springer, (2020)An approximation algorithm for the wireless gathering problem., , , и . Oper. Res. Lett., 36 (5): 605-608 (2008)Competitive Algorithms for the On-line Traveling Salesman., , , , и . WADS, том 955 из Lecture Notes in Computer Science, стр. 206-217. Springer, (1995)Latency Constrained Aggregation in Sensor Networks., , , , , и . ESA, том 4168 из Lecture Notes in Computer Science, стр. 88-99. Springer, (2006)Total Completion Time Scheduling Under Scenarios., , , , , , и . WAOA, том 14297 из Lecture Notes in Computer Science, стр. 104-118. Springer, (2023)