Jirí Fiala, Ton Kloks, Jan Kratochvíl. Fixed-Parameter Complexity of lambda-Labelings. In Peter Widmayer, Gabriele Neyer, Stephan Eidenbenz, editors, Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG 99, Ascona, Switzerland, June 17-19, 1999, Proceedings. Volume 1665 of Lecture Notes in Computer Science, pages 350-363, Springer, 1999. [doi]
@inproceedings{FialaKK99,
title = {Fixed-Parameter Complexity of lambda-Labelings},
author = {Jirí Fiala and Ton Kloks and Jan Kratochvíl},
year = {1999},
url = {http://link.springer.de/link/service/series/0558/bibs/1665/16650350.htm},
researchr = {https://researchr.org/publication/FialaKK99},
cites = {0},
citedby = {0},
pages = {350-363},
booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG 99, Ascona, Switzerland, June 17-19, 1999, Proceedings},
editor = {Peter Widmayer and Gabriele Neyer and Stephan Eidenbenz},
volume = {1665},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-66731-8},
}