Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/gd/DidimoFGIKS23
%A Didimo, Walter
%A Fomin, Fedor V.
%A Golovach, Petr A.
%A Inamdar, Tanmay
%A Kobourov, Stephen G.
%A Sieper, Marie Diana
%B GD (2)
%D 2023
%E Bekos, Michael A.
%E Chimani, Markus
%I Springer
%K dblp
%P 189-202
%T Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem.
%U http://dblp.uni-trier.de/db/conf/gd/gd2023-2.html#DidimoFGIKS23
%V 14466
%@ 978-3-031-49275-4
@inproceedings{conf/gd/DidimoFGIKS23,
added-at = {2024-02-10T00:00:00.000+0100},
author = {Didimo, Walter and Fomin, Fedor V. and Golovach, Petr A. and Inamdar, Tanmay and Kobourov, Stephen G. and Sieper, Marie Diana},
biburl = {https://www.bibsonomy.org/bibtex/2ba2721774938049f80adab2f1bcc2eea/dblp},
booktitle = {GD (2)},
crossref = {conf/gd/2023-2},
editor = {Bekos, Michael A. and Chimani, Markus},
ee = {https://doi.org/10.1007/978-3-031-49275-4_13},
interhash = {c9095c02f480d3067b3d41f6283dcf18},
intrahash = {ba2721774938049f80adab2f1bcc2eea},
isbn = {978-3-031-49275-4},
keywords = {dblp},
pages = {189-202},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2024-04-09T20:16:33.000+0200},
title = {Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem.},
url = {http://dblp.uni-trier.de/db/conf/gd/gd2023-2.html#DidimoFGIKS23},
volume = 14466,
year = 2023
}