Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem

Walter Didimo, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar 0002, Stephen G. Kobourov, Marie Diana Sieper. Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem. In Michael A. Bekos, Markus Chimani, editors, Graph Drawing and Network Visualization - 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023, Revised Selected Papers, Part II. Volume 14466 of Lecture Notes in Computer Science, pages 189-202, Springer, 2023. [doi]

Abstract

Abstract is missing.