Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/cpm/DudekGO17
%A Dudek, Bartlomiej
%A Gawrychowski, Pawel
%A Ostropolski-Nalewaja, Piotr
%B CPM
%D 2017
%E Kärkkäinen, Juha
%E Radoszewski, Jakub
%E Rytter, Wojciech
%I Schloss Dagstuhl - Leibniz-Zentrum für Informatik
%K dblp
%P 10:1-10:14
%T A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem.
%U http://dblp.uni-trier.de/db/conf/cpm/cpm2017.html#DudekGO17
%V 78
%@ 978-3-95977-039-2
@inproceedings{conf/cpm/DudekGO17,
added-at = {2021-09-23T00:00:00.000+0200},
author = {Dudek, Bartlomiej and Gawrychowski, Pawel and Ostropolski-Nalewaja, Piotr},
biburl = {https://www.bibsonomy.org/bibtex/269f51a6f0f2cca52afb17396d4be706e/dblp},
booktitle = {CPM},
crossref = {conf/cpm/2017},
editor = {Kärkkäinen, Juha and Radoszewski, Jakub and Rytter, Wojciech},
ee = {https://doi.org/10.4230/LIPIcs.CPM.2017.10},
interhash = {0da67dd46ea6b36aa5f3cb02d6663011},
intrahash = {69f51a6f0f2cca52afb17396d4be706e},
isbn = {978-3-95977-039-2},
keywords = {dblp},
pages = {10:1-10:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
series = {LIPIcs},
timestamp = {2024-04-10T12:11:58.000+0200},
title = {A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem.},
url = {http://dblp.uni-trier.de/db/conf/cpm/cpm2017.html#DudekGO17},
volume = 78,
year = 2017
}