×

Found 19 Documents (Results 1–19)

Finding large H-colorable subgraphs in hereditary graph classes. (English) Zbl 07651174

Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 35, 17 p. (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Polynomial kernelization for removing induced claws and diamonds. (English) Zbl 1362.68104

Mayr, Ernst W. (ed.), Graph-theoretic concepts in computer science. 41st international workshop, WG 2015, Garching, Germany, June 17–19, 2015. Revised papers. Berlin: Springer (ISBN 978-3-662-53173-0/pbk; 978-3-662-53174-7/ebook). Lecture Notes in Computer Science 9224, 440-455 (2016).
MSC:  68Q25 68Q17 68R10
PDFBibTeX XMLCite
Full Text: DOI Link

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field