Go to the corresponding LIPIcs Volume Portal 
Chakraborty, Dibyayan ; Dailly, Antoine ; Das, Sandip ; Foucaud, Florent ; Gahlawat, Harmender ; Ghosh, Subir Kumar
pdfformat: 

@InProceedings{chakraborty_et_al:LIPIcs.ISAAC.2022.12, author = {Chakraborty, Dibyayan and Dailly, Antoine and Das, Sandip and Foucaud, Florent and Gahlawat, Harmender and Ghosh, Subir Kumar}, title = {{Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {12:112:17}, 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/17297}, URN = {urn:nbn:de:0030drops172974}, doi = {10.4230/LIPIcs.ISAAC.2022.12}, annote = {Keywords: Shortest paths, Isometric path cover, Chordal graph, Interval graph, ATfree graph, Approximation algorithm, FPT algorithm, Treewidth, Chordality, Treelength} }
Keywords:  Shortest paths, Isometric path cover, Chordal graph, Interval graph, ATfree graph, Approximation algorithm, FPT algorithm, Treewidth, Chordality, Treelength  
Collection:  33rd International Symposium on Algorithms and Computation (ISAAC 2022)  
Issue Date:  2022  
Date of publication:  14.12.2022 