Search dblp for Publications

• > Home > Search

@article{DBLP:journals/disopt/DashD24,
  author       = {Sanjeeb Dash and
                  Yatharth Dubey},
  title        = {On polytopes with linear rank with respect to generalizations of the
                  split closure},
  journal      = {Discret. Optim.},
  volume       = {51},
  pages        = {100821},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.disopt.2023.100821},
  doi          = {10.1016/J.DISOPT.2023.100821},
  timestamp    = {Fri, 31 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/disopt/DashD24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/Haugland24,
  author       = {Dag Haugland},
  title        = {Tighter bounds on the minimum broadcast time},
  journal      = {Discret. Optim.},
  volume       = {51},
  pages        = {100822},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.disopt.2024.100822},
  doi          = {10.1016/J.DISOPT.2024.100822},
  timestamp    = {Fri, 31 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/disopt/Haugland24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/HausbrandtBRS24,
  author       = {Nils Hausbrandt and
                  Oliver Bachtler and
                  Stefan Ruzika and
                  Luca E. Sch{\"{a}}fer},
  title        = {Parametric matroid interdiction},
  journal      = {Discret. Optim.},
  volume       = {51},
  pages        = {100823},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.disopt.2024.100823},
  doi          = {10.1016/J.DISOPT.2024.100823},
  timestamp    = {Sun, 04 Aug 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/disopt/HausbrandtBRS24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/Rybin24,
  author       = {Dmitry Rybin},
  title        = {When greedy gives optimal: {A} unified approach},
  journal      = {Discret. Optim.},
  volume       = {51},
  pages        = {100824},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.disopt.2024.100824},
  doi          = {10.1016/J.DISOPT.2024.100824},
  timestamp    = {Fri, 31 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/disopt/Rybin24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/WaddellA24,
  author       = {Lucas A. Waddell and
                  Warren Adams},
  title        = {Characterizing linearizable QAPs by the level-1 reformulation-linearization
                  technique},
  journal      = {Discret. Optim.},
  volume       = {51},
  pages        = {100812},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.disopt.2023.100812},
  doi          = {10.1016/J.DISOPT.2023.100812},
  timestamp    = {Fri, 31 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/disopt/WaddellA24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}