BibTeX Export for Bisection of Bounded Treewidth Graphs by Convolutions

Copy to Clipboard Download

@InProceedings{eiben_et_al:LIPIcs.ESA.2019.42,
  author =	{Eiben, Eduard and Lokshtanov, Daniel and Mouawad, Amer E.},
  title =	{{Bisection of Bounded Treewidth Graphs by Convolutions}},
  booktitle =	{27th Annual European Symposium on Algorithms (ESA 2019)},
  pages =	{42:1--42:11},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-124-5},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{144},
  editor =	{Bender, Michael A. and Svensson, Ola and Herman, Grzegorz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2019.42},
  URN =		{urn:nbn:de:0030-drops-111639},
  doi =		{10.4230/LIPIcs.ESA.2019.42},
  annote =	{Keywords: bisection, convolution, treewidth, fine-grained analysis, hardness in P}
}

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

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail