Go to the corresponding LIPIcs Volume Portal 
Björklund, Andreas ; Husfeldt, Thore
pdfformat: 

@InProceedings{bjrklund_et_al:LIPIcs:2018:9967, author = {Andreas Bj{\"o}rklund and Thore Husfeldt}, title = {{Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {19:119:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770941}, ISSN = {18688969}, year = {2018}, volume = {123}, editor = {WenLian Hsu and DerTsai Lee and ChungShou Liao}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9967}, URN = {urn:nbn:de:0030drops99670}, doi = {10.4230/LIPIcs.ISAAC.2018.19}, annote = {Keywords: Shortest disjoint paths, Cubic planar graph} }
Keywords:  Shortest disjoint paths, Cubic planar graph  
Seminar:  29th International Symposium on Algorithms and Computation (ISAAC 2018)  
Issue Date:  2018  
Date of publication:  27.11.2018 