Andreas Björklund, Thore Husfeldt. Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm. In Wen-Lian Hsu, Der-Tsai Lee, Chung-Shou Liao, editors, 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan. Volume 123 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]
@inproceedings{BjorklundH18, title = {Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm}, author = {Andreas Björklund and Thore Husfeldt}, year = {2018}, doi = {10.4230/LIPIcs.ISAAC.2018.19}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.19}, researchr = {https://researchr.org/publication/BjorklundH18}, cites = {0}, citedby = {0}, booktitle = {29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, editor = {Wen-Lian Hsu and Der-Tsai Lee and Chung-Shou Liao}, volume = {123}, series = {LIPIcs}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, isbn = {978-3-95977-094-1}, }