Samir Datta, Raghav Kulkarni, Raghunath Tewari. Perfect Matching in Bipartite Planar Graphs is in UL. Electronic Colloquium on Computational Complexity (ECCC), 17:201, 2010. [doi]
@article{DattaKT10,
title = {Perfect Matching in Bipartite Planar Graphs is in UL},
author = {Samir Datta and Raghav Kulkarni and Raghunath Tewari},
year = {2010},
url = {http://eccc.hpi-web.de/report/2010/201},
tags = {planar graph, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/DattaKT10},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {17},
pages = {201},
}