Published in: LIPIcs, Volume 308, 32nd Annual European Symposium on Algorithms (ESA 2024)
Bart M.P. Jansen and Céline M.F. Swennenhuis. Steiner Tree Parameterized by Multiway Cut and Even Less. In 32nd Annual European Symposium on Algorithms (ESA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 308, pp. 76:1-76:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{jansen_et_al:LIPIcs.ESA.2024.76, author = {Jansen, Bart M.P. and Swennenhuis, C\'{e}line M.F.}, title = {{Steiner Tree Parameterized by Multiway Cut and Even Less}}, booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)}, pages = {76:1--76:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-338-6}, ISSN = {1868-8969}, year = {2024}, volume = {308}, editor = {Chan, Timothy and Fischer, Johannes and Iacono, John and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.76}, URN = {urn:nbn:de:0030-drops-211471}, doi = {10.4230/LIPIcs.ESA.2024.76}, annote = {Keywords: fixed-parameter tractability, Steiner Tree, structural parameterization, H-treewidth} }
Published in: LIPIcs, Volume 219, 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)
Jesper Nederlof, Michał Pilipczuk, Céline M. F. Swennenhuis, and Karol Węgrzycki. Isolation Schemes for Problems on Decomposable Graphs. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 50:1-50:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{nederlof_et_al:LIPIcs.STACS.2022.50, author = {Nederlof, Jesper and Pilipczuk, Micha{\l} and Swennenhuis, C\'{e}line M. F. and W\k{e}grzycki, Karol}, title = {{Isolation Schemes for Problems on Decomposable Graphs}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {50:1--50:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra and Monmege, Benjamin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2022.50}, URN = {urn:nbn:de:0030-drops-158601}, doi = {10.4230/LIPIcs.STACS.2022.50}, annote = {Keywords: Isolation Lemma, Derandomization, Hamiltonian Cycle, Exact Algorithms} }
Published in: LIPIcs, Volume 214, 16th International Symposium on Parameterized and Exact Computation (IPEC 2021)
Hans L. Bodlaender, Carla Groenland, and Céline M. F. Swennenhuis. Parameterized Complexities of Dominating and Independent Set Reconfiguration. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 9:1-9:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{bodlaender_et_al:LIPIcs.IPEC.2021.9, author = {Bodlaender, Hans L. and Groenland, Carla and Swennenhuis, C\'{e}line M. F.}, title = {{Parameterized Complexities of Dominating and Independent Set Reconfiguration}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {9:1--9:16}, 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.9}, URN = {urn:nbn:de:0030-drops-153920}, doi = {10.4230/LIPIcs.IPEC.2021.9}, annote = {Keywords: Parameterized complexity, independent set reconfiguration, dominating set reconfiguration, W-hierarchy, XL, XNL, XNLP} }
Published in: LIPIcs, Volume 180, 15th International Symposium on Parameterized and Exact Computation (IPEC 2020)
Jesper Nederlof and Céline M. F. Swennenhuis. On the Fine-Grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan. In 15th International Symposium on Parameterized and Exact Computation (IPEC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 180, pp. 25:1-25:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{nederlof_et_al:LIPIcs.IPEC.2020.25, author = {Nederlof, Jesper and Swennenhuis, C\'{e}line M. F.}, title = {{On the Fine-Grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan}}, booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)}, pages = {25:1--25:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-172-6}, ISSN = {1868-8969}, year = {2020}, volume = {180}, editor = {Cao, Yixin and Pilipczuk, Marcin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.25}, URN = {urn:nbn:de:0030-drops-133287}, doi = {10.4230/LIPIcs.IPEC.2020.25}, annote = {Keywords: Fixed-Parameter Tractability, Scheduling, Precedence Constraints} }
Feedback for Dagstuhl Publishing