Go to the corresponding LIPIcs Volume Portal 
Droschinsky, Andre ; Kriege, Nils M. ; Mutzel, Petra
pdfformat: 

@InProceedings{droschinsky_et_al:LIPIcs:2018:9636, author = {Andre Droschinsky and Nils M. Kriege and Petra Mutzel}, title = {{Largest Weight Common Subtree Embeddings with Distance Penalties}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {54:154:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770866}, ISSN = {18688969}, year = {2018}, volume = {117}, editor = {Igor Potapov and Paul Spirakis and James Worrell}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9636}, URN = {urn:nbn:de:0030drops96367}, doi = {10.4230/LIPIcs.MFCS.2018.54}, annote = {Keywords: maximum common subtree, largest embeddable subtree, topological embedding, maximum weight matching, subtree homeomorphism} }
Keywords:  maximum common subtree, largest embeddable subtree, topological embedding, maximum weight matching, subtree homeomorphism  
Seminar:  43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)  
Issue Date:  2018  
Date of publication:  20.08.2018 