From post

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.

 

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

Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start Times., , и . ACiD, том 7 из Texts in Algorithmics, стр. 85-94. King's College, London, (2006)Approximate majority analyses using tri-molecular chemical reaction networks., , , и . Nat. Comput., 19 (1): 249-270 (2020)Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices., , , и . Discret. Appl. Math., 157 (10): 2310-2324 (2009)On the Computational Complexity of Infinite Words., и . MFCS, том 2136 из Lecture Notes in Computer Science, стр. 328-337. Springer, (2001)Fitting Protein Chains to Cubic Lattice is NP-Complete., и . APBC, том 5 из Advances in Bioinformatics and Computational Biology, стр. 153-164. Imperial College Press, (2007)Multiparty Communication Complexity: Very Hard Functions.. MFCS, том 1672 из Lecture Notes in Computer Science, стр. 160-169. Springer, (1999)Constructing Camin-Sokal Phylogenies Via Answer Set Programming., , , , , и . LPAR, том 4246 из Lecture Notes in Computer Science, стр. 452-466. Springer, (2006)Step-Assembly with a Constant Number of Tile Types., , и . ISAAC, том 5878 из Lecture Notes in Computer Science, стр. 954-963. Springer, (2009)On Defect Effect of Bi-Infinite Words., , и . MFCS, том 1450 из Lecture Notes in Computer Science, стр. 674-682. Springer, (1998)Characterization of a word by its subwords.. Developments in Language Theory, стр. 210-219. World Scientific, (1999)