Author:
Andreou Maria,Fotakis Dimitris,Lesta Vicky Papadopoulou,Nikoletseas Sotiris,Spirakis Paul
Publisher
Springer International Publishing
Reference31 articles.
1. Agnarsson, G., Halldórsson, M.M.: Coloring powers of planar graphs. SIAM J. Discrete Math. 16(4), 651–662 (2003)
2. Lecture Notes in Computer Science;MI Andreou,2002
3. Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41, 153–180 (1994)
4. Bienstoc, D., Monma, C.L.: On the complexity of embedding planar graphs to minimize certain distance measures. Algorithmica 5, 93–109 (1990)
5. Bodlaender, H.L.: Planar graphs with bounded treewidth. TR RUU-CS-88-14, Department of Computer Science, University of Utrecht, The Netherlands, March 1988