BibTeX record conf/cpm/FertinFK18

download as .bib file

@inproceedings{DBLP:conf/cpm/FertinFK18,
  author       = {Guillaume Fertin and
                  Julien Fradin and
                  Christian Komusiewicz},
  editor       = {Gonzalo Navarro and
                  David Sankoff and
                  Binhai Zhu},
  title        = {On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph
                  Structure},
  booktitle    = {Annual Symposium on Combinatorial Pattern Matching, {CPM} 2018, July
                  2-4, 2018 - Qingdao, China},
  series       = {LIPIcs},
  volume       = {105},
  pages        = {17:1--17:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CPM.2018.17},
  doi          = {10.4230/LIPICS.CPM.2018.17},
  timestamp    = {Wed, 28 Feb 2024 00:16:40 +0100},
  biburl       = {https://dblp.org/rec/conf/cpm/FertinFK18.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.