Shortest vertex-disjoint two-face paths in planar graphs

Additional Metadata
THEME	Logistics (theme 3)
Publisher	Dagstuhl
Editor	S. Albers , P. Weil
ISBN	978-3-939897-06
Series	Proceedings of International Symposium on Theoretical Aspects of Computer Science
Project	Spinoza prijs Lex Schrijver
Conference	International Symposium on Theoretical Aspects of Computer Science
Organisation	Networks and Optimization
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Colin de Verdière, É., & Schrijver, L. (2008). Shortest vertex-disjoint two-face paths in planar graphs. In S. Albers & P. Weil (Eds.), Proceedings of International Symposium on Theoretical Aspects of Computer Science. Dagstuhl.

Publication