@article{DBLP:journals/eccc/ECCC-TR01-023,
  author    = {Jochen Alber and
               Henning Fernau and
               Rolf Niedermeier},
  title     = {Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {8},
  number    = {23},
  year      = {2001},
  url       = {http://eccc.hpi-web.de/eccc-reports/2001/TR01-023/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/ECCC-TR01-023},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"M56XDeELXZekxcmCq","bibbaseid":"alber-fernau-niedermeier-parameterizedcomplexityexponentialspeedupforplanargraphproblems-2001","downloads":0,"creationDate":"2018-10-01T13:54:48.940Z","title":"Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems","author_short":["Alber, J.","Fernau, H.","Niedermeier, R."],"year":2001,"bibtype":"article","biburl":"https://dblp.org/pid/f/HenningFernau.bib","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Jochen"],"propositions":[],"lastnames":["Alber"],"suffixes":[]},{"firstnames":["Henning"],"propositions":[],"lastnames":["Fernau"],"suffixes":[]},{"firstnames":["Rolf"],"propositions":[],"lastnames":["Niedermeier"],"suffixes":[]}],"title":"Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems","journal":"Electronic Colloquium on Computational Complexity (ECCC)","volume":"8","number":"23","year":"2001","url":"http://eccc.hpi-web.de/eccc-reports/2001/TR01-023/index.html","timestamp":"Tue, 14 Aug 2018 01:00:00 +0200","biburl":"https://dblp.org/rec/bib/journals/eccc/ECCC-TR01-023","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/eccc/ECCC-TR01-023,\n author = {Jochen Alber and\n Henning Fernau and\n Rolf Niedermeier},\n title = {Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems},\n journal = {Electronic Colloquium on Computational Complexity {(ECCC)}},\n volume = {8},\n number = {23},\n year = {2001},\n url = {http://eccc.hpi-web.de/eccc-reports/2001/TR01-023/index.html},\n timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/bib/journals/eccc/ECCC-TR01-023},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Alber, J.","Fernau, H.","Niedermeier, R."],"key":"DBLP:journals/eccc/ECCC-TR01-023","id":"DBLP:journals/eccc/ECCC-TR01-023","bibbaseid":"alber-fernau-niedermeier-parameterizedcomplexityexponentialspeedupforplanargraphproblems-2001","role":"author","urls":{"Paper":"http://eccc.hpi-web.de/eccc-reports/2001/TR01-023/index.html"},"downloads":0},"search_terms":["parameterized","complexity","exponential","speed","planar","graph","problems","alber","fernau","niedermeier"],"keywords":[],"authorIDs":[],"dataSources":["TuA7fGR5JYLK4NXQn"]}