%0 Conference Paper %1 conf/isaac/DroschinskyHKM14 %A Droschinsky, Andre %A Heinemann, Bernhard %A Kriege, Nils M. %A Mutzel, Petra %B ISAAC %D 2014 %E Ahn, Hee-Kap %E Shin, Chan-Su %I Springer %K dblp %P 81-93 %T Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay. %U http://dblp.uni-trier.de/db/conf/isaac/isaac2014.html#DroschinskyHKM14 %V 8889 %@ 978-3-319-13074-3

@inproceedings{conf/isaac/DroschinskyHKM14, added-at = {2019-04-02T00:00:00.000+0200}, author = {Droschinsky, Andre and Heinemann, Bernhard and Kriege, Nils M. and Mutzel, Petra}, biburl = {https://www.bibsonomy.org/bibtex/2a4f62c924b474f5e8a18ddacd1d12900/dblp}, booktitle = {ISAAC}, crossref = {conf/isaac/2014}, editor = {Ahn, Hee-Kap and Shin, Chan-Su}, ee = {https://www.wikidata.org/entity/Q56976974}, interhash = {cfce7913ebce8cf05e3b60e2db100879}, intrahash = {a4f62c924b474f5e8a18ddacd1d12900}, isbn = {978-3-319-13074-3}, keywords = {dblp}, pages = {81-93}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T12:58:12.000+0200}, title = {Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay.}, url = {http://dblp.uni-trier.de/db/conf/isaac/isaac2014.html#DroschinskyHKM14}, volume = 8889, year = 2014 }