American Psychological Association 6th edition

Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, & Philip Wellnitz. (2025). Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs—Part I: Algorithmic Results. ACM Transactions on Algorithms, 21, 1-45. https://doi.org/10.1145/3731452

ISO-690 (author-date, English)

JACOB FOCKE, DÁNIEL MARX, FIONN MC INERNEY, DANIEL NEUEN, GOVIND S. SANKAR, PHILIPP SCHEPPER und PHILIP WELLNITZ, 2025. Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs—Part I: Algorithmic Results. ACM Transactions on Algorithms. 28 Juli 2025. Vol. 21, , p. 1-45. DOI 10.1145/3731452.

Modern Language Association 9th edition

Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, und Philip Wellnitz. „Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs—Part I: Algorithmic Results“. ACM Transactions on Algorithms, Bd. 21, Juli 2025, S. 1-45, https://doi.org/10.1145/3731452.

Mohr Siebeck - Recht (Deutsch - Österreich)

Jacob Focke/Dániel Marx/Fionn Mc Inerney/Daniel Neuen/Govind S. Sankar/Philipp Schepper u. a.: Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs—Part I: Algorithmic Results, ACM Transactions on Algorithms 2025, 1-45.

Emerald - Harvard

Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper und Philip Wellnitz. (2025), „Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs—Part I: Algorithmic Results“, ACM Transactions on Algorithms, Vol. 21, S. 1-45.

Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.