×

Found 42 Documents (Results 1–42)

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

VC density of set systems definable in tree-like graphs. (English) Zbl 07559449

Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 78, 13 p. (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs. (English) Zbl 1524.68239

Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 65, 13 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

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

On multiway cut parameterized above lower bounds. (English) Zbl 1352.68100

Marx, Dániel (ed.) et al., Parameterized and exact computation. 6th international symposium, IPEC 2011, Saarbrücken, Germany, September 6–8, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-28049-8/pbk). Lecture Notes in Computer Science 7112, 1-12 (2012).
PDFBibTeX XMLCite
Full Text: DOI arXiv

An improved FPT algorithm and quadratic kernel for pathwidth one vertex deletion. (English) Zbl 1309.68090

Raman, Venkatesh (ed.) et al., Parameterized and exact computation. 5th international symposium, IPEC 2010, Chennai, India, December 13–15, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-17492-6/pbk). Lecture Notes in Computer Science 6478, 95-106 (2010).
MSC:  68Q25 05C85
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

Software