Shortest vertex-disjoint two-face paths in planar graphs

2011

Additional Metadata
THEME	Logistics (theme 3)
Publisher	A.C.M.
Journal	ACM Transactions on Algorithms
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. (2011). Shortest vertex-disjoint two-face paths in planar graphs. ACM Transactions on Algorithms, 7(2).

See Also
inProceedings Analysis of multi-stage open shop processing systems J. Eggermont, A. Schrijver (Lex) and G.J. Woeginger
inProceedings Analysis of multi-stage open shop processing systems J. Eggermont, A. Schrijver (Lex) and G.J. Woeginger

Publication