( en | de | ru )

 

Disambiguation of "Manuch, Ján"

Author of the publication

copydeleteadd this publication to your clipboard
The complexity of string partitioning.

, , and . J. Discrete Algorithms, (2015)

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

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)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)Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices., , , and . Discret. Appl. Math., 157 (10): 2310-2324 (2009)Approximate majority analyses using tri-molecular chemical reaction networks., , , and . Nat. Comput., 19 (1): 249-270 (2020)Multiparty Communication Complexity: Very Hard Functions.. MFCS, volume 1672 of Lecture Notes in Computer Science, page 160-169. Springer, (1999)On the Computational Complexity of Infinite Words., and . MFCS, volume 2136 of Lecture Notes in Computer Science, page 328-337. Springer, (2001)Fault-Tolerant Wavelength Allocations in All-optical Hypercubes., and . SIROCCO, page 219-222. Carleton Scientific, (1999)Step-Assembly with a Constant Number of Tile Types., , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 954-963. Springer, (2009)Constructing Camin-Sokal Phylogenies Via Answer Set Programming., , , , , and . LPAR, volume 4246 of Lecture Notes in Computer Science, page 452-466. Springer, (2006)Characterization of a word by its subwords.. Developments in Language Theory, page 210-219. World Scientific, (1999)