Go to the corresponding LIPIcs Volume Portal 
Bentert, Matthias ; Nichterlein, André ; Renken, Malte ; Zschoche, Philipp
pdfformat: 

@InProceedings{bentert_et_al:LIPIcs.ICALP.2021.26, author = {Bentert, Matthias and Nichterlein, Andr\'{e} and Renken, Malte and Zschoche, Philipp}, title = {{Using a Geometric Lens to Find k Disjoint Shortest Paths}}, booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}, pages = {26:126:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771955}, ISSN = {18688969}, year = {2021}, volume = {198}, editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14095}, URN = {urn:nbn:de:0030drops140954}, doi = {10.4230/LIPIcs.ICALP.2021.26}, annote = {Keywords: graph algorithms, dynamic programming, W\lbrack1\rbrackhardness, geometry} }
Keywords:  graph algorithms, dynamic programming, W[1]hardness, geometry  
Collection:  48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)  
Issue Date:  2021  
Date of publication:  02.07.2021 