Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX record conf/isaac/BjorklundH18
@inproceedings{DBLP:conf/isaac/BjorklundH18, author = {Andreas Bj{\"{o}}rklund and Thore Husfeldt}, editor = {Wen{-}Lian Hsu and Der{-}Tsai Lee and Chung{-}Shou Liao}, title = {Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an {NC} Algorithm}, booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC} 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan}, series = {LIPIcs}, volume = {123}, pages = {19:1--19:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.19}, doi = {10.4230/LIPICS.ISAAC.2018.19}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BjorklundH18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.