Ján Manuch

2009
33	EE	Ján Manuch, Ladislav Stacho, Christine Stoll: Two lower bounds for self-assemblies at temperature 1. SAC 2009: 808-809
2008
32	EE	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
31		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
30	EE	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
29	EE	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
28	EE	Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: Haplotype Inferring Via Galled-Tree Networks Is NP-Complete. COCOON 2008: 287-298
27	EE	Ján Manuch, Daya Ram Gaur: Fitting protein Chains to cubic Lattice is NP-Complete. J. Bioinformatics and Computational Biology 6(1): 93-106 (2008)
26	EE	Arvind Gupta, Jan van den Heuvel, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: On the Complexity of Ordered Colorings. SIAM J. Discrete Math. 22(2): 832-847 (2008)
2007
25	EE	Ján Manuch, Daya Ram Gaur: Fitting Protein Chains to Cubic Lattice is NP-Complete. APBC 2007: 153-164
24		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
23	EE	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
22		Daya Ram Gaur, Ramesh Krishnamurti, Ján Manuch: Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start Times. ACiD 2006: 85-94
21	EE	Ján Manuch, Xiaohong Zhao, Ladislav Stacho, Arvind Gupta: Characterization of the Existence of Galled-Tree Networks. APBC 2006: 297-306
20	EE	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
19	EE	Arvind Gupta, Ján Manuch, Xiaohong Zhao, Ladislav Stacho: Characterization of the Existence of Galled-tree Networks. J. Bioinformatics and Computational Biology 4(6): 1309-1328 (2006)
2005
18	EE	Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: Ordered 3-colorings. Electronic Notes in Discrete Mathematics 22: 299-300 (2005)
17	EE	Arvind Gupta, Ján Manuch, Ladislav Stacho: Structure-Approximating Inverse Protein Folding Problem in the 2D HP Model. Journal of Computational Biology 12(10): 1328-1345 (2005)
16	EE	Petra Berenbrink, Tom Friedetzky, Ján Manuch, Ladislav Stacho: (quasi) Spanners for Mobile Ad Hoc Networks. Journal of Interconnection Networks 6(2): 63-84 (2005)
2004
15	EE	Arvind Gupta, Ján Manuch, Ladislav Stacho, Chenchen Zhu: Small Phylogeny Problem: Character Evolution Trees. CPM 2004: 230-243
14	EE	Arvind Gupta, Ján Manuch, Ladislav Stacho: Inverse Protein Folding in 2D HP Mode (Extended Abstract). CSB 2004: 311-318
13	EE	Arvind Gupta, Ján Manuch, Ladislav Stacho: Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach. SIROCCO 2004: 197-208
2003
12	EE	Ján Manuch, Ladislav Stacho: On f-wise Arc Forwarding Index and Wavelength Allocations in Faulty All-optical Hypercubes. ITA 37(3): 255-270 (2003)
11		Juhani Karhumäki, Ján Manuch, Wojciech Plandowski: A defect theorem for bi-infinite words. Theor. Comput. Sci. 292(1): 237-243 (2003)
10	EE	Pavol Duris, Ján Manuch: On the computational complexity of infinite words. Theor. Comput. Sci. 295: 141-151 (2003)
2002
9	EE	Juhani Karhumäki, Ján Manuch: Multiple factorizations of words and defect effect. Theor. Comput. Sci. 273(1-2): 81-97 (2002)
2001
8	EE	Pavol Duris, Ján Manuch: On the Computational Complexity of Infinite Words. MFCS 2001: 328-337
7	EE	Ján Manuch: Defect Effect of Bi-infinite Words in the Two-element Case. Discrete Mathematics & Theoretical Computer Science 4(2): 273-290 (2001)
6	EE	Julien Cassaigne, Juhani Karhumäki, Ján Manuch: On Conjugacy of Languages. ITA 35(6): 535-550 (2001)
2000
5		Ján Manuch: Construction of very hard functions for multiparty communication complexity. ITA 34(1): 61-76 (2000)
1999
4		Ján Manuch: Characterization of a word by its subwords. Developments in Language Theory 1999: 210-219
3		Ján Manuch: Multiparty Communication Complexity: Very Hard Functions. MFCS 1999: 160-169
2		Ján Manuch, Laszlo L. Stachó: Fault-Tolerant Wavelength Allocations in All-optical Hypercubes. SIROCCO 1999: 219-222
1998
1	EE	Juhani Karhumäki, Ján Manuch, Wojciech Plandowski: On Defect Effect of Bi-Infinite Words. MFCS 1998: 674-682

Coauthor Index

1	Petra Berenbrink	[16]
2	Julien Cassaigne	[6]
3	Anne Condon	[29]
4	Pavol Duris	[8] [10]
5	Tom Friedetzky	[16]
6	Daya Ram Gaur	[22] [25] [27]
7	Arvind Gupta	[13] [14] [15] [17] [18] [19] [20] [21] [23] [24] [26] [28] [30] [31] [32]
8	Jan van den Heuvel	[26]
9	Juhani Karhumäki	[1] [6] [9] [11]
10	Mehdi Karimi	[24]
11	Jonathan Kavanagh	[20]
12	Alireza Hadj Khodabakhshi	[24] [30] [31] [32]
13	Ramesh Krishnamurti	[22]
14	David G. Mitchell	[20]
15	Wojciech Plandowski	[1] [11]
16	Arash Rafiey	[24] [30] [31] [32]
17	Ladislav Stacho	[12] [13] [14] [15] [16] [17] [18] [19] [21] [23] [26] [28] [33]
18	Laszlo L. Stachó	[2]
19	Christine Stoll	[33]
20	Eugenia Ternovska (Eugenia Ternovskaia)	[20]
21	Chris Thachuk	[29]
22	Xiaohong Zhao	[18] [19] [20] [21] [23] [26] [28]
23	Chenchen Zhu	[15]

Colors in the list of coauthors