We show that every planar graph can be represented by a monotone topological 2-page book embedding where at most 15n/16 (of potentially 3n-6) edges cross the spine exactly once.
@article{arxiv.2003.05332,
title = {Monotone Arc Diagrams with few Biarcs},
author = {Steven Chaplick and Henry Förster and Michael Hoffmann and Michael Kaufmann},
journal= {arXiv preprint arXiv:2003.05332},
year = {2020}
}