scientific article; zbMATH DE number 7764127

DOI10.4230/LIPICS.IPEC.2020.36MaRDI QIDQ6089685zbMATH OpenFDO

Authors Marcin Wrochna

Publication date 13 November 2023

zbMATH Keywords

decompositionheuristictreedepthweak colouring numbers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)

Cites work

• Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
• Graph bisection with Pareto optimization
• On the generalised colouring numbers of graphs that exclude a fixed minor
• Worst-case Analysis of Set Union Algorithms

Cited in

(1)

• The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6089685)