[1]
Biedl, T. and Gokhale, P. 2026. Finding maximum matchings in RDV graphs efficiently. Computing in Geometry and Topology. 5, 2 (Feb. 2026), 4:1–4:14. DOI:https://doi.org/10.57717/cgt.v5i2.72.