BibTeX record journals/mp/CohenAddadMV24

download as .bib file

@article{DBLP:journals/mp/CohenAddadMV24,
  author       = {Vincent Cohen{-}Addad and
                  Tobias M{\"{o}}mke and
                  Victor Verdugo},
  title        = {A 2-approximation for the bounded treewidth sparsest cut problem in
                  sfFPT Time},
  journal      = {Math. Program.},
  volume       = {206},
  number       = {1},
  pages        = {479--495},
  year         = {2024},
  url          = {https://doi.org/10.1007/s10107-023-02044-1},
  doi          = {10.1007/S10107-023-02044-1},
  timestamp    = {Fri, 02 Aug 2024 21:41:02 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/CohenAddadMV24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.