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 7489399

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

DOI10.4230/LIPICS.IPEC.2021.0zbMATH Open1482.68023MaRDI QIDQ5062015FDOQ5062015


Authors:


Publication date: 15 March 2022


Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2021/15382/pdf/lipics-vol214-ipec2021-complete.pdf

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




Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Parameterized complexity, tractability and kernelization (68Q27)



Cited In (4)

  • Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
  • Graphs of bounded twin-width are quasi-polynomially \(\chi \)-bounded
  • Twin-width can be exponential in treewidth
  • Maximum matching in almost linear time on graphs of bounded clique-width





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 Q5062015)

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