BibTeX record conf/mfcs/AmarilliM22

download as .bib file

@inproceedings{DBLP:conf/mfcs/AmarilliM22,
  author       = {Antoine Amarilli and
                  Mika{\"{e}}l Monet},
  editor       = {Stefan Szeider and
                  Robert Ganian and
                  Alexandra Silva},
  title        = {Weighted Counting of Matchings in Unbounded-Treewidth Graph Families},
  booktitle    = {47th International Symposium on Mathematical Foundations of Computer
                  Science, {MFCS} 2022, August 22-26, 2022, Vienna, Austria},
  series       = {LIPIcs},
  volume       = {241},
  pages        = {9:1--9:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022},
  url          = {https://doi.org/10.4230/LIPIcs.MFCS.2022.9},
  doi          = {10.4230/LIPICS.MFCS.2022.9},
  timestamp    = {Mon, 26 Sep 2022 17:09:13 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/AmarilliM22.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.