@inproceedings{DBLP:conf/dis/KondoOIY14,
  author       = {Seiichi Kondo and
                  Keisuke Otaki and
                  Madori Ikeda and
                  Akihiro Yamamoto},
  editor       = {Saso Dzeroski and
                  Pance Panov and
                  Dragi Kocev and
                  Ljupco Todorovski},
  title        = {Fast Computation of the Tree Edit Distance between Unordered Trees
                  Using {IP} Solvers},
  booktitle    = {Discovery Science - 17th International Conference, {DS} 2014, Bled,
                  Slovenia, October 8-10, 2014. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8777},
  pages        = {156--167},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-319-11812-3\_14},
  doi          = {10.1007/978-3-319-11812-3\_14},
  timestamp    = {Sat, 09 Apr 2022 12:48:02 +0200},
  biburl       = {https://dblp.org/rec/conf/dis/KondoOIY14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"g65CQjmCRYheHm7Nh","bibbaseid":"kondo-otaki-ikeda-yamamoto-fastcomputationofthetreeeditdistancebetweenunorderedtreesusingipsolvers-2014","downloads":0,"creationDate":"2015-09-29T02:23:41.605Z","title":"Fast Computation of the Tree Edit Distance between Unordered Trees Using IP Solvers","author_short":["Kondo, S.","Otaki, K.","Ikeda, M.","Yamamoto, A."],"year":2014,"bibtype":"inproceedings","biburl":"https://dblp.org/pid/123/5097.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Seiichi"],"propositions":[],"lastnames":["Kondo"],"suffixes":[]},{"firstnames":["Keisuke"],"propositions":[],"lastnames":["Otaki"],"suffixes":[]},{"firstnames":["Madori"],"propositions":[],"lastnames":["Ikeda"],"suffixes":[]},{"firstnames":["Akihiro"],"propositions":[],"lastnames":["Yamamoto"],"suffixes":[]}],"editor":[{"firstnames":["Saso"],"propositions":[],"lastnames":["Dzeroski"],"suffixes":[]},{"firstnames":["Pance"],"propositions":[],"lastnames":["Panov"],"suffixes":[]},{"firstnames":["Dragi"],"propositions":[],"lastnames":["Kocev"],"suffixes":[]},{"firstnames":["Ljupco"],"propositions":[],"lastnames":["Todorovski"],"suffixes":[]}],"title":"Fast Computation of the Tree Edit Distance between Unordered Trees Using IP Solvers","booktitle":"Discovery Science - 17th International Conference, DS 2014, Bled, Slovenia, October 8-10, 2014. Proceedings","series":"Lecture Notes in Computer Science","volume":"8777","pages":"156–167","publisher":"Springer","year":"2014","url":"https://doi.org/10.1007/978-3-319-11812-3\\_14","doi":"10.1007/978-3-319-11812-3_14","timestamp":"Sat, 09 Apr 2022 12:48:02 +0200","biburl":"https://dblp.org/rec/conf/dis/KondoOIY14.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/dis/KondoOIY14,\n author = {Seiichi Kondo and\n Keisuke Otaki and\n Madori Ikeda and\n Akihiro Yamamoto},\n editor = {Saso Dzeroski and\n Pance Panov and\n Dragi Kocev and\n Ljupco Todorovski},\n title = {Fast Computation of the Tree Edit Distance between Unordered Trees\n Using {IP} Solvers},\n booktitle = {Discovery Science - 17th International Conference, {DS} 2014, Bled,\n Slovenia, October 8-10, 2014. Proceedings},\n series = {Lecture Notes in Computer Science},\n volume = {8777},\n pages = {156--167},\n publisher = {Springer},\n year = {2014},\n url = {https://doi.org/10.1007/978-3-319-11812-3\\_14},\n doi = {10.1007/978-3-319-11812-3\\_14},\n timestamp = {Sat, 09 Apr 2022 12:48:02 +0200},\n biburl = {https://dblp.org/rec/conf/dis/KondoOIY14.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Kondo, S.","Otaki, K.","Ikeda, M.","Yamamoto, A."],"editor_short":["Dzeroski, S.","Panov, P.","Kocev, D.","Todorovski, L."],"key":"DBLP:conf/dis/KondoOIY14","id":"DBLP:conf/dis/KondoOIY14","bibbaseid":"kondo-otaki-ikeda-yamamoto-fastcomputationofthetreeeditdistancebetweenunorderedtreesusingipsolvers-2014","role":"author","urls":{"Paper":"https://doi.org/10.1007/978-3-319-11812-3\\_14"},"metadata":{"authorlinks":{}},"html":""},"search_terms":["fast","computation","tree","edit","distance","between","unordered","trees","using","solvers","kondo","otaki","ikeda","yamamoto"],"keywords":[],"authorIDs":["5609f62d386a4dda560004a6"],"dataSources":["pDWYoXBpQhBphc8B2","m4JYMKY7Eve8dpHLm"]}