Search dblp for Publications

export results for "toc:db/journals/disopt/disopt48.bht:"

 download as .bib file

@article{DBLP:journals/disopt/AntoniadisGKK23,
  author       = {Antonios Antoniadis and
                  Themis Gouleakis and
                  Pieter Kleer and
                  Pavel Kolev},
  title        = {Secretary and online matching problems with machine learned advice},
  journal      = {Discret. Optim.},
  volume       = {48},
  number       = {Part 2},
  pages        = {100778},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.disopt.2023.100778},
  doi          = {10.1016/J.DISOPT.2023.100778},
  timestamp    = {Tue, 12 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/disopt/AntoniadisGKK23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/BacsoBKR23,
  author       = {G{\'{a}}bor Bacs{\'{o}} and
                  Bostjan Bresar and
                  Kirsti Kuenzel and
                  Douglas F. Rall},
  title        = {Graphs with equal Grundy domination and independence number},
  journal      = {Discret. Optim.},
  volume       = {48},
  number       = {Part 2},
  pages        = {100777},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.disopt.2023.100777},
  doi          = {10.1016/J.DISOPT.2023.100777},
  timestamp    = {Tue, 12 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/disopt/BacsoBKR23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/BoeckmannTP23,
  author       = {Jan Boeckmann and
                  Clemens Thielen and
                  Ulrich Pferschy},
  title        = {Approximating single- and multi-objective nonlinear sum and product
                  knapsack problems},
  journal      = {Discret. Optim.},
  volume       = {48},
  number       = {Part 1},
  pages        = {100771},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.disopt.2023.100771},
  doi          = {10.1016/J.DISOPT.2023.100771},
  timestamp    = {Tue, 12 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/disopt/BoeckmannTP23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/BuchheimH23,
  author       = {Christoph Buchheim and
                  Maja H{\"{u}}gging},
  title        = {The polytope of binary sequences with bounded variation},
  journal      = {Discret. Optim.},
  volume       = {48},
  number       = {Part 1},
  pages        = {100776},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.disopt.2023.100776},
  doi          = {10.1016/J.DISOPT.2023.100776},
  timestamp    = {Tue, 20 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/disopt/BuchheimH23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/CastroGRV23,
  author       = {Natalia de Castro and
                  Mar{\'{\i}}a {\'{A}}ngeles Garrido and
                  Rafael Robles and
                  Mar{\'{\i}}a Trinidad Villar{-}Li{\~{n}}{\'{a}}n},
  title        = {Minimum gradation in greyscales of graphs},
  journal      = {Discret. Optim.},
  volume       = {48},
  number       = {Part 1},
  pages        = {100773},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.disopt.2023.100773},
  doi          = {10.1016/J.DISOPT.2023.100773},
  timestamp    = {Tue, 12 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/disopt/CastroGRV23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/FraknoiMSL23,
  author       = {{\'{A}}d{\'{a}}m Frakn{\'{o}}i and
                  D{\'{a}}vid {\'{A}}. M{\'{a}}rton and
                  D{\'{a}}niel G. Simon and
                  D{\'{a}}niel Lenger},
  title        = {On the R{\'{e}}nyi-Ulam game with restricted size queries},
  journal      = {Discret. Optim.},
  volume       = {48},
  number       = {Part 1},
  pages        = {100772},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.disopt.2023.100772},
  doi          = {10.1016/J.DISOPT.2023.100772},
  timestamp    = {Fri, 07 Jul 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/disopt/FraknoiMSL23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/HorschS23,
  author       = {Florian H{\"{o}}rsch and
                  Zolt{\'{a}}n Szigeti},
  title        = {The complexity of 2-vertex-connected orientation in mixed graphs},
  journal      = {Discret. Optim.},
  volume       = {48},
  number       = {Part 1},
  pages        = {100774},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.disopt.2023.100774},
  doi          = {10.1016/J.DISOPT.2023.100774},
  timestamp    = {Tue, 20 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/disopt/HorschS23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/JaykrishnanL23,
  author       = {G. Jaykrishnan and
                  Asaf Levin},
  title        = {{EPTAS} for load balancing problem on parallel machines with a non-renewable
                  resource},
  journal      = {Discret. Optim.},
  volume       = {48},
  number       = {Part 1},
  pages        = {100775},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.disopt.2023.100775},
  doi          = {10.1016/J.DISOPT.2023.100775},
  timestamp    = {Fri, 07 Jul 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/disopt/JaykrishnanL23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/MiklavicPRW23,
  author       = {Stefko Miklavic and
                  Johannes Pardey and
                  Dieter Rautenbach and
                  Florian Werner},
  title        = {Maximizing the Mostar index for bipartite graphs and split graphs},
  journal      = {Discret. Optim.},
  volume       = {48},
  number       = {Part 1},
  pages        = {100768},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.disopt.2023.100768},
  doi          = {10.1016/J.DISOPT.2023.100768},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/disopt/MiklavicPRW23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/WojciechowskiSV23,
  author       = {Piotr Wojciechowski and
                  K. Subramani and
                  Alvaro Velasquez},
  title        = {Reachability in choice networks},
  journal      = {Discret. Optim.},
  volume       = {48},
  number       = {Part 1},
  pages        = {100761},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.disopt.2023.100761},
  doi          = {10.1016/J.DISOPT.2023.100761},
  timestamp    = {Fri, 09 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/WojciechowskiSV23.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.