%0 Conference Paper %1 conf/iscopt/AndoS16 %A Ando, Kazutoshi %A Sato, Koki %B ISCO %D 2016 %E Cerulli, Raffaele %E Fujishige, Satoru %E Mahjoub, Ali Ridha %I Springer %K dblp %P 249-259 %T An Algorithm for Finding a Representation of a Subtree Distance. %U http://dblp.uni-trier.de/db/conf/iscopt/isco2016.html#AndoS16 %V 9849 %@ 978-3-319-45586-0

@inproceedings{conf/iscopt/AndoS16, added-at = {2022-10-02T00:00:00.000+0200}, author = {Ando, Kazutoshi and Sato, Koki}, biburl = {https://www.bibsonomy.org/bibtex/25642ddefd1025eeeb10691f4b2fd834e/dblp}, booktitle = {ISCO}, crossref = {conf/iscopt/2016}, editor = {Cerulli, Raffaele and Fujishige, Satoru and Mahjoub, Ali Ridha}, ee = {https://doi.org/10.1007/978-3-319-45587-7_22}, interhash = {a076e760f514912e2e4380461d092573}, intrahash = {5642ddefd1025eeeb10691f4b2fd834e}, isbn = {978-3-319-45586-0}, keywords = {dblp}, pages = {249-259}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-10T04:31:55.000+0200}, title = {An Algorithm for Finding a Representation of a Subtree Distance.}, url = {http://dblp.uni-trier.de/db/conf/iscopt/isco2016.html#AndoS16}, volume = 9849, year = 2016 }