×

Found 7 Documents (Results 1–7)

Parameterized complexity of conflict-free matchings and paths. (English) Zbl 07561679

Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 35, 15 p. (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Exploring the kernelization borders for hitting cycles. (English) Zbl 1520.68043

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 14, 14 p. (2019).
MSC:  68Q27 05C38 68R10
PDFBibTeX XMLCite
Full Text: DOI

Conflict free feedback vertex set: a parameterized dichotomy. (English) Zbl 1512.68184

Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 53, 15 p. (2018).
MSC:  68R10 68Q17 68Q27
PDFBibTeX XMLCite
Full Text: DOI

Hitting and covering partially. (English) Zbl 1509.68106

Wang, Lusheng (ed.) et al., Computing and combinatorics. 24th international conference, COCOON 2018, Qing Dao, China, July 2–4, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10976, 751-763 (2018).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Year of Publication

Main Field