Published in: LIPIcs, Volume 321, 19th International Symposium on Parameterized and Exact Computation (IPEC 2024)
Marvin Künnemann and Mirza Redzic. Fine-Grained Complexity of Multiple Domination and Dominating Patterns in Sparse Graphs. In 19th International Symposium on Parameterized and Exact Computation (IPEC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 321, pp. 9:1-9:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{kunnemann_et_al:LIPIcs.IPEC.2024.9, author = {K\"{u}nnemann, Marvin and Redzic, Mirza}, title = {{Fine-Grained Complexity of Multiple Domination and Dominating Patterns in Sparse Graphs}}, booktitle = {19th International Symposium on Parameterized and Exact Computation (IPEC 2024)}, pages = {9:1--9:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-353-9}, ISSN = {1868-8969}, year = {2024}, volume = {321}, editor = {Bonnet, \'{E}douard and Rz\k{a}\.{z}ewski, Pawe{\l}}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2024.9}, URN = {urn:nbn:de:0030-drops-222353}, doi = {10.4230/LIPIcs.IPEC.2024.9}, annote = {Keywords: Fine-grained complexity theory, Dominating set, Sparsity in graphs, Conditionally optimal algorithms} }
Feedback for Dagstuhl Publishing