Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Dibyayan Chakraborty' in GoogleThis author has not been identified. Look up 'Antoine Dailly' in GoogleThis author has not been identified. Look up 'Sandip Das 0001' in GoogleThis author has not been identified. Look up 'Florent Foucaud' in GoogleThis author has not been identified. Look up 'Harmender Gahlawat' in GoogleThis author has not been identified. Look up 'Subir Kumar Ghosh' in Google

runs on WebDSL