Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller. A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking. In Juraj Hromkovic, Ondrej Sýkora, editors, Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG 98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings. Volume 1517 of Lecture Notes in Computer Science, pages 88-99, Springer, 1998.
@inproceedings{BroersmaKKM98,
title = {A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking},
author = {Hajo Broersma and Ton Kloks and Dieter Kratsch and Haiko Müller},
year = {1998},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/BroersmaKKM98},
cites = {0},
citedby = {0},
pages = {88-99},
booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG 98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings},
editor = {Juraj Hromkovic and Ondrej Sýkora},
volume = {1517},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-65195-0},
}