Parameterized and approximation algorithms for the maximum bimodal subgraph problem

DOI10.1007/978-3-031-49275-4_13MaRDI QIDQ6618261

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

Publication date: 14 October 2024

zbMATH Keywords

approximation schemeparameterized complexitypolynomial kernelFPT 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

• Title not available (Why is that?)
• Polynomial kernels for weighted problems
• Maximum upward planar subgraphs of embedded planar digraphs
• An application of simultaneous diophantine approximation in combinatorial optimization
• Graph minors. X: Obstructions to tree-decomposition
• A partial k-arboretum of graphs with bounded treewidth
• Quasi-upward planarity
• Which problems have strongly exponential complexity?
• Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
• Quasi-upward planar drawings with minimum curve complexity
• Algorithms and Bounds for L-Drawings of Directed Graphs
• New upper bounds on the decomposability of planar graphs
• Hierarchies and planarity theory
• Approximation algorithms for NP-complete problems on planar graphs
• Planar L-Drawings of Directed Graphs
• Kernelization
• Planar L-Drawings of Bimodal Graphs
• Computing k-modal embeddings of planar digraphs
• Parameterized Algorithms
• On the complexity of \(k\)-SAT
• Bounding twin-width for bounded-treewidth graphs, planar graphs, and bipartite graphs

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)