@InProceedings{arora_et_al:LIPIcs.STACS.2016.10,
author = {Arora, Rahul and Gupta, Ashu and Gurjar, Rohit and Tewari, Raghunath},
title = {{Derandomizing Isolation Lemma for K3,3-free and K5-free Bipartite Graphs}},
booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)},
pages = {10:1--10:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-001-9},
ISSN = {1868-8969},
year = {2016},
volume = {47},
editor = {Ollinger, Nicolas and Vollmer, Heribert},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.10},
URN = {urn:nbn:de:0030-drops-57116},
doi = {10.4230/LIPIcs.STACS.2016.10},
annote = {Keywords: bipartite matching, derandomization, isolation lemma, SPL, minor-free graph}
}