scientific article; zbMATH DE number 7788352

DOI10.5555/3458064.3458078MaRDI QIDQ6147261zbMATH OpenFDO

Authors Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi

Publication date 15 January 2024

Full work available at URL https://doi.org/10.5555/3458064.3458078

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(14)

• Fundamental problems on bounded-treewidth graphs: the real source of hardness
• Search-space reduction via essential vertices revisited: vertex multicut and cograph deletion
• Search-space reduction via essential vertices revisited: vertex multicut and cograph deletion
• Sidestepping barriers for dominating set in parameterized complexity
• Approximate monotone local search for weighted problems
• Parameterized complexity classification for interval constraints
• Data reduction for directed feedback vertex set on graphs without long induced cycles. Three rules to rule them all
• Faster exponential-time approximation algorithms using approximate monotone local search
• Structural parameterizations for two bounded degree problems revisited
• On approximability of propositional model counting
• Parameterized approximation scheme for feedback vertex set
• Parameterized approximability for modular linear equations
• All-subsets important separators with applications to sample sets, balanced separators and vertex sparsifiers in directed graphs
• Approximate monotone local search for weighted problems

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