( en | de | ru )

 

Disambiguation of "Manuch, Ján"

Author of the publication

copydeleteadd this publication to your clipboard
Haplotype Inferring Via Galled-Tree Networks Is NP-Complete.

, , , and . COCOON, volume 5092 of Lecture Notes in Computer Science, page 287-298. Springer, (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.

Ján Poliak

Validierung von satellitenbasierten Eisenbahnortungssystemen. TU Braunschweig, (2009)

Rolf Alexander Jánosi

Ildikó Marianne Jánossy

Géza János

András Jánossy

 

Other publications of authors with the same name

On the Computational Complexity of Infinite Words., and . MFCS, volume 2136 of Lecture Notes in Computer Science, page 328-337. Springer, (2001)Ordered 3-colorings., , , and . Electron. Notes Discret. Math., (2005)Algorithm for Haplotype Inference via Galled-Tree Networks with Simple Galls., , , and . J. Comput. Biol., 19 (4): 439-454 (2012)Fitting Protein Chains to Cubic Lattice is NP-Complete., and . APBC, volume 5 of Advances in Bioinformatics and Computational Biology, page 153-164. Imperial College Press, (2007)Design of nucleic acid strands with long low-barrier folding pathways., , and . Nat. Comput., 16 (2): 261-284 (2017)Construction of very hard functions for multiparty communication complexity.. RAIRO Theor. Informatics Appl., 34 (1): 61-76 (2000)Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start Times., , and . ACiD, volume 7 of Texts in Algorithmics, page 85-94. King's College, London, (2006)Finding minimum Tucker submatrices., and . CoRR, (2014)Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices., , , and . Discret. Appl. Math., 157 (10): 2310-2324 (2009)Multiparty Communication Complexity: Very Hard Functions.. MFCS, volume 1672 of Lecture Notes in Computer Science, page 160-169. Springer, (1999)