@InProceedings{dudek_et_al:LIPIcs.ISAAC.2020.23,
author = {Dudek, Bart{\l}omiej and Gawrychowski, Pawe{\l}},
title = {{Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {23:1--23:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.23},
URN = {urn:nbn:de:0030-drops-133678},
doi = {10.4230/LIPIcs.ISAAC.2020.23},
annote = {Keywords: Permutations, pattern avoidance, counting cycles}
}