BibTeX records: Susan F. Assmann

download as .bib file

@article{DBLP:journals/dam/AssmannK84,
  author       = {Susan F. Assmann and
                  Daniel J. Kleitman},
  title        = {Characterization of curve map graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {8},
  number       = {2},
  pages        = {109--124},
  year         = {1984},
  url          = {https://doi.org/10.1016/0166-218X(84)90094-5},
  doi          = {10.1016/0166-218X(84)90094-5},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/AssmannK84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/AssmannJKL84,
  author       = {Susan F. Assmann and
                  David S. Johnson and
                  Daniel J. Kleitman and
                  Joseph Y.{-}T. Leung},
  title        = {On a Dual Version of the One-Dimensional Bin Packing Problem},
  journal      = {J. Algorithms},
  volume       = {5},
  number       = {4},
  pages        = {502--525},
  year         = {1984},
  url          = {https://doi.org/10.1016/0196-6774(84)90004-X},
  doi          = {10.1016/0196-6774(84)90004-X},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/AssmannJKL84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AssmannK83,
  author       = {Susan F. Assmann and
                  Daniel J. Kleitman},
  title        = {The number of rounds needed to exchange information within a graph},
  journal      = {Discret. Appl. Math.},
  volume       = {6},
  number       = {2},
  pages        = {117--125},
  year         = {1983},
  url          = {https://doi.org/10.1016/0166-218X(83)90065-3},
  doi          = {10.1016/0166-218X(83)90065-3},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/AssmannK83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics