Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Ma{\v{n}}uch, J{\'a}n"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The complexity of string partitioning
Anne Condon
,
Ján Man̑uch
,
Chris Thachuk
Lecture Notes in Computer Science
7354
, 2012, pp. 159-172
Tractability results for the consecutive-ones property with multiplicity
Cedric Chauve
,
Ján Man̑uch
,
Murray Patterson
,
Roland Wittler
Lecture Notes in Computer Science
6661
, 2011, pp. 90-103
Complexity of finding non-planar rectilinear drawings of graphs
Ján Man̑uch
,
Murray Patterson
,
Sheung-Hung Poon
,
Chris Thachuk
Lecture Notes in Computer Science
6502
, 2011, pp. 305-316
The complexity of the gapped consecutive-ones property problem for matrices of bounded maximum degree
Ján Man̑uch
,
Murray Patterson
LNCS/LNBI
6398
, 2010, pp. 278-289
On the generalised character compatibility problem for non-branching character trees
Ján Man̑uch
,
Murray Patterson
,
Arvind Gupta
Lecture Notes in Computer Science
5609
, 2009, pp. 268-276
Step-assembly with a constant number of tile types
Ján Man̑uch
,
Ladislav Stacho
,
Christine Stoll
Lecture Notes in Computer Science
5878
, 2009, pp. 954-963
Complexity of a collision-aware string partition problem and its relation to oligo design for gene synthesis
Anne Condon
,
Ján Man̑uch
,
Chris Thachuk
Lecture Notes in Computer Science
5092
, 2008, pp. 265-275
Complexity of a collision-aware string partition problem and its relation to oligo design for gene synthesis
Anne Condon
,
Ján Man̑uch
,
Chris Thachuk
Lecture Notes in Computer Science
5092
, 2008, pp. 265-275
Haplotype inferring via galled-tree networks is
NP
-complete
Arvind Gupta
,
Ján Man̑uch
,
Ladislav Stacho
,
Xiaohong Zhao
Lecture Notes in Computer Science
5092
, 2008, pp. 287-298
Haplotype inferring via galled-tree networks is
NP
-complete
Arvind Gupta
,
Ján Man̑uch
,
Ladislav Stacho
,
Xiaohong Zhao
Lecture Notes in Computer Science
5092
, 2008, pp. 287-298
On the complexity of ordered colorings
Arvind Gupta
,
Jan van den Heuvel
,
Ján Man̑uch
,
Ladislav Stacho
,
Xiaohong Zhao
SIAM Journal on Discrete Mathematics
22
(2), 2008, pp. 832-847
Small phylogeny problem: Character evolution trees
Arvind Gupta
,
Ján Man̑uch
,
Ladislav Stacho
,
Chenchen Zhu
Lecture Notes in Computer Science
3109
, 2004, pp. 230-243
On the computational complexity of infinite words
Pavol D̑uris̑
,
Ján Man̑uch
Theoretical Computer Science
295
(1-3), 2003, pp. 141-151