Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems. Alber, J., Fernau, H., & Niedermeier, R. Electronic Colloquium on Computational Complexity (ECCC), 2001.
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems [link]Paper  bibtex   
@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}
}

Downloads: 0