Bartlomiej Dudek 0001, Pawel Gawrychowski. Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs. In Yixin Cao 0001, Siu-Wing Cheng, Minming Li, editors, 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference). Volume 181 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]
@inproceedings{0001G20-3,
title = {Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs},
author = {Bartlomiej Dudek 0001 and Pawel Gawrychowski},
year = {2020},
doi = {10.4230/LIPIcs.ISAAC.2020.23},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.23},
researchr = {https://researchr.org/publication/0001G20-3},
cites = {0},
citedby = {0},
booktitle = {31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
editor = {Yixin Cao 0001 and Siu-Wing Cheng and Minming Li},
volume = {181},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-173-3},
}