×

Found 82 Documents (Results 1–82)

On the complexity of broadcast domination and Multipacking in digraphs. (English) Zbl 1518.68263

Gąsieniec, Leszek (ed.) et al., Combinatorial algorithms. 31st international workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12126, 264-276 (2020).
Full Text: DOI

Generalized distance domination problems and their complexity on graphs of bounded mim-width. (English) Zbl 1520.05073

Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 6, 14 p. (2019).

Structural parameters, tight bounds, and approximation for \((k,r)\)-center. (English) Zbl 1457.68126

Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 50, 13 p. (2017).
Full Text: DOI

On independence domination. (English) Zbl 1390.68348

Gąsieniec, Leszek (ed.) et al., Fundamentals of computation theory. 19th international symposium, FCT 2013, Liverpool, UK, August 19–21, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40163-3/pbk). Lecture Notes in Computer Science 8070, 183-194 (2013).

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software