×

Found 9 Documents (Results 1–9)

On the parameterized complexity of reconfiguration of connected dominating sets. (English) Zbl 07764115

Cao, Yixin (ed.) et al., 15th international symposium on parameterized and exact computation, IPEC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 180, Article 24, 15 p. (2020).
MSC:  68Q25 68Q27 68Wxx
PDFBibTeX XMLCite
Full Text: DOI

On the parameterized complexity of \([1,j]\)-domination problems. (English) Zbl 1528.68264

Ganguly, Sumit (ed.) et al., 38th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2018, Ahmedabad, India, December 11–13, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 122, Article 34, 14 p. (2018).
MSC:  68R10 68Q27
PDFBibTeX XMLCite
Full Text: DOI

Lossy kernels for connected dominating set on sparse graphs. (English) Zbl 1487.68176

Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 29, 15 p. (2018).
MSC:  68R10 05C69 68Q27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Reconfiguration on sparse graphs. (English) Zbl 1451.68134

Dehne, Frank (ed.) et al., Algorithms and data structures. 14th international symposium, WADS 2015, Victoria, BC, Canada, August 5–7, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9214, 506-517 (2015).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

Year of Publication

Main Field