Glencora Borradaile, Philip N. Klein. The Two-Edge Connectivity Survivable Network Problem in Planar Graphs. In Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz, editors, Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games. Volume 5125 of Lecture Notes in Computer Science, pages 485-501, Springer, 2008. [doi]
@inproceedings{BorradaileK08,
title = {The Two-Edge Connectivity Survivable Network Problem in Planar Graphs},
author = {Glencora Borradaile and Philip N. Klein},
year = {2008},
doi = {10.1007/978-3-540-70575-8_40},
url = {http://dx.doi.org/10.1007/978-3-540-70575-8_40},
tags = {planar graph, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/BorradaileK08},
cites = {0},
citedby = {0},
pages = {485-501},
booktitle = {Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games},
editor = {Luca Aceto and Ivan Damgård and Leslie Ann Goldberg and Magnús M. Halldórsson and Anna Ingólfsdóttir and Igor Walukiewicz},
volume = {5125},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-70574-1},
}