Search dblp for Publications

export results for "toc:db/journals/dam/dam301.bht:"

 download as .bib file

@article{DBLP:journals/dam/BartierBBLN21,
  author       = {Valentin Bartier and
                  Laurine B{\'{e}}n{\'{e}}teau and
                  Marthe Bonamy and
                  Hoang La and
                  Jonathan Narboni},
  title        = {A note on deterministic zombies},
  journal      = {Discret. Appl. Math.},
  volume       = {301},
  pages        = {65--68},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.dam.2021.05.001},
  doi          = {10.1016/J.DAM.2021.05.001},
  timestamp    = {Tue, 13 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/BartierBBLN21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/BonamyDO21,
  author       = {Marthe Bonamy and
                  Paul Dorbec and
                  Paul Ouvrard},
  title        = {Dominating sets reconfiguration under token sliding},
  journal      = {Discret. Appl. Math.},
  volume       = {301},
  pages        = {6--18},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.dam.2021.05.014},
  doi          = {10.1016/J.DAM.2021.05.014},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/BonamyDO21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/ByrnesS21,
  author       = {Kevin M. Byrnes and
                  Florin Spinu},
  title        = {On the asymptotic order of circuit codes},
  journal      = {Discret. Appl. Math.},
  volume       = {301},
  pages        = {69--73},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.dam.2021.05.003},
  doi          = {10.1016/J.DAM.2021.05.003},
  timestamp    = {Tue, 13 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/ByrnesS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/CampeloS21,
  author       = {Manoel B. Camp{\^{e}}lo and
                  Daniel Sever{\'{\i}}n},
  title        = {An integer programming approach for solving a generalized version
                  of the Grundy domination number},
  journal      = {Discret. Appl. Math.},
  volume       = {301},
  pages        = {26--48},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.dam.2021.05.025},
  doi          = {10.1016/J.DAM.2021.05.025},
  timestamp    = {Tue, 13 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/CampeloS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Dankelmann21,
  author       = {Peter Dankelmann},
  title        = {Proof of a conjecture on the Wiener index of Eulerian graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {301},
  pages        = {99--108},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.dam.2021.05.006},
  doi          = {10.1016/J.DAM.2021.05.006},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/Dankelmann21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/FilhoBCOPP21,
  author       = {Gilberto Farias de Sousa Filho and
                  Teobaldo Bulh{\~{o}}es and
                  Luc{\'{\i}}dio dos Anjos F. Cabral and
                  Luiz Satoru Ochi and
                  F{\'{a}}bio Protti and
                  Rian G. S. Pinheiro},
  title        = {The biclique partitioning polytope},
  journal      = {Discret. Appl. Math.},
  volume       = {301},
  pages        = {118--130},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.dam.2021.05.023},
  doi          = {10.1016/J.DAM.2021.05.023},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/FilhoBCOPP21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/GanX21,
  author       = {Zhiyong Gan and
                  Yanping Xu},
  title        = {Hamiltonian and long cycles in bipartite graphs with connectivity},
  journal      = {Discret. Appl. Math.},
  volume       = {301},
  pages        = {49--64},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.dam.2021.05.027},
  doi          = {10.1016/J.DAM.2021.05.027},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/GanX21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/HoroldagvaBDAA21,
  author       = {Batmend Horoldagva and
                  Lkhagva Buyantogtokh and
                  Shiikhar Dorjsembe and
                  Enkhbayar Azjargal and
                  Damchaa Adiyanyam},
  title        = {On graphs with maximum average eccentricity},
  journal      = {Discret. Appl. Math.},
  volume       = {301},
  pages        = {109--117},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.dam.2021.05.026},
  doi          = {10.1016/J.DAM.2021.05.026},
  timestamp    = {Tue, 13 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/HoroldagvaBDAA21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/LiuC21,
  author       = {Yuchen Liu and
                  Yaojun Chen},
  title        = {Gallai and {\(\mathscr{l}\)}-uniform Ramsey numbers of complete bipartite
                  graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {301},
  pages        = {131--139},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.dam.2021.05.028},
  doi          = {10.1016/J.DAM.2021.05.028},
  timestamp    = {Tue, 13 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/LiuC21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/MazzuoccoloM21,
  author       = {Giuseppe Mazzuoccolo and
                  Lorenzo Mella},
  title        = {On the ratio between the maximum weight of a perfect matching and
                  the maximum weight of a matching},
  journal      = {Discret. Appl. Math.},
  volume       = {301},
  pages        = {19--25},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.dam.2021.05.009},
  doi          = {10.1016/J.DAM.2021.05.009},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/MazzuoccoloM21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Sun21,
  author       = {Ping Sun},
  title        = {Strictly unimodality of the probability that the binomial distribution
                  is more than its expectation},
  journal      = {Discret. Appl. Math.},
  volume       = {301},
  pages        = {1--5},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.dam.2021.05.013},
  doi          = {10.1016/J.DAM.2021.05.013},
  timestamp    = {Tue, 13 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/Sun21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/TurcotteY21,
  author       = {J{\'{e}}r{\'{e}}mie Turcotte and
                  Samuel Yvon},
  title        = {4-cop-win graphs have at least 19 vertices},
  journal      = {Discret. Appl. Math.},
  volume       = {301},
  pages        = {74--98},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.dam.2021.05.012},
  doi          = {10.1016/J.DAM.2021.05.012},
  timestamp    = {Tue, 13 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/TurcotteY21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.