Published in: LIPIcs, Volume 25, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Adeline Pierrot and Dominique Rossin. 2-Stack Sorting is polynomial. In 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 25, pp. 614-626, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{pierrot_et_al:LIPIcs.STACS.2014.614,
author = {Pierrot, Adeline and Rossin, Dominique},
title = {{2-Stack Sorting is polynomial}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {614--626},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.614},
URN = {urn:nbn:de:0030-drops-44927},
doi = {10.4230/LIPIcs.STACS.2014.614},
annote = {Keywords: permutation, stack, sort, NP-complete}
}