Go to the corresponding LIPIcs Volume Portal 
Zhang, Shu ; Zhu, Daming ; Jiang, Haitao ; Ma, Jingjing ; Guo, Jiong ; Feng, Haodi
pdfformat: 

@InProceedings{zhang_et_al:LIPIcs:2018:8695, author = {Shu Zhang and Daming Zhu and Haitao Jiang and Jingjing Ma and Jiong Guo and Haodi Feng}, title = {{Can a permutation be sorted by best short swaps?}}, booktitle = {Annual Symposium on Combinatorial Pattern Matching (CPM 2018)}, pages = {14:114:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770743}, ISSN = {18688969}, year = {2018}, volume = {105}, editor = {Gonzalo Navarro and David Sankoff and Binhai Zhu}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2018/8695}, URN = {urn:nbn:de:0030drops86957}, doi = {10.4230/LIPIcs.CPM.2018.14}, annote = {Keywords: Algorithm, Complexity, Short Swap, Permutation, Reversal} }
Keywords:  Algorithm, Complexity, Short Swap, Permutation, Reversal  
Collection:  Annual Symposium on Combinatorial Pattern Matching (CPM 2018)  
Issue Date:  2018  
Date of publication:  18.05.2018 