The class of ranked tree-child networks, certain tree-child networks with a fixed embedding into the plane, has recently been introduced by Bienvenu, Lambert, and Steel. We derived counting results for this class. In this talk, I will give bijective proofs of three of their results. Two of our bijections answer questions raised in their paper. This is joint work with Alessandra Caraceni (Scuola Normale Superiore di Pisa, Italy) and Michael Fuchs (National Chengchi University, Taiwan).