default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJán Manuch
- > Home > Persons > Ján Manuch
Publications
- 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)- 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) - [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 - [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) - [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) - 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 - 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) - [c33]Bahar Behsaz, Ján Manuch, Ladislav Stacho:
Turing Universality of Step-Wise and Stage Assembly at Temperature 1. DNA 2012: 1-11 - 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 - 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 - [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 - 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) - [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 - 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) - [c15]Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao:
Haplotype Inferring Via Galled-Tree Networks Is NP-Complete. COCOON 2008: 287-298 - 2007
- [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) - [c10]Ján Manuch, Xiaohong Zhao, Ladislav Stacho, Arvind Gupta:
Characterization of the Existence of Galled-Tree Networks. APBC 2006: 297-306 - 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)
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 2024-05-08 21:02 CEST 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:
