Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi. Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner s Contraction. In Tetsuo Asano, editor, Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings. Volume 4288 of Lecture Notes in Computer Science, pages 3-15, Springer, 2006. [doi]
@inproceedings{DemaineHK06,
title = {Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner s Contraction},
author = {Erik D. Demaine and Mohammad Taghi Hajiaghayi and Ken-ichi Kawarabayashi},
year = {2006},
doi = {10.1007/11940128_3},
url = {http://dx.doi.org/10.1007/11940128_3},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/DemaineHK06},
cites = {0},
citedby = {0},
pages = {3-15},
booktitle = {Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings},
editor = {Tetsuo Asano},
volume = {4288},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-49694-7},
}