BibTeX record conf/stacs/MarxP14

download as .bib file

@inproceedings{DBLP:conf/stacs/MarxP14,
  author       = {D{\'{a}}niel Marx and
                  Michal Pilipczuk},
  editor       = {Ernst W. Mayr and
                  Natacha Portier},
  title        = {Everything you always wanted to know about the parameterized complexity
                  of Subgraph Isomorphism (but were afraid to ask)},
  booktitle    = {31st International Symposium on Theoretical Aspects of Computer Science
                  {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France},
  series       = {LIPIcs},
  volume       = {25},
  pages        = {542--553},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2014},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2014.542},
  doi          = {10.4230/LIPICS.STACS.2014.542},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/MarxP14.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.