Deciding the existence of a cherry-picking sequence is hard on two trees

dc.contributor.author	Döcker, Janosch
dc.date.accessioned	2020-03-30T15:15:08Z
dc.date.available	2020-03-30T15:15:08Z
dc.date.issued	2019
dc.identifier.issn	1872-6771
dc.identifier.uri	http://hdl.handle.net/10900/99404
dc.language.iso	en	de_DE
dc.publisher	Elsevier Science Bv	de_DE
dc.relation.uri	http://dx.doi.org/10.1016/j.dam.2019.01.031	de_DE
dc.subject.ddc	510	de_DE
dc.title	Deciding the existence of a cherry-picking sequence is hard on two trees	de_DE
dc.type	Article	de_DE
utue.quellen.id	20190926111821_01360
utue.publikation.seiten	131-143	de_DE
utue.personen.roh	Doecker, Janosch
utue.personen.roh	van Iersel, Leo
utue.personen.roh	Kelk, Steven
utue.personen.roh	Linz, Simone
dcterms.isPartOf.ZSTitelID	Discrete Applied Mathematics	de_DE
dcterms.isPartOf.ZS-Volume	260	de_DE
utue.fakultaet	07 Mathematisch-Naturwissenschaftliche Fakultät	de_DE