Domination Above r-Independence : Does Sparseness Help? / Einarson, Carl; Reidl, Felix.

44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Vol. 138 Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2019. p. 40:1-40:13 40 (Leibniz International Proceedings in Informatics (LIPIcs)).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Published

Standard

Domination Above r-Independence : Does Sparseness Help? / Einarson, Carl; Reidl, Felix.

44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Vol. 138 Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2019. p. 40:1-40:13 40 (Leibniz International Proceedings in Informatics (LIPIcs)).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Harvard

Einarson, C & Reidl, F 2019, Domination Above r-Independence: Does Sparseness Help? in 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). vol. 138, 40, Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, pp. 40:1-40:13. https://doi.org/10.4230/LIPIcs.MFCS.2019.40

APA

Einarson, C., & Reidl, F. (2019). Domination Above r-Independence: Does Sparseness Help? In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) (Vol. 138, pp. 40:1-40:13). [40] (Leibniz International Proceedings in Informatics (LIPIcs)). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2019.40

Vancouver

Einarson C, Reidl F. Domination Above r-Independence: Does Sparseness Help? In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Vol. 138. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. 2019. p. 40:1-40:13. 40. (Leibniz International Proceedings in Informatics (LIPIcs)). https://doi.org/10.4230/LIPIcs.MFCS.2019.40

Author

Einarson, Carl ; Reidl, Felix. / Domination Above r-Independence : Does Sparseness Help?. 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Vol. 138 Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2019. pp. 40:1-40:13 (Leibniz International Proceedings in Informatics (LIPIcs)).

BibTeX

@inproceedings{5d1f147ab9f94a98baeba24e02ad82c4,
title = "Domination Above r-Independence: Does Sparseness Help?",
author = "Carl Einarson and Felix Reidl",
year = "2019",
month = aug,
day = "30",
doi = "10.4230/LIPIcs.MFCS.2019.40",
language = "English",
volume = "138",
series = "Leibniz International Proceedings in Informatics (LIPIcs)",
publisher = "Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik",
pages = "40:1--40:13",
booktitle = "44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)",

}

RIS

TY - GEN

T1 - Domination Above r-Independence

T2 - Does Sparseness Help?

AU - Einarson, Carl

AU - Reidl, Felix

PY - 2019/8/30

Y1 - 2019/8/30

U2 - 10.4230/LIPIcs.MFCS.2019.40

DO - 10.4230/LIPIcs.MFCS.2019.40

M3 - Conference contribution

VL - 138

T3 - Leibniz International Proceedings in Informatics (LIPIcs)

SP - 40:1-40:13

BT - 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)

PB - Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik

ER -