Samir Datta, Raghav Kulkarni, Sambuddha Roy. Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. In Susanne Albers, Pascal Weil, editors, STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings. Volume 08001 of Dagstuhl Seminar Proceedings, pages 229-240, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2008. [doi]
@inproceedings{DattaKR08,
title = {Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs},
author = {Samir Datta and Raghav Kulkarni and Sambuddha Roy},
year = {2008},
url = {http://drops.dagstuhl.de/opus/volltexte/2008/1346},
tags = {planar graph, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/DattaKR08},
cites = {0},
citedby = {0},
pages = {229-240},
booktitle = {STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings},
editor = {Susanne Albers and Pascal Weil},
volume = {08001},
series = {Dagstuhl Seminar Proceedings},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany},
}