BibTeX Export for Solving Co-Path/Cycle Packing and Co-Path Packing Faster Than 3^k

Copy to Clipboard Download

@InProceedings{liu_et_al:LIPIcs.IPEC.2024.11,
  author =	{Liu, Yuxi and Xiao, Mingyu},
  title =	{{Solving Co-Path/Cycle Packing and Co-Path Packing Faster Than 3^k}},
  booktitle =	{19th International Symposium on Parameterized and Exact Computation (IPEC 2024)},
  pages =	{11:1--11:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-353-9},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{321},
  editor =	{Bonnet, \'{E}douard and Rz\k{a}\.{z}ewski, Pawe{\l}},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2024.11},
  URN =		{urn:nbn:de:0030-drops-222376},
  doi =		{10.4230/LIPIcs.IPEC.2024.11},
  annote =	{Keywords: Graph Algorithms, Parameterized Algorithms, Co-Path/Cycle Packing, Co-Path Packing, Cut \& Count, Path Decomposition}
}

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