scientific article; zbMATH DE number 7788388

DOI10.5555/3458064.3458114MaRDI QIDQ6147300zbMATH OpenFDO

Authors Jiehua Chen, Wojciech Czerwiński, Y. Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Marcin Pilipczuk, Michał Pilipczuk, Manuel Sorge, Bartłomiej Wróblewski, Anna Zych-Pawlewicz

Publication date 15 January 2024

Full work available at URL https://arxiv.org/abs/2006.00571

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(8)

• Decremental sensitivity oracles for covering and packing minors
• Closure property of contraction-depth of matroids
• Maintaining \(\mathrm{CMSO}_2\) properties on dynamic structures with bounded feedback vertex number
• Computing treedepth in polynomial space and linear FPT time
• Dynamic coloring of unit interval graphs with limited recourse budget
• Parameterized dynamic data structure for split completion
• Dynamic parameterized feedback problems in tournaments
• Dynamic parameterized problems on unit disk graphs

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