pdfformat: 

@InProceedings{dumas_et_al:LIPIcs.ISAAC.2022.40, author = {Dumas, Ma\"{e}l and Foucaud, Florent and Perez, Anthony and Todinca, Ioan}, title = {{On Graphs Coverable by k Shortest Paths}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {40:140:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772587}, ISSN = {18688969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2022/17325}, URN = {urn:nbn:de:0030drops173251}, doi = {10.4230/LIPIcs.ISAAC.2022.40}, annote = {Keywords: Shortest paths, covering problems, parameterized complexity} }
Keywords:  Shortest paths, covering problems, parameterized complexity  
Seminar:  33rd International Symposium on Algorithms and Computation (ISAAC 2022)  
Issue date:  2022  
Date of publication:  14.12.2022 