Go to the corresponding LIPIcs Volume Portal 
Chakraborty, Dibyayan ; Das, Sandip ; Foucaud, Florent ; Gahlawat, Harmender ; Lajou, Dimitri ; Roy, Bodhayan
pdfformat: 

@InProceedings{chakraborty_et_al:LIPIcs:2020:13351, author = {Dibyayan Chakraborty and Sandip Das and Florent Foucaud and Harmender Gahlawat and Dimitri Lajou and Bodhayan Roy}, title = {{Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs}}, booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)}, pages = {7:17:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771733}, ISSN = {18688969}, year = {2020}, volume = {181}, editor = {Yixin Cao and SiuWing Cheng and Minming Li}, publisher = {Schloss DagstuhlLeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/13351}, URN = {urn:nbn:de:0030drops133516}, doi = {10.4230/LIPIcs.ISAAC.2020.7}, annote = {Keywords: Geodetic set, Planar graph, Chordal graph, Interval graph, FPT algorithm} }
Keywords:  Geodetic set, Planar graph, Chordal graph, Interval graph, FPT algorithm  
Collection:  31st International Symposium on Algorithms and Computation (ISAAC 2020)  
Issue Date:  2020  
Date of publication:  04.12.2020 