Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Journal Article
%1 journals/dam/DockerIKL19
%A Döcker, Janosch
%A van Iersel, Leo
%A Kelk, Steven
%A Linz, Simone
%D 2019
%J Discret. Appl. Math.
%K dblp
%P 131-143
%T Deciding the existence of a cherry-picking sequence is hard on two trees.
%U http://dblp.uni-trier.de/db/journals/dam/dam260.html#DockerIKL19
%V 260
@article{journals/dam/DockerIKL19,
added-at = {2020-02-20T00:00:00.000+0100},
author = {Döcker, Janosch and van Iersel, Leo and Kelk, Steven and Linz, Simone},
biburl = {https://www.bibsonomy.org/bibtex/275994b542b643ba439953854f4de84be/dblp},
ee = {https://doi.org/10.1016/j.dam.2019.01.031},
interhash = {3076c79d8041f47876cec5053396141b},
intrahash = {75994b542b643ba439953854f4de84be},
journal = {Discret. Appl. Math.},
keywords = {dblp},
pages = {131-143},
timestamp = {2020-02-21T12:39:27.000+0100},
title = {Deciding the existence of a cherry-picking sequence is hard on two trees.},
url = {http://dblp.uni-trier.de/db/journals/dam/dam260.html#DockerIKL19},
volume = 260,
year = 2019
}