@article{Datta_2012,
    doi = {10.1016/j.jcss.2011.11.002},
    url = {https://doi.org/10.1016%2Fj.jcss.2011.11.002},
    year = {2012},
    month = {may},
    publisher = {Elsevier {BV}},
    volume = {78},
    number = {3},
    pages = {765--779},
    author = {Samir Datta and Raghav Kulkarni and Raghunath Tewari and N.V. Vinodchandran},
    title = {Space complexity of perfect matching in bounded genus bipartite graphs},
    journal = {Journal of Computer and System Sciences}
}

@article{Datta_2012, doi = {10.1016/j.jcss.2011.11.002}, url = {https://doi.org/10.1016%2Fj.jcss.2011.11.002}, year = {2012}, month = {may}, publisher = {Elsevier {BV}}, volume = {78}, number = {3}, pages = {765--779}, author = {Samir Datta and Raghav Kulkarni and Raghunath Tewari and N.V. Vinodchandran}, title = {Space complexity of perfect matching in bounded genus bipartite graphs}, journal = {Journal of Computer and System Sciences} }