External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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]

Authors

Walter Didimo

This author has not been identified. Look up 'Walter Didimo' in Google

Fedor V. Fomin

This author has not been identified. Look up 'Fedor V. Fomin' in Google

Petr A. Golovach

This author has not been identified. Look up 'Petr A. Golovach' in Google

Tanmay Inamdar 0002

This author has not been identified. Look up 'Tanmay Inamdar 0002' in Google

Stephen G. Kobourov

This author has not been identified. Look up 'Stephen G. Kobourov' in Google

Marie Diana Sieper

This author has not been identified. Look up 'Marie Diana Sieper' in Google
runs on