BibTeX
@InProceedings{BidimensionalSurvey_GD2004,
AUTHOR = {Erik D. Demaine and MohammadTaghi Hajiaghayi},
TITLE = {Fast Algorithms for Hard Graph Problems: Bidimensionality,
Minors, and Local Treewidth},
BOOKTITLE = {Proceedings of the 12th International Symposium on
Graph Drawing (GD 2004)},
bookurl = {http://www.gd2004.org/},
VOLUME = 3383,
SERIES = {Lecture Notes in Computer Science},
SERIESURL = {http://www.springer.de/comp/lncs/},
ADDRESS = {Harlem, New York},
MONTH = {September 29--October 2},
YEAR = 2004,
PAGES = {517--533},
copyright = {The paper is \copyright Springer-Verlag.},
doi = {https://dx.doi.org/10.1007/978-3-540-31843-9_57},
dblp = {https://dblp.org/rec/conf/gd/DemaineH04},
comments = {This paper is also available from from <A HREF="https://doi.org/10.1007/978-3-540-31843-9_57">SpringerLink</A>.},
withstudent = 1,
length = {17 pages},
papers = {BidimensionalSurvey_CJ},
}