default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJán Manuch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[j38]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): 721-746 (2020)- [j37]Anne Condon, Monir Hajiaghayi, David G. Kirkpatrick, Ján Manuch:
Approximate majority analyses using tri-molecular chemical reaction networks. Nat. Comput. 19(1): 249-270 (2020)
2010 – 2019
- 2017
- [j36]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): 835-856 (2017) - [j35]Anne Condon, Bonnie Kirkpatrick, Ján Manuch:
Design of nucleic acid strands with long low-barrier folding pathways. Nat. Comput. 16(2): 261-284 (2017) - [j34]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): 418-430 (2017) - [c39]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: 196-208 - [c38]Anne Condon, Monir Hajiaghayi, David G. Kirkpatrick, Ján Manuch:
Simplifying Analyses of Chemical Reaction Networks for Approximate Majority. DNA 2017: 188-209 - [i8]Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Manuch, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho:
Weak Coverage of a Rectangular Barrier. CoRR abs/1701.07294 (2017) - 2016
- [j33]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: 1-25 (2016) - [j32]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): 3-18 (2016) - 2015
- [j31]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): 393-405 (2015) - [j30]Anne Condon, Ján Manuch, Chris Thachuk:
The complexity of string partitioning. J. Discrete Algorithms 32: 24-43 (2015) - [c37]Ho-Lin Chen, David Doty, Ján Manuch, Arash Rafiey, Ladislav Stacho:
Pattern Overlap Implies Runaway Growth in Hierarchical Tile Systems. SoCG 2015: 360-373 - [c36]Jozef Hales, Ján Manuch, Yann Ponty, Ladislav Stacho:
Combinatorial RNA Design: Designability and Structure-Approximating Algorithm. CPM 2015: 231-246 - [i7]Jozef Hales, Ján Manuch, Yann Ponty, Ladislav Stacho:
Combinatorial RNA Design: Designability and Structure-Approximating Algorithm. CoRR abs/1502.03201 (2015) - [i6]Jeff Kinne, Ján Manuch, Akbar Rafiey, Arash Rafiey:
Ordering with precedence constraints and budget minimization. CoRR abs/1507.04885 (2015) - 2014
- [j29]Anne Condon, Bonnie Kirkpatrick, Ján Manuch:
Reachability bounds for chemical reaction networks and strand displacement systems. Nat. Comput. 13(4): 499-516 (2014) - [i5]Ján Manuch, Arash Rafiey:
Finding minimum Tucker submatrices. CoRR abs/1401.4739 (2014) - [i4]Ho-Lin Chen, David Doty, Ján Manuch, Arash Rafiey, Ladislav Stacho:
Pattern overlap implies runaway growth in hierarchical tile systems. CoRR abs/1411.6672 (2014) - 2013
- [c35]Javad Safaei, Ján Manuch, Ladislav Stacho:
Learning Polytrees with Constant Number of Roots from Data. Australasian Conference on Artificial Intelligence 2013: 447-452 - [i3]Ján Manuch, Murray Patterson, Roland Wittler, Cédric Chauve, Eric Tannier:
Linearization of ancestral multichromosomal genomes. CTW 2013: 169-173 - 2012
- [j28]Ján Manuch, Murray Patterson, Roland Wittler, Cédric Chauve, Eric Tannier:
Linearization of ancestral multichromosomal genomes. BMC Bioinform. 13(S-19): S11 (2012) - [j27]Ján Manuch, Murray Patterson, Cédric Chauve:
Hardness results on the gapped consecutive-ones property problem. Discret. Appl. Math. 160(18): 2760-2768 (2012) - [j26]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): 439-454 (2012) - [j25]Ján Manuch, Ladislav Stacho, Christine Stoll:
Step-wise tile assembly with a constant number of tile types. Nat. Comput. 11(3): 535-550 (2012) - [c34]Anne Condon, Ján Manuch, Chris Thachuk:
The Complexity of String Partitioning. CPM 2012: 159-172 - [c33]Bahar Behsaz, Ján Manuch, Ladislav Stacho:
Turing Universality of Step-Wise and Stage Assembly at Temperature 1. DNA 2012: 1-11 - [c32]Anne Condon, Bonnie Kirkpatrick, Ján Manuch:
Reachability Bounds for Chemical Reaction Networks and Strand Displacement Systems. DNA 2012: 43-57 - [i2]Anne Condon, Ján Manuch, Chris Thachuk:
The complexity of string partitioning. CoRR abs/1204.2201 (2012) - 2011
- [j24]Roland Wittler, Ján Manuch, Murray Patterson, Jens Stoye:
Consistency of Sequence-Based Gene Clusters. J. Comput. Biol. 18(9): 1023-1039 (2011) - [j23]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): 1243-1253 (2011) - [j22]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): 391-405 (2011) - [c31]Javad Safaei, Ján Manuch, Arvind Gupta, Ladislav Stacho, Steven Pelech:
Evolutionary Conservation of Human Phosphorylation Sites. BIBM 2011: 222-227 - [c30]Cédric Chauve, Ján Manuch, Murray Patterson, Roland Wittler:
Tractability Results for the Consecutive-Ones Property with Multiplicity. CPM 2011: 90-103 - [c29]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: 84-99 - [c28]Ján Manuch, Murray Patterson, Arvind Gupta:
Towards a Characterisation of the Generalised Cladistic Character Compatibility Problem for Non-branching Character Trees. ISBRA 2011: 440-451 - 2010
- [j21]Ján Manuch, Ladislav Stacho, Christine Stoll:
Two Lower Bounds for Self-Assemblies at Temperature 1. J. Comput. Biol. 17(6): 841-852 (2010) - [j20]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): 1435-1449 (2010) - [c27]Javad Safaei, Ján Manuch, Arvind Gupta, Ladislav Stacho, Steven Pelech:
Prediction of human protein kinase substrate specificities. BIBM 2010: 259-264 - [c26]Ján Manuch, Murray Patterson, Sheung-Hung Poon, Chris Thachuk:
Complexity of Finding Non-Planar Rectilinear Drawings of Graphs. GD 2010: 305-316 - [c25]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: 108-119 - [c24]Ján Manuch, Murray Patterson:
The Complexity of the Gapped Consecutive-Ones Property Problem for Matrices of Bounded Maximum Degree. RECOMB-CG 2010: 278-289
2000 – 2009
- 2009
- [j19]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): 2310-2324 (2009) - [j18]Hayri Ardal, Ján Manuch, Moshe Rosenfeld, Saharon Shelah, Ladislav Stacho:
The Odd-Distance Plane Graph. Discret. Comput. Geom. 42(2): 132-141 (2009) - [j17]Peter Adams, Hayri Ardal, Ján Manuch, Vu Dinh Hoa, Moshe Rosenfeld, Ladislav Stacho:
Spanning cubic graph designs. Discret. Math. 309(18): 5781-5788 (2009) - [j16]Cédric Chauve, Ján Manuch, Murray Patterson:
On the Gapped Consecutive-Ones Property. Electron. Notes Discret. Math. 34: 121-125 (2009) - [j15]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): 19-30 (2009) - [j14]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): 769-802 (2009) - [c23]Ján Manuch, Murray Patterson, Arvind Gupta:
On the Generalised Character Compatibility Problem for Non-branching Character Trees. COCOON 2009: 268-276 - [c22]Ján Manuch, Chris Thachuk, Ladislav Stacho, Anne Condon:
NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots. DNA 2009: 106-115 - [c21]Ján Manuch, Ladislav Stacho, Christine Stoll:
Step-Assembly with a Constant Number of Tile Types. ISAAC 2009: 954-963 - [c20]Ján Manuch, Ladislav Stacho, Christine Stoll:
Two lower bounds for self-assemblies at temperature 1. SAC 2009: 808-809 - [i1]Cédric Chauve, Ján Manuch, Murray Patterson:
Hardness Results for the Gapped Consecutive-Ones Property. CoRR abs/0912.0309 (2009) - 2008
- [j13]Ján Manuch, Daya Ram Gaur:
Fitting protein Chains to cubic Lattice is NP-Complete. J. Bioinform. Comput. Biol. 6(1): 93-106 (2008) - [j12]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): 832-847 (2008) - [c19]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: 49-58 - [c18]Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta:
Inverse protein folding in 3D hexagonal prism lattice under HP model. BIOCOMP 2008: 619-625 - [c17]Alireza Hadj Khodabakhshi, Ján Manuch, Arash Rafiey, Arvind Gupta:
A Robust Class of Stable Proteins in the 2D HPC Model. BIRD 2008: 180-192 - [c16]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: 265-275 - [c15]Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao:
Haplotype Inferring Via Galled-Tree Networks Is NP-Complete. COCOON 2008: 287-298 - 2007
- [c14]Ján Manuch, Daya Ram Gaur:
Fitting Protein Chains to Cubic Lattice is NP-Complete. APBC 2007: 153-164 - [c13]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: 362-369 - [c12]Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao:
Algorithm for Haplotype Inferring Via Galled-Tree Networks with Simple Galls. ISBRA 2007: 121-132 - 2006
- [j11]Arvind Gupta, Ján Manuch, Xiaohong Zhao, Ladislav Stacho:
Characterization of the Existence of Galled-tree Networks. J. Bioinform. Comput. Biol. 4(6): 1309-1328 (2006) - [c11]Daya Ram Gaur, Ramesh Krishnamurti, Ján Manuch:
Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start Times. ACiD 2006: 85-94 - [c10]Ján Manuch, Xiaohong Zhao, Ladislav Stacho, Arvind Gupta:
Characterization of the Existence of Galled-Tree Networks. APBC 2006: 297-306 - [c9]Jonathan Kavanagh, David G. Mitchell, Eugenia Ternovska, Ján Manuch, Xiaohong Zhao, Arvind Gupta:
Constructing Camin-Sokal Phylogenies Via Answer Set Programming. LPAR 2006: 452-466 - 2005
- [j10]Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao:
Ordered 3-colorings. Electron. Notes Discret. Math. 22: 299-300 (2005) - [j9]Arvind Gupta, Ján Manuch, Ladislav Stacho:
Structure-Approximating Inverse Protein Folding Problem in the 2D HP Model. J. Comput. Biol. 12(10): 1328-1345 (2005) - [j8]Petra Berenbrink, Tom Friedetzky, Ján Manuch, Ladislav Stacho:
(quasi) Spanners for Mobile Ad Hoc Networks. J. Interconnect. Networks 6(2): 63-84 (2005) - 2004
- [c8]Arvind Gupta, Ján Manuch, Ladislav Stacho, Chenchen Zhu:
Small Phylogeny Problem: Character Evolution Trees. CPM 2004: 230-243 - [c7]Arvind Gupta, Ján Manuch, Ladislav Stacho:
Inverse Protein Folding in 2D HP Mode (Extended Abstract). CSB 2004: 311-318 - [c6]Arvind Gupta, Ján Manuch, Ladislav Stacho:
Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach. SIROCCO 2004: 197-208 - 2003
- [j7]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): 255-270 (2003) - [j6]Juhani Karhumäki, Ján Manuch, Wojciech Plandowski:
A defect theorem for bi-infinite words. Theor. Comput. Sci. 292(1): 237-243 (2003) - [j5]Pavol Duris, Ján Manuch:
On the computational complexity of infinite words. Theor. Comput. Sci. 295: 141-151 (2003) - 2002
- [j4]Juhani Karhumäki, Ján Manuch:
Multiple factorizations of words and defect effect. Theor. Comput. Sci. 273(1-2): 81-97 (2002) - 2001
- [j3]Ján Manuch:
Defect Effect of Bi-infinite Words in the Two-element Case. Discret. Math. Theor. Comput. Sci. 4(2): 273-290 (2001) - [j2]Julien Cassaigne, Juhani Karhumäki, Ján Manuch:
On Conjugacy of Languages. RAIRO Theor. Informatics Appl. 35(6): 535-550 (2001) - [c5]Pavol Duris, Ján Manuch:
On the Computational Complexity of Infinite Words. MFCS 2001: 328-337 - 2000
- [j1]Ján Manuch:
Construction of very hard functions for multiparty communication complexity. RAIRO Theor. Informatics Appl. 34(1): 61-76 (2000)
1990 – 1999
- 1999
- [c4]Ján Manuch:
Characterization of a word by its subwords. Developments in Language Theory 1999: 210-219 - [c3]Ján Manuch:
Multiparty Communication Complexity: Very Hard Functions. MFCS 1999: 160-169 - [c2]Ján Manuch, Laszlo Stacho:
Fault-Tolerant Wavelength Allocations in All-optical Hypercubes. SIROCCO 1999: 219-222 - 1998
- [c1]Juhani Karhumäki, Ján Manuch, Wojciech Plandowski:
On Defect Effect of Bi-Infinite Words. MFCS 1998: 674-682
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
