Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari. Partitioning Planar Graphs with Costs and Weights. In David M. Mount, Clifford Stein, editors, Algorithm Engineering and Experiments, 4th International Workshop, ALENEX 2002, San Francicsco, CA, USA, January 4-5, 2002, Revised Papers. Volume 2409 of Lecture Notes in Computer Science, pages 98-110, Springer, 2002. [doi]
@inproceedings{AleksandrovDGM02,
title = {Partitioning Planar Graphs with Costs and Weights},
author = {Lyudmil Aleksandrov and Hristo Djidjev and Hua Guo and Anil Maheshwari},
year = {2002},
url = {http://link.springer.de/link/service/series/0558/bibs/2409/24090098.htm},
tags = {planar graph, graph-rewriting, rewriting, partitioning},
researchr = {https://researchr.org/publication/AleksandrovDGM02},
cites = {0},
citedby = {0},
pages = {98-110},
booktitle = {Algorithm Engineering and Experiments, 4th International Workshop, ALENEX 2002, San Francicsco, CA, USA, January 4-5, 2002, Revised Papers},
editor = {David M. Mount and Clifford Stein},
volume = {2409},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-43977-3},
}