Go to the corresponding LIPIcs Volume Portal 
Kratsch, Stefan ; Nelles, Florian
pdfformat: 

@InProceedings{kratsch_et_al:LIPIcs:2020:11899, author = {Stefan Kratsch and Florian Nelles}, title = {{Efficient Parameterized Algorithms for Computing AllPairs Shortest Paths}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {38:138:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771405}, ISSN = {18688969}, year = {2020}, volume = {154}, editor = {Christophe Paul and Markus Bl{\"a}ser}, publisher = {Schloss DagstuhlLeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/11899}, URN = {urn:nbn:de:0030drops118992}, doi = {10.4230/LIPIcs.STACS.2020.38}, annote = {Keywords: Allpairs shortest Paths, efficient parameterized Algorithms, parameterized Complexity, Cliquewidth, Modularwidth} }
Keywords:  Allpairs shortest Paths, efficient parameterized Algorithms, parameterized Complexity, Cliquewidth, Modularwidth  
Collection:  37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)  
Issue Date:  2020  
Date of publication:  04.03.2020 