Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 7764127

From MaRDI portal
Publication:6089685
Jump to:navigation, search

DOI10.4230/LIPICS.IPEC.2020.36MaRDI QIDQ6089685FDOQ6089685


Authors: Marcin Wrochna Edit this on Wikidata


Publication date: 13 November 2023



Title of this publication is not available (Why is that?)




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
  • Worst-case Analysis of Set Union Algorithms
  • On the generalised colouring numbers of graphs that exclude a fixed minor
  • Graph bisection with Pareto optimization


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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6089685&oldid=35534831"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 10 July 2024, at 06:07. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki