scientific article; zbMATH DE number 5485472

MaRDI QIDQ3549635zbMATH OpenFDO

Authors Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger

Publication date 5 January 2009

zbMATH Keywords

interval graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Cited in

(14)

• Parameterizing above or below guaranteed values
• Minimum leaf out-branching and related problems
• On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
• A polynomial-time algorithm for outerplanar diameter improvement
• Planar disjoint-paths completion
• On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems
• A polynomial-time algorithm for outerplanar diameter improvement
• Planar disjoint-paths completion
• Wheel-Free Deletion Is W[2]-Hard
• Minimum Leaf Out-Branching Problems
• A probabilistic approach to problems parameterized above or below tight bounds
• scientific article; zbMATH DE number 7053390 (Why is no real title available?)
• Fixed-parameter complexity of minimum profile problems
• Chordal deletion is fixed-parameter tractable

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