Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/dam/AguileraKT17,
  author       = {N{\'{e}}stor E. Aguilera and
                  Ricardo D. Katz and
                  Paola B. Tolomei},
  title        = {Vertex adjacencies in the set covering polyhedron},
  journal      = {Discret. Appl. Math.},
  volume       = {218},
  pages        = {40--56},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2016.10.024},
  doi          = {10.1016/J.DAM.2016.10.024},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/AguileraKT17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Araujo-PardoBMZ17,
  author       = {Gabriela Araujo{-}Pardo and
                  Camino Balbuena and
                  Mirka Miller and
                  M{\'{a}}ria Zd{\'{\i}}malov{\'{a}}},
  title        = {A family of mixed graphs with large order and diameter 2},
  journal      = {Discret. Appl. Math.},
  volume       = {218},
  pages        = {57--63},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2016.09.034},
  doi          = {10.1016/J.DAM.2016.09.034},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/Araujo-PardoBMZ17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChenSV17,
  author       = {Zhibing Chen and
                  Guifu Su and
                  Lutz Volkmann},
  title        = {Sufficient conditions on the zeroth-order general Randi{\'{c}}
                  index for maximally edge-connected graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {218},
  pages        = {64--70},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2016.11.002},
  doi          = {10.1016/J.DAM.2016.11.002},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/ChenSV17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DasFPT17,
  author       = {Kinkar Chandra Das and
                  Eliseu Fritscher and
                  Luc{\'{e}}lia Kowalski Pinheiro and
                  Vilmar Trevisan},
  title        = {Maximum Laplacian energy of unicyclic graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {218},
  pages        = {71--81},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2016.10.023},
  doi          = {10.1016/J.DAM.2016.10.023},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/DasFPT17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DehghanA17,
  author       = {Ali Dehghan and
                  Mohsen Molla Haji Aghaei},
  title        = {On the algorithmic complexity of adjacent vertex closed distinguishing
                  colorings number of graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {218},
  pages        = {82--97},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2016.10.028},
  doi          = {10.1016/J.DAM.2016.10.028},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/DehghanA17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/IhmP17,
  author       = {Insung Ihm and
                  Jung{-}Heum Park},
  title        = {A linear-time algorithm for finding a paired 2-disjoint path cover
                  in the cube of a connected graph},
  journal      = {Discret. Appl. Math.},
  volume       = {218},
  pages        = {98--112},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2016.10.027},
  doi          = {10.1016/J.DAM.2016.10.027},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/IhmP17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KoshevoyST17,
  author       = {Gleb A. Koshevoy and
                  Takamasa Suzuki and
                  Dolf Talman},
  title        = {Cooperative games with restricted formation of coalitions},
  journal      = {Discret. Appl. Math.},
  volume       = {218},
  pages        = {1--13},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2016.09.003},
  doi          = {10.1016/J.DAM.2016.09.003},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/KoshevoyST17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KronenthalW17,
  author       = {Brian G. Kronenthal and
                  Wing Hong Tony Wong},
  title        = {Paired many-to-many disjoint path covers of hypertori},
  journal      = {Discret. Appl. Math.},
  volume       = {218},
  pages        = {14--20},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2016.09.020},
  doi          = {10.1016/J.DAM.2016.09.020},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/KronenthalW17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LinC17,
  author       = {Min{-}Sheng Lin and
                  Chien{-}Min Chen},
  title        = {Counting independent sets in tree convex bipartite graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {218},
  pages        = {113--122},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2016.08.017},
  doi          = {10.1016/J.DAM.2016.08.017},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/LinC17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MorganC17,
  author       = {Kerri Morgan and
                  Rui Chen},
  title        = {An infinite family of 2-connected graphs that have reliability factorisations},
  journal      = {Discret. Appl. Math.},
  volume       = {218},
  pages        = {123--127},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2016.11.006},
  doi          = {10.1016/J.DAM.2016.11.006},
  timestamp    = {Thu, 17 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/MorganC17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/YanR17,
  author       = {Kedong Yan and
                  Hong Seo Ryoo},
  title        = {0-1 multilinear programming as a unifying theory for {LAD} pattern
                  generation},
  journal      = {Discret. Appl. Math.},
  volume       = {218},
  pages        = {21--39},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2016.08.007},
  doi          = {10.1016/J.DAM.2016.08.007},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/YanR17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics