Published in: LIPIcs, Volume 257, 2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023)
Thomas Bellitto, Cyril Conchon-Kerjan, and Bruno Escoffier. Restless Exploration of Periodic Temporal Graphs. In 2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 257, pp. 13:1-13:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{bellitto_et_al:LIPIcs.SAND.2023.13, author = {Bellitto, Thomas and Conchon-Kerjan, Cyril and Escoffier, Bruno}, title = {{Restless Exploration of Periodic Temporal Graphs}}, booktitle = {2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023)}, pages = {13:1--13:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-275-4}, ISSN = {1868-8969}, year = {2023}, volume = {257}, editor = {Doty, David and Spirakis, Paul}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2023.13}, URN = {urn:nbn:de:0030-drops-179497}, doi = {10.4230/LIPIcs.SAND.2023.13}, annote = {Keywords: Temporal graphs, Graph exploration, NP-completeness} }
Published in: LIPIcs, Volume 214, 16th International Symposium on Parameterized and Exact Computation (IPEC 2021)
Hugo Jacob, Thomas Bellitto, Oscar Defrain, and Marcin Pilipczuk. Close Relatives (Of Feedback Vertex Set), Revisited. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 21:1-21:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{jacob_et_al:LIPIcs.IPEC.2021.21, author = {Jacob, Hugo and Bellitto, Thomas and Defrain, Oscar and Pilipczuk, Marcin}, title = {{Close Relatives (Of Feedback Vertex Set), Revisited}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {21:1--21:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.21}, URN = {urn:nbn:de:0030-drops-154049}, doi = {10.4230/LIPIcs.IPEC.2021.21}, annote = {Keywords: feedback vertex set, treewidth, cliquewidth} }
Published in: LIPIcs, Volume 181, 31st International Symposium on Algorithms and Computation (ISAAC 2020)
Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, and Manuel Sorge. The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs. In 31st International Symposium on Algorithms and Computation (ISAAC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 181, pp. 59:1-59:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{bellitto_et_al:LIPIcs.ISAAC.2020.59, author = {Bellitto, Thomas and Li, Shaohua and Okrasa, Karolina and Pilipczuk, Marcin and Sorge, Manuel}, title = {{The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs}}, booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)}, pages = {59:1--59:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-173-3}, ISSN = {1868-8969}, year = {2020}, volume = {181}, editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.59}, URN = {urn:nbn:de:0030-drops-134036}, doi = {10.4230/LIPIcs.ISAAC.2020.59}, annote = {Keywords: Graph algorithms, fixed-parameter tractability, parameterized complexity} }
Feedback for Dagstuhl Publishing