BibTeX record conf/stacs/FominG12

download as .bib file

@inproceedings{DBLP:conf/stacs/FominG12,
  author       = {Fedor V. Fomin and
                  Petr A. Golovach},
  editor       = {Christoph D{\"{u}}rr and
                  Thomas Wilke},
  title        = {Parameterized Complexity of Connected Even/Odd Subgraph Problems},
  booktitle    = {29th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
  series       = {LIPIcs},
  volume       = {14},
  pages        = {432--440},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2012},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2012.432},
  doi          = {10.4230/LIPICS.STACS.2012.432},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/FominG12.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.