Ján Manuch

According to our database, Ján Manuch authored at least 72 papers between 1998 and 2020.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2020

Approximate majority analyses using tri-molecular chemical reaction networks.

Anne Condon, Monir Hajiaghayi, David G. Kirkpatrick, Ján Manuch

Nat. Comput., 2020

Weak Coverage of a Rectangular Barrier.

Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Manuch, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho

Algorithmica, 2020

2017

Algorithms and Complexity Results for Genome Mapping Problems.

Ashok Rajaraman, João Paulo Pereira Zanetti, Ján Manuch, Cédric Chauve

IEEE ACM Trans. Comput. Biol. Bioinform., 2017

Design of nucleic acid strands with long low-barrier folding pathways.

Anne Condon, Bonnie Kirkpatrick, Ján Manuch

Nat. Comput., 2017

Combinatorial RNA Design: Designability and Structure-Approximating Algorithm in Watson-Crick and Nussinov-Jacobson Energy Models.

Jozef Hales, Alice Héliou, Ján Manuch, Yann Ponty, Ladislav Stacho

Algorithmica, 2017

Simplifying Analyses of Chemical Reaction Networks for Approximate Majority.

Anne Condon, Monir Hajiaghayi, David G. Kirkpatrick, Ján Manuch

Proceedings of the DNA Computing and Molecular Programming - 23rd International Conference, 2017

Weak Coverage of a Rectangular Barrier.

Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Manuch, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende, Ladislav Stacho

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

Pattern overlap implies runaway growth in hierarchical tile systems.

David Doty, Ho-Lin Chen, Ján Manuch, Arash Rafiey, Ladislav Stacho

J. Comput. Geom., 2016

Connectivity with directional antennas in the symmetric communication model.

Stefan Dobrev, Mohsen Eftekhari Hesari, Fraser MacQuarie, Ján Manuch, Oscar Morales-Ponce, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho

Comput. Geom., 2016

2015

The complexity of string partitioning.

Anne Condon, Ján Manuch, Chris Thachuk

J. Discrete Algorithms, 2015

Monitoring the Plane with Rotating Radars.

Jurek Czyzowicz, Stefan Dobrev, Benson L. Joeris, Evangelos Kranakis, Danny Krizanc, Ján Manuch, Oscar Morales-Ponce, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia

Graphs Comb., 2015

Ordering with precedence constraints and budget minimization.

Jeff Kinne, Ján Manuch, Akbar Rafiey, Arash Rafiey

CoRR, 2015

Combinatorial RNA Design: Designability and Structure-Approximating Algorithm.

Jozef Hales, Ján Manuch, Yann Ponty, Ladislav Stacho

Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2014

Reachability bounds for chemical reaction networks and strand displacement systems.

Anne Condon, Bonnie Kirkpatrick, Ján Manuch

Nat. Comput., 2014

Finding minimum Tucker submatrices.

Ján Manuch, Arash Rafiey

CoRR, 2014

2013

Learning Polytrees with Constant Number of Roots from Data.

Javad Safaei, Ján Manuch, Ladislav Stacho

Proceedings of the AI 2013: Advances in Artificial Intelligence, 2013

2012

Step-wise tile assembly with a constant number of tile types.

Ján Manuch, Ladislav Stacho, Christine Stoll

Nat. Comput., 2012

Algorithm for Haplotype Inference via Galled-Tree Networks with Simple Galls.

Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao

J. Comput. Biol., 2012

Hardness results on the gapped consecutive-ones property problem.

Ján Manuch, Murray Patterson, Cédric Chauve

Discret. Appl. Math., 2012

Linearization of ancestral multichromosomal genomes.

Ján Manuch, Murray Patterson, Roland Wittler, Cédric Chauve, Eric Tannier

BMC Bioinform., 2012

Turing Universality of Step-Wise and Stage Assembly at Temperature 1.

Bahar Behsaz, Ján Manuch, Ladislav Stacho

Proceedings of the DNA Computing and Molecular Programming - 18th International Conference, 2012

2011

NP-completeness of the energy barrier problem without pseudoknots and temporary arcs.

Ján Manuch, Chris Thachuk, Ladislav Stacho, Anne Condon

Nat. Comput., 2011

Consistency of Sequence-Based Gene Clusters.

Roland Wittler, Ján Manuch, Murray Patterson, Jens Stoye

J. Comput. Biol., 2011

The Complexity of the Gapped Consecutive-Ones Property Problem for Matrices of Bounded Maximum Degree.

Ján Manuch, Murray Patterson

J. Comput. Biol., 2011

Towards a Characterisation of the Generalised Cladistic Character Compatibility Problem for Non-branching Character Trees.

Ján Manuch, Murray Patterson, Arvind Gupta

Proceedings of the Bioinformatics Research and Applications - 7th International Symposium, 2011

Less Haste, Less Waste: On Recycling and Its Limits in Strand Displacement Systems.

Anne Condon, Alan J. Hu, Ján Manuch, Chris Thachuk

Proceedings of the DNA Computing and Molecular Programming - 17th International Conference, 2011

Tractability Results for the Consecutive-Ones Property with Multiplicity.

Cédric Chauve, Ján Manuch, Murray Patterson, Roland Wittler

Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

Evolutionary Conservation of Human Phosphorylation Sites.

Javad Safaei, Ján Manuch, Arvind Gupta, Ladislav Stacho, Steven Pelech

Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2011

2010

Two Lower Bounds for Self-Assemblies at Temperature 1.

Ján Manuch, Ladislav Stacho, Christine Stoll

J. Comput. Biol., 2010

Haplotype Inferring via Galled-Tree Networks Is NP-Complete.

Arvind Gupta, Mohammad M. Karimi, Ján Manuch, Ladislav Stacho, Xiaohong Zhao

J. Comput. Biol., 2010

An Algorithm for the Energy Barrier Problem Without Pseudoknots and Temporary Arcs.

Chris Thachuk, Ján Manuch, Arash Rafiey, Leigh-Anne Mathieson, Ladislav Stacho, Anne Condon

Proceedings of the Biocomputing 2010: Proceedings of the Pacific Symposium, 2010

Complexity of Finding Non-Planar Rectilinear Drawings of Graphs.

Ján Manuch, Murray Patterson, Sheung-Hung Poon, Chris Thachuk

Proceedings of the Graph Drawing - 18th International Symposium, 2010

Prediction of human protein kinase substrate specificities.

Javad Safaei, Ján Manuch, Arvind Gupta, Ladislav Stacho, Steven Pelech

Proceedings of the 2010 IEEE International Conference on Bioinformatics and Biomedicine, 2010

2009

Inverse Protein Folding in 3D Hexagonal Prism Lattice under HPC Model.

Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta

J. Comput. Biol., 2009

Stable Structure-Approximating Inverse Protein Folding in 2D Hydrophobic-Polar-Cysteine (HPC) Model.

Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta

J. Comput. Biol., 2009

On the Gapped Consecutive-Ones Property.

Cédric Chauve, Ján Manuch, Murray Patterson

Electron. Notes Discret. Math., 2009

Spanning cubic graph designs.

Peter Adams, Hayri Ardal, Ján Manuch, Vu Dinh Hoa, Moshe Rosenfeld, Ladislav Stacho

Discret. Math., 2009

The Odd-Distance Plane Graph.

Hayri Ardal, Ján Manuch, Moshe Rosenfeld, Saharon Shelah, Ladislav Stacho

Discret. Comput. Geom., 2009

Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices.

Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao

Discret. Appl. Math., 2009

Hardness Results for the Gapped Consecutive-Ones Property

Cédric Chauve, Ján Manuch, Murray Patterson

CoRR, 2009

Step-Assembly with a Constant Number of Tile Types.

Ján Manuch, Ladislav Stacho, Christine Stoll

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots.

Ján Manuch, Chris Thachuk, Ladislav Stacho, Anne Condon

Proceedings of the DNA Computing and Molecular Programming, 15th International Conference, 2009

On the Generalised Character Compatibility Problem for Non-branching Character Trees.

Ján Manuch, Murray Patterson, Arvind Gupta

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008

On the Complexity of Ordered Colorings.

Arvind Gupta, Jan van den Heuvel, Ján Manuch, Ladislav Stacho, Xiaohong Zhao

SIAM J. Discret. Math., 2008

Fitting protein Chains to cubic Lattice is NP-Complete.

Ján Manuch, Daya Ram Gaur

J. Bioinform. Comput. Biol., 2008

Haplotype Inferring Via Galled-Tree Networks Is NP-Complete.

Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis.

Anne Condon, Ján Manuch, Chris Thachuk

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

A Robust Class of Stable Proteins in the 2D HPC Model.

Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta

Proceedings of the Bioinformatics Research and Development, 2008

Inverse protein folding in 3D hexagonal prism lattice under HP model.

Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta

Proceedings of the International Conference on Bioinformatics & Computational Biology, 2008

Structure-Approximating Design of Stable Proteins in 2D HP Model Fortified by Cysteine Monomers.

Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta

Proceedings of the 6th Asia-Pacific Bioinformatics Conference, 2008

2007

Algorithm for Haplotype Inferring Via Galled-Tree Networks with Simple Galls.

Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao

Proceedings of the Bioinformatics Research and Applications, Third International Symposium, 2007

Design of Artificial Tubular Protein Structures in 3D Hexagonal Prism Lattice Under HP Model.

Arvind Gupta, Mehdi Karimi, Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey

Proceedings of the International Conference on Bioinformatics & Computational Biology, 2007

2006

Characterization of the Existence of Galled-tree Networks.

Arvind Gupta, Ján Manuch, Xiaohong Zhao, Ladislav Stacho

J. Bioinform. Comput. Biol., 2006

Constructing Camin-Sokal Phylogenies Via Answer Set Programming.

Jonathan Kavanagh, David G. Mitchell, Eugenia Ternovska, Ján Manuch, Xiaohong Zhao, Arvind Gupta

Proceedings of the Logic for Programming, 2006

Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start Times.

Daya Ram Gaur, Ramesh Krishnamurti, Ján Manuch

Proceedings of the Algorithms and Complexity in Durham 2006, 2006

2005

(quasi) Spanners for Mobile Ad Hoc Networks.

Petra Berenbrink, Tom Friedetzky, Ján Manuch, Ladislav Stacho

J. Interconnect. Networks, 2005

Structure-Approximating Inverse Protein Folding Problem in the 2D HP Model.

Arvind Gupta, Ján Manuch, Ladislav Stacho

J. Comput. Biol., 2005

Ordered 3-colorings.

Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao

Electron. Notes Discret. Math., 2005

2004

Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach.

Arvind Gupta, Ján Manuch, Ladislav Stacho

Proceedings of the Structural Information and Communication Complexity, 2004

Inverse Protein Folding in 2D HP Mode (Extended Abstract).

Arvind Gupta, Ján Manuch, Ladislav Stacho

Proceedings of the 3rd International IEEE Computer Society Computational Systems Bioinformatics Conference, 2004

Small Phylogeny Problem: Character Evolution Trees.

Arvind Gupta, Ján Manuch, Ladislav Stacho, Chenchen Zhu

Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

2003

A defect theorem for bi-infinite words.

Juhani Karhumäki, Ján Manuch, Wojciech Plandowski

Theor. Comput. Sci., 2003

On the computational complexity of infinite words.

Pavol Duris, Ján Manuch

Theor. Comput. Sci., 2003

On f-wise Arc Forwarding Index and Wavelength Allocations in Faulty All-optical Hypercubes.

Ján Manuch, Ladislav Stacho

RAIRO Theor. Informatics Appl., 2003

2002

Multiple factorizations of words and defect effect.

Juhani Karhumäki, Ján Manuch

Theor. Comput. Sci., 2002

2001

On Conjugacy of Languages.

Julien Cassaigne, Juhani Karhumäki, Ján Manuch

RAIRO Theor. Informatics Appl., 2001

Defect Effect of Bi-infinite Words in the Two-element Case.

Ján Manuch

Discret. Math. Theor. Comput. Sci., 2001

2000

Construction of very hard functions for multiparty communication complexity.

Ján Manuch

RAIRO Theor. Informatics Appl., 2000

1999

Fault-Tolerant Wavelength Allocations in All-optical Hypercubes.

Ján Manuch, Laszlo Stacho

Proceedings of the SIROCCO'99, 1999

Multiparty Communication Complexity: Very Hard Functions.

Ján Manuch

Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

Characterization of a word by its subwords.

Ján Manuch

Proceedings of the Developments in Language Theory, 1999

1998

On Defect Effect of Bi-Infinite Words.

Juhani Karhumäki, Ján Manuch, Wojciech Plandowski

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998