Published in: LIPIcs, Volume 292, 3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)
Riccardo Dondi, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, and Alessandra Tappini. Partial Temporal Vertex Cover with Bounded Activity Intervals. In 3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 292, pp. 11:1-11:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{dondi_et_al:LIPIcs.SAND.2024.11, author = {Dondi, Riccardo and Montecchiani, Fabrizio and Ortali, Giacomo and Piselli, Tommaso and Tappini, Alessandra}, title = {{Partial Temporal Vertex Cover with Bounded Activity Intervals}}, booktitle = {3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024)}, pages = {11:1--11:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-315-7}, ISSN = {1868-8969}, year = {2024}, volume = {292}, editor = {Casteigts, Arnaud and Kuhn, Fabian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.11}, URN = {urn:nbn:de:0030-drops-198892}, doi = {10.4230/LIPIcs.SAND.2024.11}, annote = {Keywords: Temporal Graphs, Temporal Vertex Cover, Parameterized Complexity, Approximation Algorithms} }
Published in: LIPIcs, Volume 272, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, and Tommaso Piselli. On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges. In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 18:1-18:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{binucci_et_al:LIPIcs.MFCS.2023.18, author = {Binucci, Carla and Liotta, Giuseppe and Montecchiani, Fabrizio and Ortali, Giacomo and Piselli, Tommaso}, title = {{On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges}}, booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)}, pages = {18:1--18:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-292-1}, ISSN = {1868-8969}, year = {2023}, volume = {272}, editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.18}, URN = {urn:nbn:de:0030-drops-185524}, doi = {10.4230/LIPIcs.MFCS.2023.18}, annote = {Keywords: st-orientations, parameterized complexity, graph drawing} }