H. L. Bodlaender, A. Grigoriev, and A. M. C. A. Koster. Treewidth lower bounds with brambles. In G. S. Brodal and S. Leonardi, editors, Proceedings 13th Annual European Symposium on Algorithms, ESA2005. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Journal of Graph Algorithms and Applications - Http Jgaa Info (2006) Self-citation (Bodlaender Koster) (Correct)
No context found.
H. L. Bodlaender, A. Grigoriev, and A. M. C. A. Koster. Treewidth lower bounds with brambles. In G. S. Brodal and S. Leonardi, editors, Proceedings 13th Annual European Symposium on Algorithms, ESA2005.
Computations - Hans Bodlaender Department (2006) Self-citation (Bodlaender) (Correct)
No context found.
H. L. Bodlaender, A. Grigoriev, and A. M. C. A. Koster. Treewidth lower bounds with brambles. In G. S. Brodal and S. Leonardi, editors, Proceedings 13th Annual European Symposium on Algorithms, ESA2005, pages 391--402. Springer-Verlag, Lecture Notes in Computer Science, vol. 3669, 2005.
Discovering Treewidth - Hans Bodlaender Institute (2005) Self-citation (Bodlaender) (Correct)
No context found.
H. L. Bodlaender, A. Grigoriev, and A. M. C. A. Koster. Treewidth lower bounds with brambles. Submitted for publication, 2005.
Sparse Obstructions And Exact Treewidth Determination - Lucena (Correct)
No context found.
H. L. Bodlaender, A. Grigoriev, A. M. C. A. Koster, Treewidth lower bounds with brambles, in: Proceedings 13th Annual European Symposium on Algorithms, ESA2005.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC