Dibyayan Chakraborty, Antoine Dailly, Sandip Das 0001, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh. Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond. In Sang Won Bae, Heejin Park, editors, 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea. Volume 248 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]
@inproceedings{ChakrabortyD0FG22,
title = {Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond},
author = {Dibyayan Chakraborty and Antoine Dailly and Sandip Das 0001 and Florent Foucaud and Harmender Gahlawat and Subir Kumar Ghosh},
year = {2022},
doi = {10.4230/LIPIcs.ISAAC.2022.12},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.12},
researchr = {https://researchr.org/publication/ChakrabortyD0FG22},
cites = {0},
citedby = {0},
booktitle = {33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea},
editor = {Sang Won Bae and Heejin Park},
volume = {248},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-258-7},
}