%0 Conference Paper %1 conf/cpm/BonizzoniVM00 %A Bonizzoni, Paola %A Vedova, Gianluca Della %A Mauri, Giancarlo %B CPM %D 2000 %E Giancarlo, Raffaele %E Sankoff, David %I Springer %K dblp %P 119-128 %T Approximating the Maximum Isomorphic Agreement Subtree Is Hard. %U http://dblp.uni-trier.de/db/conf/cpm/cpm2000.html#BonizzoniVM00 %V 1848 %@ 3-540-67633-3

@inproceedings{conf/cpm/BonizzoniVM00, added-at = {2023-09-30T00:00:00.000+0200}, author = {Bonizzoni, Paola and Vedova, Gianluca Della and Mauri, Giancarlo}, biburl = {https://www.bibsonomy.org/bibtex/28a0a5a57b89cbd681422b205a8dc4c6a/dblp}, booktitle = {CPM}, crossref = {conf/cpm/2000}, editor = {Giancarlo, Raffaele and Sankoff, David}, ee = {https://doi.org/10.1007/3-540-45123-4_12}, interhash = {2d1c18386bef39c897aa53b33c2e6697}, intrahash = {8a0a5a57b89cbd681422b205a8dc4c6a}, isbn = {3-540-67633-3}, keywords = {dblp}, pages = {119-128}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-10T12:11:48.000+0200}, title = {Approximating the Maximum Isomorphic Agreement Subtree Is Hard.}, url = {http://dblp.uni-trier.de/db/conf/cpm/cpm2000.html#BonizzoniVM00}, volume = 1848, year = 2000 }