Ján Manuch

Publication Activity (10 Years)

Years Active: 1998-2020
Publications (10 Years): 16

Top Topics

Relational And Xml Data

Chemical Reaction

Precedence Constraints

Top Venues

Publications

Anne Condon, Monir Hajiaghayi, David G. Kirkpatrick, Ján Manuch
Approximate majority analyses using tri-molecular chemical reaction networks. Nat. Comput. 19 (1) (2020)
Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Manuch, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho
Weak Coverage of a Rectangular Barrier. Algorithmica 82 (4) (2020)
Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Manuch, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende, Ladislav Stacho
Weak Coverage of a Rectangular Barrier. CIAC (2017)
Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Manuch, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho
Weak Coverage of a Rectangular Barrier. CoRR (2017)
Ashok Rajaraman, João Paulo Pereira Zanetti, Ján Manuch, Cédric Chauve
Algorithms and Complexity Results for Genome Mapping Problems. IEEE ACM Trans. Comput. Biol. Bioinform. 14 (2) (2017)
Jozef Hales, Alice Héliou, Ján Manuch, Yann Ponty, Ladislav Stacho
Combinatorial RNA Design: Designability and Structure-Approximating Algorithm in Watson-Crick and Nussinov-Jacobson Energy Models. Algorithmica 79 (3) (2017)
Anne Condon, Bonnie Kirkpatrick, Ján Manuch
Design of nucleic acid strands with long low-barrier folding pathways. Nat. Comput. 16 (2) (2017)
Anne Condon, Monir Hajiaghayi, David G. Kirkpatrick, Ján Manuch
Simplifying Analyses of Chemical Reaction Networks for Approximate Majority. DNA (2017)
Stefan Dobrev, Mohsen Eftekhari Hesari, Fraser MacQuarie, Ján Manuch, Oscar Morales-Ponce, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho
Connectivity with directional antennas in the symmetric communication model. Comput. Geom. 55 (2016)
David Doty, Ho-Lin Chen, Ján Manuch, Arash Rafiey, Ladislav Stacho
Pattern overlap implies runaway growth in hierarchical tile systems. J. Comput. Geom. 7 (2) (2016)
Jozef Hales, Ján Manuch, Yann Ponty, Ladislav Stacho
Combinatorial RNA Design: Designability and Structure-Approximating Algorithm. CPM (2015)
Jeff Kinne, Ján Manuch, Akbar Rafiey, Arash Rafiey
Ordering with precedence constraints and budget minimization. CoRR (2015)
Jozef Hales, Ján Manuch, Yann Ponty, Ladislav Stacho
Combinatorial RNA Design: Designability and Structure-Approximating Algorithm. CoRR (2015)
Anne Condon, Ján Manuch, Chris Thachuk
The complexity of string partitioning. J. Discrete Algorithms 32 (2015)
Ho-Lin Chen, David Doty, Ján Manuch, Arash Rafiey, Ladislav Stacho
Pattern Overlap Implies Runaway Growth in Hierarchical Tile Systems. SoCG (2015)
Jurek Czyzowicz, Stefan Dobrev, Benson L. Joeris, Evangelos Kranakis, Danny Krizanc, Ján Manuch, Oscar Morales-Ponce, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia
Monitoring the Plane with Rotating Radars. Graphs Comb. 31 (2) (2015)
Ho-Lin Chen, David Doty, Ján Manuch, Arash Rafiey, Ladislav Stacho
Pattern overlap implies runaway growth in hierarchical tile systems. CoRR (2014)
Ján Manuch, Arash Rafiey
Finding minimum Tucker submatrices. CoRR (2014)
Anne Condon, Bonnie Kirkpatrick, Ján Manuch
Reachability bounds for chemical reaction networks and strand displacement systems. Nat. Comput. 13 (4) (2014)
Ján Manuch, Murray Patterson, Roland Wittler, Cédric Chauve, Eric Tannier
Linearization of ancestral multichromosomal genomes. CTW (2013)
Javad Safaei, Ján Manuch, Ladislav Stacho
Learning Polytrees with Constant Number of Roots from Data. Australasian Conference on Artificial Intelligence (2013)
Ján Manuch, Murray Patterson, Roland Wittler, Cédric Chauve, Eric Tannier
Linearization of ancestral multichromosomal genomes. BMC Bioinform. 13 (S-19) (2012)
Bahar Behsaz, Ján Manuch, Ladislav Stacho
Turing Universality of Step-Wise and Stage Assembly at Temperature 1. DNA (2012)
Anne Condon, Bonnie Kirkpatrick, Ján Manuch
Reachability Bounds for Chemical Reaction Networks and Strand Displacement Systems. DNA (2012)
Anne Condon, Ján Manuch, Chris Thachuk
The complexity of string partitioning CoRR (2012)
Ján Manuch, Ladislav Stacho, Christine Stoll
Step-wise tile assembly with a constant number of tile types. Nat. Comput. 11 (3) (2012)
Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
Algorithm for Haplotype Inference via Galled-Tree Networks with Simple Galls. J. Comput. Biol. 19 (4) (2012)
Anne Condon, Ján Manuch, Chris Thachuk
The Complexity of String Partitioning. CPM (2012)
Ján Manuch, Murray Patterson, Cédric Chauve
Hardness results on the gapped consecutive-ones property problem. Discret. Appl. Math. 160 (18) (2012)
Ján Manuch, Murray Patterson
The Complexity of the Gapped Consecutive-Ones Property Problem for Matrices of Bounded Maximum Degree. J. Comput. Biol. 18 (9) (2011)
Roland Wittler, Ján Manuch, Murray Patterson, Jens Stoye
Consistency of Sequence-Based Gene Clusters. J. Comput. Biol. 18 (9) (2011)
Ján Manuch, Chris Thachuk, Ladislav Stacho, Anne Condon
NP-completeness of the energy barrier problem without pseudoknots and temporary arcs. Nat. Comput. 10 (1) (2011)
Ján Manuch, Murray Patterson, Arvind Gupta
Towards a Characterisation of the Generalised Cladistic Character Compatibility Problem for Non-branching Character Trees. ISBRA (2011)
Javad Safaei, Ján Manuch, Arvind Gupta, Ladislav Stacho, Steven Pelech
Evolutionary Conservation of Human Phosphorylation Sites. BIBM (2011)
Cédric Chauve, Ján Manuch, Murray Patterson, Roland Wittler
Tractability Results for the Consecutive-Ones Property with Multiplicity. CPM (2011)
Anne Condon, Alan J. Hu, Ján Manuch, Chris Thachuk
Less Haste, Less Waste: On Recycling and Its Limits in Strand Displacement Systems. DNA (2011)
Ján Manuch, Ladislav Stacho, Christine Stoll
Two Lower Bounds for Self-Assemblies at Temperature 1. J. Comput. Biol. 17 (6) (2010)
Arvind Gupta, Mohammad M. Karimi, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
Haplotype Inferring via Galled-Tree Networks Is NP-Complete. J. Comput. Biol. 17 (10) (2010)
Ján Manuch, Murray Patterson
The Complexity of the Gapped Consecutive-Ones Property Problem for Matrices of Bounded Maximum Degree. RECOMB-CG (2010)
Chris Thachuk, Ján Manuch, Arash Rafiey, Leigh-Anne Mathieson, Ladislav Stacho, Anne Condon
An Algorithm for the Energy Barrier Problem Without Pseudoknots and Temporary Arcs. Pacific Symposium on Biocomputing (2010)
Javad Safaei, Ján Manuch, Arvind Gupta, Ladislav Stacho, Steven Pelech
Prediction of human protein kinase substrate specificities. BIBM (2010)
Ján Manuch, Murray Patterson, Sheung-Hung Poon, Chris Thachuk
Complexity of Finding Non-Planar Rectilinear Drawings of Graphs. Graph Drawing (2010)
Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta
Inverse Protein Folding in 3D Hexagonal Prism Lattice under HPC Model. J. Comput. Biol. 16 (6) (2009)
Hayri Ardal, Ján Manuch, Moshe Rosenfeld, Saharon Shelah, Ladislav Stacho
The Odd-Distance Plane Graph. Discret. Comput. Geom. 42 (2) (2009)
Cédric Chauve, Ján Manuch, Murray Patterson
Hardness Results for the Gapped Consecutive-Ones Property CoRR (2009)
Peter Adams, Hayri Ardal, Ján Manuch, Vu Dinh Hoa, Moshe Rosenfeld, Ladislav Stacho
Spanning cubic graph designs. Discret. Math. 309 (18) (2009)
Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta
Stable Structure-Approximating Inverse Protein Folding in 2D Hydrophobic-Polar-Cysteine (HPC) Model. J. Comput. Biol. 16 (1) (2009)
Ján Manuch, Ladislav Stacho, Christine Stoll
Step-Assembly with a Constant Number of Tile Types. ISAAC (2009)
Cédric Chauve, Ján Manuch, Murray Patterson
On the Gapped Consecutive-Ones Property. Electron. Notes Discret. Math. 34 (2009)
Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices. Discret. Appl. Math. 157 (10) (2009)
Ján Manuch, Ladislav Stacho, Christine Stoll
Two lower bounds for self-assemblies at temperature 1. SAC (2009)
Ján Manuch, Murray Patterson, Arvind Gupta
On the Generalised Character Compatibility Problem for Non-branching Character Trees. COCOON (2009)
Ján Manuch, Chris Thachuk, Ladislav Stacho, Anne Condon
NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots. DNA (2009)
Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta
Inverse protein folding in 3D hexagonal prism lattice under HP model. BIOCOMP (2008)
Anne Condon, Ján Manuch, Chris Thachuk
Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis. COCOON (2008)
Ján Manuch, Daya Ram Gaur
Fitting protein Chains to cubic Lattice is NP-Complete. J. Bioinform. Comput. Biol. 6 (1) (2008)
Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
Haplotype Inferring Via Galled-Tree Networks Is NP-Complete. COCOON (2008)
Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta
Structure-Approximating Design of Stable Proteins in 2D HP Model Fortified by Cysteine Monomers. APBC (2008)
Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta
A Robust Class of Stable Proteins in the 2D HPC Model. BIRD (2008)
Arvind Gupta, Jan van den Heuvel, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
On the Complexity of Ordered Colorings. SIAM J. Discret. Math. 22 (2) (2008)
Ján Manuch, Daya Ram Gaur
Fitting Protein Chains to Cubic Lattice is NP-Complete. APBC (2007)
Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
Algorithm for Haplotype Inferring Via Galled-Tree Networks with Simple Galls. ISBRA (2007)
Arvind Gupta, Mehdi Karimi, Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey
Design of Artificial Tubular Protein Structures in 3D Hexagonal Prism Lattice Under HP Model. BIOCOMP (2007)
Ján Manuch, Xiaohong Zhao, Ladislav Stacho, Arvind Gupta
Characterization of the Existence of Galled-Tree Networks. APBC (2006)
Jonathan Kavanagh, David G. Mitchell, Eugenia Ternovska, Ján Manuch, Xiaohong Zhao, Arvind Gupta
Constructing Camin-Sokal Phylogenies Via Answer Set Programming. LPAR (2006)
Arvind Gupta, Ján Manuch, Xiaohong Zhao, Ladislav Stacho
Characterization of the Existence of Galled-tree Networks. J. Bioinform. Comput. Biol. 4 (6) (2006)
Daya Ram Gaur, Ramesh Krishnamurti, Ján Manuch
Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start Times. ACiD (2006)
Petra Berenbrink, Tom Friedetzky, Ján Manuch, Ladislav Stacho
(quasi) Spanners for Mobile Ad Hoc Networks. J. Interconnect. Networks 6 (2) (2005)
Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
Ordered 3-colorings. Electron. Notes Discret. Math. 22 (2005)
Arvind Gupta, Ján Manuch, Ladislav Stacho
Structure-Approximating Inverse Protein Folding Problem in the 2D HP Model. J. Comput. Biol. 12 (10) (2005)
Arvind Gupta, Ján Manuch, Ladislav Stacho
Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach. SIROCCO (2004)
Arvind Gupta, Ján Manuch, Ladislav Stacho
Inverse Protein Folding in 2D HP Mode (Extended Abstract). CSB (2004)
Arvind Gupta, Ján Manuch, Ladislav Stacho, Chenchen Zhu
Small Phylogeny Problem: Character Evolution Trees. CPM (2004)
Juhani Karhumäki, Ján Manuch, Wojciech Plandowski
A defect theorem for bi-infinite words. Theor. Comput. Sci. 292 (1) (2003)
Pavol Duris, Ján Manuch
On the computational complexity of infinite words. Theor. Comput. Sci. 295 (2003)
Ján Manuch, Ladislav Stacho
On f-wise Arc Forwarding Index and Wavelength Allocations in Faulty All-optical Hypercubes. RAIRO Theor. Informatics Appl. 37 (3) (2003)
Juhani Karhumäki, Ján Manuch
Multiple factorizations of words and defect effect. Theor. Comput. Sci. 273 (1-2) (2002)
Julien Cassaigne, Juhani Karhumäki, Ján Manuch
On Conjugacy of Languages. RAIRO Theor. Informatics Appl. 35 (6) (2001)
Ján Manuch
Defect Effect of Bi-infinite Words in the Two-element Case. Discret. Math. Theor. Comput. Sci. 4 (2) (2001)
Pavol Duris, Ján Manuch
On the Computational Complexity of Infinite Words. MFCS (2001)
Ján Manuch
Construction of very hard functions for multiparty communication complexity. RAIRO Theor. Informatics Appl. 34 (1) (2000)
Ján Manuch
Characterization of a word by its subwords. Developments in Language Theory (1999)
Ján Manuch, Laszlo Stacho
Fault-Tolerant Wavelength Allocations in All-optical Hypercubes. SIROCCO (1999)
Ján Manuch
Multiparty Communication Complexity: Very Hard Functions. MFCS (1999)
Juhani Karhumäki, Ján Manuch, Wojciech Plandowski
On Defect Effect of Bi-Infinite Words. MFCS (1998)