@InProceedings{hartmann_et_al:LIPIcs.STACS.2025.44, author = {Hartmann, Tim A. and Marx, D\'{a}niel}, title = {{Independence and Domination on Bounded-Treewidth Graphs: Integer, Rational, and Irrational Distances}}, booktitle = {42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025)}, pages = {44:1--44:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-365-2}, ISSN = {1868-8969}, year = {2025}, volume = {327}, editor = {Beyersdorff, Olaf and Pilipczuk, Micha{\l} and Pimentel, Elaine and Thắng, Nguy\~{ê}n Kim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.44}, URN = {urn:nbn:de:0030-drops-228700}, doi = {10.4230/LIPIcs.STACS.2025.44}, annote = {Keywords: Independence, Domination, Irrationals, Treewidth, SETH} }
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing