Ján Manuch

	2012
51		Anne Condon, Ján Manuch, Chris Thachuk: The complexity of string partitioning CoRR abs/1204.2201: (2012)
	2011
50		Javad Safaei, Ján Manuch, Arvind Gupta, Ladislav Stacho, Steven Pelech: Evolutionary Conservation of Human Phosphorylation Sites. BIBM 2011: 222-227
49		Cedric Chauve, Ján Manuch, Murray Patterson, Roland Wittler: Tractability Results for the Consecutive-Ones Property with Multiplicity. CPM 2011: 90-103
48		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
47		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
46		Ján Manuch, Chris Thachuk, Ladislav Stacho, Anne Condon: NP-completeness of the energy barrier problem without pseudoknots and temporary arcs. Natural Computing 10(1): 391-405 (2011)
	2010
45		Javad Safaei, Ján Manuch, Arvind Gupta, Ladislav Stacho, Steven Pelech: Prediction of human protein kinase substrate specificities. BIBM 2010: 259-264
44		Ján Manuch, Murray Patterson, Sheung-Hung Poon, Chris Thachuk: Complexity of Finding Non-Planar Rectilinear Drawings of Graphs. Graph Drawing 2010: 305-316
43		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
42		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
	2009
41		Ján Manuch, Murray Patterson, Arvind Gupta: On the Generalised Character Compatibility Problem for Non-branching Character Trees. COCOON 2009: 268-276
40		Ján Manuch, Chris Thachuk, Ladislav Stacho, Anne Condon: NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots. DNA 2009: 106-115
39		Ján Manuch, Ladislav Stacho, Christine Stoll: Step-Assembly with a Constant Number of Tile Types. ISAAC 2009: 954-963
38		Ján Manuch, Ladislav Stacho, Christine Stoll: Two lower bounds for self-assemblies at temperature 1. SAC 2009: 808-809
37		Cedric Chauve, Ján Manuch, Murray Patterson: Hardness Results for the Gapped Consecutive-Ones Property CoRR abs/0912.0309: (2009)
36		Hayri Ardal, Ján Manuch, Moshe Rosenfeld, Saharon Shelah, Ladislav Stacho: The Odd-Distance Plane Graph. Discrete & Computational Geometry 42(2): 132-141 (2009)
35		Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices. Discrete Applied Mathematics 157(10): 2310-2324 (2009)
34		Peter Adams, Hayri Ardal, Ján Manuch, Vu Dinh Hoa, Moshe Rosenfeld, Ladislav Stacho: Spanning cubic graph designs. Discrete Mathematics 309(18): 5781-5788 (2009)
33		Cedric Chauve, Ján Manuch, Murray Patterson: On the Gapped Consecutive-Ones Property. Electronic Notes in Discrete Mathematics 34: 121-125 (2009)
	2008
32		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		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		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		Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: Haplotype Inferring Via Galled-Tree Networks Is NP-Complete. COCOON 2008: 287-298
27		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		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		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		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		Ján Manuch, Xiaohong Zhao, Ladislav Stacho, Arvind Gupta: Characterization of the Existence of Galled-Tree Networks. APBC 2006: 297-306
20		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		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		Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao: Ordered 3-colorings. Electronic Notes in Discrete Mathematics 22: 299-300 (2005)
17		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		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		Arvind Gupta, Ján Manuch, Ladislav Stacho, Chenchen Zhu: Small Phylogeny Problem: Character Evolution Trees. CPM 2004: 230-243
14		Arvind Gupta, Ján Manuch, Ladislav Stacho: Inverse Protein Folding in 2D HP Mode (Extended Abstract). CSB 2004: 311-318
13		Arvind Gupta, Ján Manuch, Ladislav Stacho: Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach. SIROCCO 2004: 197-208
	2003
12		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		Pavol Duris, Ján Manuch: On the computational complexity of infinite words. Theor. Comput. Sci. 295: 141-151 (2003)
	2002
9		Juhani Karhumäki, Ján Manuch: Multiple factorizations of words and defect effect. Theor. Comput. Sci. 273(1-2): 81-97 (2002)
	2001
8		Pavol Duris, Ján Manuch: On the Computational Complexity of Infinite Words. MFCS 2001: 328-337
7		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		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 Stacho: Fault-Tolerant Wavelength Allocations in All-optical Hypercubes. SIROCCO 1999: 219-222
	1998
1		Juhani Karhumäki, Ján Manuch, Wojciech Plandowski: On Defect Effect of Bi-Infinite Words. MFCS 1998: 674-682

Coauthor Index

1	Peter Adams	[34]
2	Hayri Ardal	[34] [36]
3	Petra Berenbrink	[16]
4	Julien Cassaigne	[6]
5	Cedric Chauve	[33] [37] [49]
6	Anne Condon	[29] [40] [43] [46] [48] [51]
7	Pavol Duris	[8] [10]
8	Tom Friedetzky	[16]
9	Daya Ram Gaur	[22] [25] [27]
10	Arvind Gupta	[13] [14] [15] [17] [18] [19] [20] [21] [23] [24] [26] [28] [30] [31] [32] [35] [41] [45] [47] [50]
11	Jan van den Heuvel	[26]
12	Vu Dinh Hoa	[34]
13	Alan J. Hu	[48]
14	Juhani Karhumäki	[1] [6] [9] [11]
15	Mehdi Karimi	[24]
16	Jonathan Kavanagh	[20]
17	Alireza Hadj Khodabakhshi	[24] [30] [31] [32]
18	Ramesh Krishnamurti	[22]
19	Leigh-Anne Mathieson	[43]
20	David G. Mitchell	[20]
21	Murray Patterson	[33] [37] [41] [42] [44] [47] [49]
22	Steven Pelech	[45] [50]
23	Wojciech Plandowski	[1] [11]
24	Sheung-Hung Poon	[44]
25	Arash Rafiey	[24] [30] [31] [32] [43]
26	Moshe Rosenfeld	[34] [36]
27	Javad Safaei	[45] [50]
28	Saharon Shelah	[36]
29	Ladislav Stacho	[12] [13] [14] [15] [16] [17] [18] [19] [21] [23] [26] [28] [34] [35] [36] [38] [39] [40] [43] [45] [46] [50]
30	Laszlo Stacho	[2]
31	Christine Stoll	[38] [39]
32	Eugenia Ternovska (Eugenia Ternovskaia)	[20]
33	Chris Thachuk	[29] [40] [43] [44] [46] [48] [51]
34	Roland Wittler	[49]
35	Xiaohong Zhao	[18] [19] [20] [21] [23] [26] [28] [35]
36	Chenchen Zhu	[15]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page