BibTeX record conf/mfcs/DattaK016

download as .bib file

@inproceedings{DBLP:conf/mfcs/DattaK016,
  author       = {Samir Datta and
                  Raghav Kulkarni and
                  Anish Mukherjee},
  editor       = {Piotr Faliszewski and
                  Anca Muscholl and
                  Rolf Niedermeier},
  title        = {Space-Efficient Approximation Scheme for Maximum Matching in Sparse
                  Graphs},
  booktitle    = {41st International Symposium on Mathematical Foundations of Computer
                  Science, {MFCS} 2016, August 22-26, 2016 - Krak{\'{o}}w, Poland},
  series       = {LIPIcs},
  volume       = {58},
  pages        = {28:1--28:12},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2016},
  url          = {https://doi.org/10.4230/LIPIcs.MFCS.2016.28},
  doi          = {10.4230/LIPICS.MFCS.2016.28},
  timestamp    = {Sun, 02 Oct 2022 16:11:39 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/DattaK016.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.