Loïc Seguin-Charbonneau, F. Bruce Shepherd. Maximum Edge-Disjoint Paths in Planar Graphs with Congestion 2. In Rafail Ostrovsky, editor, IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011. pages 200-209, IEEE, 2011. [doi]
@inproceedings{Seguin-CharbonneauS11,
title = {Maximum Edge-Disjoint Paths in Planar Graphs with Congestion 2},
author = {Loïc Seguin-Charbonneau and F. Bruce Shepherd},
year = {2011},
doi = {10.1109/FOCS.2011.30},
url = {http://dx.doi.org/10.1109/FOCS.2011.30},
researchr = {https://researchr.org/publication/Seguin-CharbonneauS11},
cites = {0},
citedby = {0},
pages = {200-209},
booktitle = {IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011},
editor = {Rafail Ostrovsky},
publisher = {IEEE},
isbn = {978-1-4577-1843-4},
}