Go to the corresponding LIPIcs Volume Portal 
Fan, Chenglin ; Filtser, Omrit ; Katz, Matthew J. ; Zhu, Binhai
pdfformat: 

@InProceedings{fan_et_al:LIPIcs:2016:6451, author = {Chenglin Fan and Omrit Filtser and Matthew J. Katz and Binhai Zhu}, title = {{On the General Chain Pair Simplification Problem}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {37:137:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770163}, ISSN = {18688969}, year = {2016}, volume = {58}, editor = {Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6451}, URN = {urn:nbn:de:0030drops64510}, doi = {10.4230/LIPIcs.MFCS.2016.37}, annote = {Keywords: chain simplification, discrete Frechet distance, dynamic programming, geometric arrangements, protein structural resemblance} }
Keywords:  chain simplification, discrete Frechet distance, dynamic programming, geometric arrangements, protein structural resemblance  
Collection:  41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)  
Issue Date:  2016  
Date of publication:  19.08.2016 