Zhi-Zhong Chen. Practical Approximation Schemes for Maximum Induced-Subgraph Problems on K_{3, 3}-free or K_5-free Graphs. In Friedhelm Meyer auf der Heide, Burkhard Monien, editors, Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings. Volume 1099 of Lecture Notes in Computer Science, pages 268-279, Springer, 1996.
@inproceedings{Chen96:15,
title = {Practical Approximation Schemes for Maximum Induced-Subgraph Problems on K_{3, 3}-free or K_5-free Graphs},
author = {Zhi-Zhong Chen},
year = {1996},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Chen96%3A15},
cites = {0},
citedby = {0},
pages = {268-279},
booktitle = {Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings},
editor = {Friedhelm Meyer auf der Heide and Burkhard Monien},
volume = {1099},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-61440-0},
}