Published in: LIPIcs, Volume 285, 18th International Symposium on Parameterized and Exact Computation (IPEC 2023)
Riccardo Dondi and Manuel Lafond. An FPT Algorithm for Temporal Graph Untangling. In 18th International Symposium on Parameterized and Exact Computation (IPEC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 285, pp. 12:1-12:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{dondi_et_al:LIPIcs.IPEC.2023.12, author = {Dondi, Riccardo and Lafond, Manuel}, title = {{An FPT Algorithm for Temporal Graph Untangling}}, booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)}, pages = {12:1--12:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-305-8}, ISSN = {1868-8969}, year = {2023}, volume = {285}, editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.12}, URN = {urn:nbn:de:0030-drops-194311}, doi = {10.4230/LIPIcs.IPEC.2023.12}, annote = {Keywords: Temporal Graphs, Vertex Cover, Graph Algorithms, Parameterized Complexity} }
Published in: LIPIcs, Volume 191, 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)
Riccardo Dondi and Florian Sikora. The Longest Run Subsequence Problem: Further Complexity Results. In 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 191, pp. 14:1-14:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{dondi_et_al:LIPIcs.CPM.2021.14, author = {Dondi, Riccardo and Sikora, Florian}, title = {{The Longest Run Subsequence Problem: Further Complexity Results}}, booktitle = {32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021)}, pages = {14:1--14:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-186-3}, ISSN = {1868-8969}, year = {2021}, volume = {191}, editor = {Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2021.14}, URN = {urn:nbn:de:0030-drops-139652}, doi = {10.4230/LIPIcs.CPM.2021.14}, annote = {Keywords: Parameterized complexity, Kernelization, Approximation Hardness, Longest Subsequence} }
Published in: LIPIcs, Volume 113, 18th International Workshop on Algorithms in Bioinformatics (WABI 2018)
Riccardo Dondi, Manuel Lafond, and Celine Scornavacca. Reconciling Multiple Genes Trees via Segmental Duplications and Losses. In 18th International Workshop on Algorithms in Bioinformatics (WABI 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 113, pp. 5:1-5:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{dondi_et_al:LIPIcs.WABI.2018.5, author = {Dondi, Riccardo and Lafond, Manuel and Scornavacca, Celine}, title = {{Reconciling Multiple Genes Trees via Segmental Duplications and Losses}}, booktitle = {18th International Workshop on Algorithms in Bioinformatics (WABI 2018)}, pages = {5:1--5:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-082-8}, ISSN = {1868-8969}, year = {2018}, volume = {113}, editor = {Parida, Laxmi and Ukkonen, Esko}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2018.5}, URN = {urn:nbn:de:0030-drops-93079}, doi = {10.4230/LIPIcs.WABI.2018.5}, annote = {Keywords: Gene trees/species tree reconciliation, phylogenetics, computational complexity, fixed-parameter algorithms} }
Published in: LIPIcs, Volume 78, 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)
Mauro Castelli, Riccardo Dondi, Giancarlo Mauri, and Italo Zoppis. The Longest Filled Common Subsequence Problem. In 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 78, pp. 14:1-14:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{castelli_et_al:LIPIcs.CPM.2017.14, author = {Castelli, Mauro and Dondi, Riccardo and Mauri, Giancarlo and Zoppis, Italo}, title = {{The Longest Filled Common Subsequence Problem}}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)}, pages = {14:1--14:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-039-2}, ISSN = {1868-8969}, year = {2017}, volume = {78}, editor = {K\"{a}rkk\"{a}inen, Juha and Radoszewski, Jakub and Rytter, Wojciech}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2017.14}, URN = {urn:nbn:de:0030-drops-73293}, doi = {10.4230/LIPIcs.CPM.2017.14}, annote = {Keywords: longest common subsequence, approximation algorithms, computational complexity, fixed-parameter algorithms} }
Feedback for Dagstuhl Publishing