S. L. Lee, H.-J. Ho. Algorithms and Complexity for Weighted Hypergraph Embedding in a Cycle. In 1st International Symposium on Cyber Worlds (CW 2002), 6-8 November 2002, Tokyo, JAPAN. pages 70-78, IEEE Computer Society, 2002. [doi]
@inproceedings{LeeH02:10,
title = {Algorithms and Complexity for Weighted Hypergraph Embedding in a Cycle},
author = {S. L. Lee and H.-J. Ho},
year = {2002},
url = {http://csdl.computer.org/comp/proceedings/cw/2002/1862/00/18620070abs.htm},
researchr = {https://researchr.org/publication/LeeH02%3A10},
cites = {0},
citedby = {0},
pages = {70-78},
booktitle = {1st International Symposium on Cyber Worlds (CW 2002), 6-8 November 2002, Tokyo, JAPAN},
publisher = {IEEE Computer Society},
isbn = {0-7695-1862-1},
}