BibTeX Export for Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs

Copy to Clipboard Download

@InProceedings{gupta_et_al:LIPIcs.MFCS.2020.43,
  author =	{Gupta, Chetan and Sharma, Vimal Raj and Tewari, Raghunath},
  title =	{{Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs}},
  booktitle =	{45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)},
  pages =	{43:1--43:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-159-7},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{170},
  editor =	{Esparza, Javier and Kr\'{a}l', Daniel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.43},
  URN =		{urn:nbn:de:0030-drops-127099},
  doi =		{10.4230/LIPIcs.MFCS.2020.43},
  annote =	{Keywords: Logspace computation, High genus, Matching isolation}
}

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode