BibTeX record conf/mfcs/ConteGKMUW19

download as .bib file

@inproceedings{DBLP:conf/mfcs/ConteGKMUW19,
  author       = {Alessio Conte and
                  Roberto Grossi and
                  Mamadou Moustapha Kant{\'{e}} and
                  Andrea Marino and
                  Takeaki Uno and
                  Kunihiro Wasa},
  editor       = {Peter Rossmanith and
                  Pinar Heggernes and
                  Joost{-}Pieter Katoen},
  title        = {Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner
                  Trees in Graphs},
  booktitle    = {44th International Symposium on Mathematical Foundations of Computer
                  Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany},
  series       = {LIPIcs},
  volume       = {138},
  pages        = {73:1--73:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.MFCS.2019.73},
  doi          = {10.4230/LIPICS.MFCS.2019.73},
  timestamp    = {Sun, 18 Jun 2023 08:03:59 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/ConteGKMUW19.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.