Published in: LIPIcs, Volume 248, 33rd International Symposium on Algorithms and Computation (ISAAC 2022)
Dibyayan Chakraborty, Antoine Dailly, Sandip Das, Florent Foucaud, Harmender Gahlawat, and Subir Kumar Ghosh. Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 12:1-12:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@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:1--12:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.12}, URN = {urn:nbn:de:0030-drops-172974}, doi = {10.4230/LIPIcs.ISAAC.2022.12}, annote = {Keywords: Shortest paths, Isometric path cover, Chordal graph, Interval graph, AT-free graph, Approximation algorithm, FPT algorithm, Treewidth, Chordality, Treelength} }
Published in: OASIcs, Volume 70, 2nd Conference on Language, Data and Knowledge (LDK 2019)
Nuno Freire, Antoine Isaac, Twan Goosen, Daan Broeder, Hugo Manguinhas, and Valentine Charles. Opening Digitized Newspapers Corpora: Europeana’s Full-Text Data Interoperability Case. In 2nd Conference on Language, Data and Knowledge (LDK 2019). Open Access Series in Informatics (OASIcs), Volume 70, pp. 22:1-22:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{freire_et_al:OASIcs.LDK.2019.22, author = {Freire, Nuno and Isaac, Antoine and Goosen, Twan and Broeder, Daan and Manguinhas, Hugo and Charles, Valentine}, title = {{Opening Digitized Newspapers Corpora: Europeana’s Full-Text Data Interoperability Case}}, booktitle = {2nd Conference on Language, Data and Knowledge (LDK 2019)}, pages = {22:1--22:14}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-105-4}, ISSN = {2190-6807}, year = {2019}, volume = {70}, editor = {Eskevich, Maria and de Melo, Gerard and F\"{a}th, Christian and McCrae, John P. and Buitelaar, Paul and Chiarcos, Christian and Klimek, Bettina and Dojchinovski, Milan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.LDK.2019.22}, URN = {urn:nbn:de:0030-drops-103869}, doi = {10.4230/OASIcs.LDK.2019.22}, annote = {Keywords: Metadata, Full-text, Interoperability, Data aggregation, Cultural Heritage, Research Infrastructures} }
Published in: LIPIcs, Volume 92, 28th International Symposium on Algorithms and Computation (ISAAC 2017)
Hee-Kap Ahn, Sang Won Bae, Jongmin Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, and Antoine Vigneron. Faster Algorithms for Growing Prioritized Disks and Rectangles. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 3:1-3:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{ahn_et_al:LIPIcs.ISAAC.2017.3, author = {Ahn, Hee-Kap and Bae, Sang Won and Choi, Jongmin and Korman, Matias and Mulzer, Wolfgang and Oh, Eunjin and Park, Ji-won and van Renssen, Andr\'{e} and Vigneron, Antoine}, title = {{Faster Algorithms for Growing Prioritized Disks and Rectangles}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {3:1--3:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.3}, URN = {urn:nbn:de:0030-drops-82199}, doi = {10.4230/LIPIcs.ISAAC.2017.3}, annote = {Keywords: map labeling, growing disks, elimination order} }
Feedback for Dagstuhl Publishing