Parameterized and approximation algorithms for the maximum bimodal subgraph problem

DOI10.1007/978-3-031-49275-4_13MaRDI QIDQ6618261zbMATH OpenFDO

Authors Walter Didimo, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Stephen G. Kobourov, Marie Diana Sieper

Publication date 14 October 2024

zbMATH Keywords

parameterized complexitypolynomial kernelapproximation schemeFPT algorithmsbimodal graphsmaximum bimodal subgraph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• A partial k-arboretum of graphs with bounded treewidth
• Algorithms and bounds for L-drawings of directed graphs
• An application of simultaneous diophantine approximation in combinatorial optimization
• Approximation algorithms for NP-complete problems on planar graphs
• Bounding twin-width for bounded-treewidth graphs, planar graphs, and bipartite graphs
• Computing k-modal embeddings of planar digraphs
• Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
• Graph minors. X: Obstructions to tree-decomposition
• Hierarchies and planarity theory
• Kernelization. Theory of parameterized preprocessing
• Maximum upward planar subgraphs of embedded planar digraphs
• New upper bounds on the decomposability of planar graphs
• On the complexity of k-SAT
• Parameterized algorithms
• Planar L-drawings of bimodal graphs
• Planar L-drawings of directed graphs
• Quasi-upward planar drawings with minimum curve complexity
• Quasi-upward planarity
• Which problems have strongly exponential complexity?

This page was built for publication: Parameterized and approximation algorithms for the maximum bimodal subgraph problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6618261)