Alexandre Tarassov, Nikola S. Nikolov, Jürgen Branke. A Heuristic for Minimum-Width Graph Layering with Consideration of Dummy Nodes. In Celso C. Ribeiro, Simone L. Martins, editors, Experimental and Efficient Algorithms, Third International Workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004, Proceedings. Volume 3059 of Lecture Notes in Computer Science, pages 570-583, Springer, 2004. [doi]
@inproceedings{TarassovNB04,
title = {A Heuristic for Minimum-Width Graph Layering with Consideration of Dummy Nodes},
author = {Alexandre Tarassov and Nikola S. Nikolov and Jürgen Branke},
year = {2004},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3059&spage=570},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/TarassovNB04},
cites = {0},
citedby = {0},
pages = {570-583},
booktitle = {Experimental and Efficient Algorithms, Third International Workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004, Proceedings},
editor = {Celso C. Ribeiro and Simone L. Martins},
volume = {3059},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-22067-4},
}