BibTeX record conf/stacs/DattaKTV11

download as .bib file

@inproceedings{DBLP:conf/stacs/DattaKTV11,
  author       = {Samir Datta and
                  Raghav Kulkarni and
                  Raghunath Tewari and
                  N. Variyam Vinodchandran},
  editor       = {Thomas Schwentick and
                  Christoph D{\"{u}}rr},
  title        = {Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs},
  booktitle    = {28th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2011, March 10-12, 2011, Dortmund, Germany},
  series       = {LIPIcs},
  volume       = {9},
  pages        = {579--590},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2011},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2011.579},
  doi          = {10.4230/LIPICS.STACS.2011.579},
  timestamp    = {Sun, 02 Oct 2022 16:16:10 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/DattaKTV11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.