Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/dam/dam161.bht:"
download as .bib file
@article{DBLP:journals/dam/0002SW13,
author = {Yiqiao Wang and
Qiaojun Shu and
Weifan Wang},
title = {The acyclic edge coloring of planar graphs without a 3-cycle adjacent
to a 4-cycle},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2687--2694},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.04.004},
doi = {10.1016/J.DAM.2013.04.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/0002SW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AbajoCDG13,
author = {Encarnaci{\'{o}}n Abajo and
Roc{\'{\i}}o M. Casablanca and
Ana Di{\'{a}}nez and
Pedro Garc{\'{\i}}a{-}V{\'{a}}zquez},
title = {On average connectivity of the strong product of graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {2795--2801},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.06.005},
doi = {10.1016/J.DAM.2013.06.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AbajoCDG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AcharyaS13,
author = {Mukti Acharya and
Deepa Sinha},
title = {Characterization of signed line digraphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {9},
pages = {1170--1172},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.10.005},
doi = {10.1016/J.DAM.2012.10.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AcharyaS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AdamsHKTZ13,
author = {Sarah Spence Adams and
Noura Howell and
Nathaniel J. Karst and
Denise Sakai Troxell and
Junjie Zhu},
title = {On the \emph{L}(2, 1)-labelings of amalgamations of graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {881--888},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.11.007},
doi = {10.1016/J.DAM.2012.11.007},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/AdamsHKTZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AdarichevaNR13,
author = {Kira V. Adaricheva and
James B. Nation and
Robert Rand},
title = {Ordered direct implicational basis of a finite closure system},
journal = {Discret. Appl. Math.},
volume = {161},
number = {6},
pages = {707--723},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.031},
doi = {10.1016/J.DAM.2012.08.031},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/AdarichevaNR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AddisSG13,
author = {Bernardetta Addis and
Marco Di Summa and
Andrea Grosso},
title = {Identifying critical nodes in undirected graphs: Complexity results
and polynomial algorithms for the case of bounded treewidth},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2349--2360},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.021},
doi = {10.1016/J.DAM.2013.03.021},
timestamp = {Sat, 02 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/AddisSG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AlahmadiACST13,
author = {Adel Alahmadi and
Robert E. L. Aldred and
Romar dela Cruz and
Patrick Sol{\'{e}} and
Carsten Thomassen},
title = {The maximum number of minimal codewords in long codes},
journal = {Discret. Appl. Math.},
volume = {161},
number = {3},
pages = {424--429},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.09.009},
doi = {10.1016/J.DAM.2012.09.009},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/AlahmadiACST13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AliMM13,
author = {Patrick Ali and
Simon Mukwembi and
Sheunesu Munyira},
title = {Degree distance and vertex-connectivity},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {2802--2811},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.06.033},
doi = {10.1016/J.DAM.2013.06.033},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AliMM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Andriantiana13,
author = {Eric Ould Dadah Andriantiana},
title = {Energy, Hosoya index and Merrifield-Simmons index of trees with prescribed
degree sequence},
journal = {Discret. Appl. Math.},
volume = {161},
number = {6},
pages = {724--741},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.10.010},
doi = {10.1016/J.DAM.2012.10.010},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Andriantiana13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AngelCL13,
author = {Eric Angel and
Romain Campigotto and
Christian Laforest},
title = {A new lower bound on the independence number of graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {6},
pages = {847--852},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.10.001},
doi = {10.1016/J.DAM.2012.10.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AngelCL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AnilyP13,
author = {Shoshana Anily and
Aharona Pfeffer},
title = {The uncapacitated swapping problem on a line and on a circle},
journal = {Discret. Appl. Math.},
volume = {161},
number = {4-5},
pages = {454--465},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.07.002},
doi = {10.1016/J.DAM.2012.07.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AnilyP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AnjosV13,
author = {Miguel F. Anjos and
Manuel V. C. Vieira},
title = {Semidefinite resolution and exactness of semidefinite relaxations
for satisfiability},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {2812--2826},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.06.021},
doi = {10.1016/J.DAM.2013.06.021},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/AnjosV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AouchicheH13,
author = {Mustapha Aouchiche and
Pierre Hansen},
title = {A survey of Nordhaus-Gaddum type relations},
journal = {Discret. Appl. Math.},
volume = {161},
number = {4-5},
pages = {466--546},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2011.12.018},
doi = {10.1016/J.DAM.2011.12.018},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AouchicheH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AracenaDFM13,
author = {Julio Aracena and
Jacques Demongeot and
Eric Fanchon and
Marco Montalva},
title = {On the number of update digraphs and its relation with the feedback
arc sets and tournaments},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1345--1355},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.12.018},
doi = {10.1016/J.DAM.2012.12.018},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AracenaDFM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AracenaGS13,
author = {Julio Aracena and
Luis G{\'{o}}mez and
Lilian Salinas},
title = {Limit cycles and update digraphs in Boolean networks},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {1--12},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.07.003},
doi = {10.1016/J.DAM.2012.07.003},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/AracenaGS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ArchettiBS13,
author = {Claudia Archetti and
Nicola Bianchessi and
Maria Grazia Speranza},
title = {Optimal solutions for routing problems with profits},
journal = {Discret. Appl. Math.},
volume = {161},
number = {4-5},
pages = {547--557},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2011.12.021},
doi = {10.1016/J.DAM.2011.12.021},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/ArchettiBS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ArtigasDDSY13,
author = {Danilo Artigas and
Simone Dantas and
Mitre Costa Dourado and
Jayme Luiz Szwarcfiter and
Sei{-}ichi Yamaguchi},
title = {On the contour of graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1356--1362},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.12.024},
doi = {10.1016/J.DAM.2012.12.024},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ArtigasDDSY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ArumugamJBT13,
author = {S. Arumugam and
Bibin K. Jose and
Csilla Bujt{\'{a}}s and
Zsolt Tuza},
title = {Equality of domination and transversal numbers in hypergraphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {1859--1867},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.009},
doi = {10.1016/J.DAM.2013.02.009},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/ArumugamJBT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AsahiroMMO13,
author = {Yuichi Asahiro and
Eiji Miyano and
Toshihide Murata and
Hirotaka Ono},
title = {Optimal approximability of bookmark assignments},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2361--2366},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.05.018},
doi = {10.1016/J.DAM.2013.05.018},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AsahiroMMO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Asveld13,
author = {Peter R. J. Asveld},
title = {Permuting operations on strings and the distribution of their prime
numbers},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {1868--1881},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.002},
doi = {10.1016/J.DAM.2013.03.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Asveld13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AugerCHL13,
author = {David Auger and
Ir{\`{e}}ne Charon and
Olivier Hudry and
Antoine Lobstein},
title = {Watching systems in graphs: An extension of identifying codes},
journal = {Discret. Appl. Math.},
volume = {161},
number = {12},
pages = {1674--1685},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2011.04.025},
doi = {10.1016/J.DAM.2011.04.025},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AugerCHL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AverbakhB13,
author = {Igor Averbakh and
Mehmet Baysan},
title = {Batching and delivery in semi-online distribution systems},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {28--42},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.003},
doi = {10.1016/J.DAM.2012.08.003},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/AverbakhB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AvgustinovichKV13,
author = {Sergey V. Avgustinovich and
Sergey Kitaev and
Alexandr Valyuzhenich},
title = {Avoidance of boxed mesh patterns on permutations},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {43--51},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.015},
doi = {10.1016/J.DAM.2012.08.015},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AvgustinovichKV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AxenovichKOR13,
author = {Maria Axenovich and
Marcus Krug and
Georg Osang and
Ignaz Rutter},
title = {Fork-forests in bi-colored complete bipartite graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1363--1366},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.01.023},
doi = {10.1016/J.DAM.2013.01.023},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AxenovichKOR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AzariI13,
author = {Mahdieh Azari and
Ali Iranmanesh},
title = {Computing the eccentric-distance sum for graph operations},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {2827--2840},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.06.003},
doi = {10.1016/J.DAM.2013.06.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AzariI13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BabinK13,
author = {Mikhail A. Babin and
Sergei O. Kuznetsov},
title = {Computing premises of a minimal cover of functional dependencies is
intractable},
journal = {Discret. Appl. Math.},
volume = {161},
number = {6},
pages = {742--749},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.10.026},
doi = {10.1016/J.DAM.2012.10.026},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BabinK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BalakrishnanR13,
author = {Rangaswami Balakrishnan and
S. Francis Raj},
title = {Bounds for the \emph{b}-chromatic number of \emph{G}-\emph{v}},
journal = {Discret. Appl. Math.},
volume = {161},
number = {9},
pages = {1173--1179},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2011.08.022},
doi = {10.1016/J.DAM.2011.08.022},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BalakrishnanR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Balazs13,
author = {P{\'{e}}ter Bal{\'{a}}zs},
title = {Complexity results for reconstructing binary images with disjoint
components from horizontal and vertical projections},
journal = {Discret. Appl. Math.},
volume = {161},
number = {15},
pages = {2224--2235},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.004},
doi = {10.1016/J.DAM.2013.02.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Balazs13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BalbuenaGM13,
author = {Camino Balbuena and
Diego Gonz{\'{a}}lez{-}Moreno and
Juan Jos{\'{e}} Montellano{-}Ballesteros},
title = {A note on the upper bound and girth pair of (\emph{k};\emph{g})-cages},
journal = {Discret. Appl. Math.},
volume = {161},
number = {6},
pages = {853--857},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.10.008},
doi = {10.1016/J.DAM.2012.10.008},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BalbuenaGM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BalbuenaM13,
author = {Camino Balbuena and
Xavier Marcote},
title = {The k-restricted edge-connectivity of a product of graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {52--59},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.001},
doi = {10.1016/J.DAM.2012.08.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BalbuenaM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Bang-JensenMS13,
author = {J{\o}rgen Bang{-}Jensen and
Alessandro Maddaloni and
Sven Simonsen},
title = {Quasi-hamiltonian paths in semicomplete multipartite digraphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {889--898},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.12.003},
doi = {10.1016/J.DAM.2012.12.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Bang-JensenMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Bang-JensenS13,
author = {J{\o}rgen Bang{-}Jensen and
Sven Simonsen},
title = {Arc-disjoint paths and trees in 2-regular digraphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2724--2730},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.04.018},
doi = {10.1016/J.DAM.2013.04.018},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Bang-JensenS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BanicaN13,
author = {Teodor Banica and
Ion Nechita},
title = {Almost Hadamard matrices: The case of arbitrary exponents},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2367--2379},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.05.012},
doi = {10.1016/J.DAM.2013.05.012},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BanicaN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BatenburgFHT13,
author = {Kees Joost Batenburg and
Wagner Fortes and
Lajos Hajdu and
Robert Tijdeman},
title = {Bounds on the quality of reconstructed images in binary tomography},
journal = {Discret. Appl. Math.},
volume = {161},
number = {15},
pages = {2236--2251},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.11.010},
doi = {10.1016/J.DAM.2012.11.010},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BatenburgFHT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BaudrierTD13,
author = {{\'{E}}tienne Baudrier and
Mohamed Tajine and
Alain Daurat},
title = {Polygonal estimation of planar convex-set perimeter from its two projections},
journal = {Discret. Appl. Math.},
volume = {161},
number = {15},
pages = {2252--2268},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.07.005},
doi = {10.1016/J.DAM.2012.07.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BaudrierTD13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BazganCR13,
author = {Cristina Bazgan and
Morgan Chopin and
Bernard Ries},
title = {The firefighter problem with more than one firefighter on trees},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {899--908},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.11.011},
doi = {10.1016/J.DAM.2012.11.011},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BazganCR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BazganJV13,
author = {Cristina Bazgan and
Florian Jamain and
Daniel Vanderpooten},
title = {On the number of non-dominated points of a multicriteria optimization
problem},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {2841--2850},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.07.010},
doi = {10.1016/J.DAM.2013.07.010},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BazganJV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Beardon13,
author = {Alan F. Beardon},
title = {Resolving the hypercube},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {1882--1887},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.012},
doi = {10.1016/J.DAM.2013.02.012},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Beardon13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Bell13,
author = {Jordan R. Bell},
title = {Cyclotomic orthomorphisms of finite fields},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {294--300},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.013},
doi = {10.1016/J.DAM.2012.08.013},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Bell13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BelmonteHKPT13,
author = {R{\'{e}}my Belmonte and
Pim van 't Hof and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
title = {Characterizing graphs of small carving-width},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {1888--1893},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.036},
doi = {10.1016/J.DAM.2013.02.036},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BelmonteHKPT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BelohlavekV13,
author = {Radim Belohl{\'{a}}vek and
Vil{\'{e}}m Vychodil},
title = {Closure-based constraints in formal concept analysis},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {1894--1911},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.029},
doi = {10.1016/J.DAM.2013.02.029},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BelohlavekV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BelottiGPRT13,
author = {Pietro Belotti and
Julio Cesar Goez and
Imre P{\'{o}}lik and
Ted K. Ralphs and
Tam{\'{a}}s Terlaky},
title = {On families of quadratic surfaces having fixed intersections with
two hyperplanes},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2778--2793},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.05.017},
doi = {10.1016/J.DAM.2013.05.017},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BelottiGPRT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BhattacharyaS13,
author = {Amitava Bhattacharya and
Navin M. Singhi},
title = {Some approaches for solving the general (\emph{t}, \emph{k})-design
existence problem and other related problems},
journal = {Discret. Appl. Math.},
volume = {161},
number = {9},
pages = {1180--1186},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.03.011},
doi = {10.1016/J.DAM.2012.03.011},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BhattacharyaS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BianchiCT13,
author = {Monica Bianchi and
Alessandra Cornaro and
Anna Torriero},
title = {A majorization method for localizing graph topological indices},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2731--2739},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.04.023},
doi = {10.1016/J.DAM.2013.04.023},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BianchiCT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BiedlDEFY13,
author = {Therese Biedl and
Stephane Durocher and
C{\'{e}}line Engelbeen and
Samuel Fiorini and
Maxwell Young},
title = {Faster optimal algorithms for segment minimization with small maximal
value},
journal = {Discret. Appl. Math.},
volume = {161},
number = {3},
pages = {317--329},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.09.011},
doi = {10.1016/J.DAM.2012.09.011},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BiedlDEFY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BilleraB13,
author = {Louis J. Billera and
Sa{\'{u}}l A. Blanco},
title = {Bandwidth of the product of paths of the same length},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {3080--3086},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.05.038},
doi = {10.1016/J.DAM.2013.05.038},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BilleraB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Binkele-RaibleF13,
author = {Daniel Binkele{-}Raible and
Henning Fernau},
title = {Packing paths: Recycling saves time},
journal = {Discret. Appl. Math.},
volume = {161},
number = {12},
pages = {1686--1698},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2011.11.008},
doi = {10.1016/J.DAM.2011.11.008},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Binkele-RaibleF13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Blanchet-SadriS13,
author = {Francine Blanchet{-}Sadri and
Sean Simmons},
title = {Counting minimal semi-Sturmian words},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {2851--2861},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.07.008},
doi = {10.1016/J.DAM.2013.07.008},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Blanchet-SadriS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BojilovCHN13,
author = {Asen Bojilov and
Yair Caro and
Adriana Hansberg and
Nedyalko Nenov},
title = {Partitions of graphs into small and large sets},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {1912--1924},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.038},
doi = {10.1016/J.DAM.2013.02.038},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BojilovCHN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BokowskiS13,
author = {J{\"{u}}rgen Bokowski and
Ernesto Staffetti},
title = {Checking oriented matroid isomorphism by means of canonical labeling},
journal = {Discret. Appl. Math.},
volume = {161},
number = {15},
pages = {2269--2280},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.035},
doi = {10.1016/J.DAM.2012.08.035},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BokowskiS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BomhoffM13,
author = {Matthijs Bomhoff and
Bodo Manthey},
title = {Bisimplicial edges in bipartite graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {12},
pages = {1699--1706},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2011.03.004},
doi = {10.1016/J.DAM.2011.03.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BomhoffM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BonomoDDFGS13,
author = {Flavia Bonomo and
Mitre Costa Dourado and
Guillermo Dur{\'{a}}n and
Lu{\'{e}}rbio Faria and
Luciano N. Grippo and
Mart{\'{\i}}n Dar{\'{\i}}o Safe},
title = {Forbidden subgraphs and the K{\"{o}}nig-Egerv{\'{a}}ry property},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2380--2388},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.04.020},
doi = {10.1016/J.DAM.2013.04.020},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BonomoDDFGS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BonomoDSW13,
author = {Flavia Bonomo and
Guillermo Dur{\'{a}}n and
Mart{\'{\i}}n Dar{\'{\i}}o Safe and
Annegret Katrin Wagler},
title = {On minimal forbidden subgraph characterizations of balanced graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {1925--1942},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.04.001},
doi = {10.1016/J.DAM.2013.04.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BonomoDSW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BourgeoisCEP13,
author = {Nicolas Bourgeois and
Federico Della Croce and
Bruno Escoffier and
Vangelis Th. Paschos},
title = {Fast algorithms for min independent dominating set},
journal = {Discret. Appl. Math.},
volume = {161},
number = {4-5},
pages = {558--572},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.01.003},
doi = {10.1016/J.DAM.2012.01.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BourgeoisCEP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BoysenS13,
author = {Nils Boysen and
Konrad Stephan},
title = {The deterministic product location problem under a pick-by-order policy},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {2862--2875},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.07.002},
doi = {10.1016/J.DAM.2013.07.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BoysenS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Brand13,
author = {Michael Brand},
title = {Friedman numbers have density 1},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2389--2395},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.05.027},
doi = {10.1016/J.DAM.2013.05.027},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Brand13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BraunerGKM13,
author = {Nadia Brauner and
Sylvain Gravier and
Louis{-}Philippe Kronek and
Fr{\'{e}}d{\'{e}}ric Meunier},
title = {{LAD} models, trees, and an analog of the fundamental theorem of arithmetic},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {909--920},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.12.004},
doi = {10.1016/J.DAM.2012.12.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BraunerGKM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BresarJKST13,
author = {Bostjan Bresar and
Marko Jakovac and
J{\'{a}}n Katrenic and
Gabriel Semanisin and
Andrej Taranenko},
title = {On the vertex \emph{k}k-path cover},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {1943--1949},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.024},
doi = {10.1016/J.DAM.2013.02.024},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BresarJKST13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BresarKKR13,
author = {Bostjan Bresar and
Sandi Klavzar and
Gasper Kosmrlj and
Douglas F. Rall},
title = {Domination game: Extremal families of graphs for 3/53/5-conjectures},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1308--1316},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.01.025},
doi = {10.1016/J.DAM.2013.01.025},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BresarKKR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrinkmannCF13,
author = {Gunnar Brinkmann and
Simon Crevals and
John Frye},
title = {An independent set approach for the communication network of the {GPS}
{III} system},
journal = {Discret. Appl. Math.},
volume = {161},
number = {4-5},
pages = {573--579},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2011.07.006},
doi = {10.1016/J.DAM.2011.07.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrinkmannCF13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrinkmannCGM13,
author = {Gunnar Brinkmann and
Kris Coolsaet and
Jan Goedgebeur and
Hadrien M{\'{e}}lot},
title = {House of Graphs: {A} database of interesting graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {311--314},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.07.018},
doi = {10.1016/J.DAM.2012.07.018},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrinkmannCGM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrunettiDP13,
author = {Sara Brunetti and
Paolo Dulio and
Carla Peri},
title = {Discrete tomography determination of bounded lattice sets from four
X-rays},
journal = {Discret. Appl. Math.},
volume = {161},
number = {15},
pages = {2281--2292},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.09.010},
doi = {10.1016/J.DAM.2012.09.010},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrunettiDP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BuL13,
author = {Yuehua Bu and
Kai Lu},
title = {List injective coloring of planar graphs with girth 5, 6, 8},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1367--1377},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.12.017},
doi = {10.1016/J.DAM.2012.12.017},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BuL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BurnsDJMS13,
author = {Jonathan Burns and
Egor Dolzhenko and
Natasa Jonoska and
Tilahun Muche and
Masahico Saito},
title = {Four-regular graphs with rigid vertices associated to {DNA} recombination},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1378--1394},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.01.003},
doi = {10.1016/J.DAM.2013.01.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BurnsDJMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CacchianiCT13,
author = {Valentina Cacchiani and
Alberto Caprara and
Paolo Toth},
title = {A Lagrangian heuristic for a train-unit assignment problem},
journal = {Discret. Appl. Math.},
volume = {161},
number = {12},
pages = {1707--1718},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2011.10.035},
doi = {10.1016/J.DAM.2011.10.035},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CacchianiCT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CadaEHT13,
author = {Roman Cada and
Jan Ekstein and
Premysl Holub and
Olivier Togni},
title = {Radio labelings of distance graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {2876--2884},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.06.024},
doi = {10.1016/J.DAM.2013.06.024},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CadaEHT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CalamoneriS13,
author = {Tiziana Calamoneri and
Blerina Sinaimeri},
title = {\emph{L}(2, 1)L(2, 1)-labeling of oriented planar graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {12},
pages = {1719--1725},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.07.009},
doi = {10.1016/J.DAM.2012.07.009},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CalamoneriS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CampeloCMS13,
author = {Manoel B. Camp{\^{e}}lo and
Ricardo C. Corr{\^{e}}a and
Phablo F. S. Moura and
Marcio Costa Santos},
title = {On optimal k-fold colorings of webs and antiwebs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {60--70},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.07.013},
doi = {10.1016/J.DAM.2012.07.013},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CampeloCMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CamposW13,
author = {C. N. Campos and
Yoshiko Wakabayashi},
title = {On dominating sets of maximal outerplanar graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {3},
pages = {330--335},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.023},
doi = {10.1016/J.DAM.2012.08.023},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CamposW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CatanzaroLP13,
author = {Daniele Catanzaro and
Martine Labb{\'{e}} and
Raffaele Pesenti},
title = {The balanced minimum evolution problem under uncertain data},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {1789--1804},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.012},
doi = {10.1016/J.DAM.2013.03.012},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CatanzaroLP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Chalopin0DMW13,
author = {J{\'{e}}r{\'{e}}mie Chalopin and
Shantanu Das and
Yann Disser and
Mat{\'{u}}s Mihal{\'{a}}k and
Peter Widmayer},
title = {Simple agents learn to find their way: An introduction on mapping
polygons},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1287--1307},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.01.006},
doi = {10.1016/J.DAM.2013.01.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Chalopin0DMW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChangHR13,
author = {Maw{-}Shang Chang and
Ling{-}Ju Hung and
Peter Rossmanith},
title = {Recognition of probe distance-hereditary graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {3},
pages = {336--348},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.029},
doi = {10.1016/J.DAM.2012.08.029},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChangHR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChangLW13,
author = {Gerard J. Chang and
Bo{-}Jr Li and
Jiaojiao Wu},
title = {Rainbow domination and related problems on strongly chordal graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1395--1401},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.01.024},
doi = {10.1016/J.DAM.2013.01.024},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChangLW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Che013,
author = {Zhongyuan Che and
Zhibo Chen},
title = {Forcing faces in plane bipartite graphs {(II)}},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {71--80},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.016},
doi = {10.1016/J.DAM.2012.08.016},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Che013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChellaliHHM13,
author = {Mustapha Chellali and
Teresa W. Haynes and
Stephen T. Hedetniemi and
Alice A. McRae},
title = {[1, 2]-sets in graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {2885--2893},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.06.012},
doi = {10.1016/J.DAM.2013.06.012},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChellaliHHM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChelvamM13,
author = {T. Tamizh Chelvam and
Sivagnanam Mutharasu},
title = {Subgroups as efficient dominating sets in Cayley graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {9},
pages = {1187--1190},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.09.005},
doi = {10.1016/J.DAM.2012.09.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChelvamM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChenCLW13,
author = {Kejun Chen and
Guangzhou Chen and
Wen Li and
Ruizhong Wei},
title = {Super-simple balanced incomplete block designs with block size 5 and
index 3},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2396--2404},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.05.007},
doi = {10.1016/J.DAM.2013.05.007},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChenCLW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChenR13,
author = {Min Chen and
Andr{\'{e}} Raspaud},
title = {Planar graphs without 4- and 5-cycles are acyclically 4-choosable},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {921--931},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.11.006},
doi = {10.1016/J.DAM.2012.11.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChenR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChengHF13,
author = {Dongqin Cheng and
Rong{-}Xia Hao and
Yan{-}Quan Feng},
title = {Cycles embedding on folded hypercubes with faulty nodes},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {2894--2900},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.06.030},
doi = {10.1016/J.DAM.2013.06.030},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChengHF13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Cheraghchi13,
author = {Mahdi Cheraghchi},
title = {Noise-resilient group testing: Limitations and constructions},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {81--95},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.07.022},
doi = {10.1016/J.DAM.2012.07.022},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Cheraghchi13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChiaS13,
author = {Gek Ling Chia and
Kai An Sim},
title = {On the skewness of the join of graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2405--2409},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.023},
doi = {10.1016/J.DAM.2013.03.023},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/ChiaS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChoiC13,
author = {Byung{-}Cheon Choi and
Jibok Chung},
title = {Job release scheduling problem: Complexity and an approximation algorithm},
journal = {Discret. Appl. Math.},
volume = {161},
number = {6},
pages = {858--863},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.10.011},
doi = {10.1016/J.DAM.2012.10.011},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChoiC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChuWC13,
author = {An{-}Chiang Chu and
Bang Ye Wu and
Kun{-}Mao Chao},
title = {A linear-time algorithm for finding an edge-partition with max-min
ratio at most two},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {932--943},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.11.009},
doi = {10.1016/J.DAM.2012.11.009},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChuWC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CicaleseMV13,
author = {Ferdinando Cicalese and
Martin Milanic and
Ugo Vaccaro},
title = {On the approximability and exact algorithms for vector domination
and related problems in graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {6},
pages = {750--767},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.10.007},
doi = {10.1016/J.DAM.2012.10.007},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CicaleseMV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ConlonFS13,
author = {David Conlon and
Jacob Fox and
Benny Sudakov},
title = {An improved bound for the stepping-up lemma},
journal = {Discret. Appl. Math.},
volume = {161},
number = {9},
pages = {1191--1196},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2010.10.013},
doi = {10.1016/J.DAM.2010.10.013},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ConlonFS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CordoneL13,
author = {Roberto Cordone and
Guglielmo Lulli},
title = {An integer optimization approach for reverse engineering of gene regulatory
networks},
journal = {Discret. Appl. Math.},
volume = {161},
number = {4-5},
pages = {580--592},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.02.010},
doi = {10.1016/J.DAM.2012.02.010},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CordoneL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Costa13,
author = {Alberto Costa},
title = {Valid constraints for the Point Packing in a Square problem},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {2901--2909},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.06.008},
doi = {10.1016/J.DAM.2013.06.008},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Costa13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CostaDDPR13,
author = {V{\'{\i}}tor Costa and
Simone Dantas and
Mitre Costa Dourado and
Lucia Draque Penso and
Dieter Rautenbach},
title = {More fires and more fighters},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2410--2419},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.04.008},
doi = {10.1016/J.DAM.2013.04.008},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CostaDDPR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CostaHL13,
author = {Alberto Costa and
Pierre Hansen and
Leo Liberti},
title = {On the impact of symmetry-breaking constraints on spatial Branch-and-Bound
for circle packing in a square},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {96--106},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.07.020},
doi = {10.1016/J.DAM.2012.07.020},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CostaHL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CramaH13,
author = {Yves Crama and
Peter L. Hammer},
title = {Boolean Functions},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {315},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.07.021},
doi = {10.1016/J.DAM.2012.07.021},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CramaH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CranstonKOW13,
author = {Daniel W. Cranston and
William B. Kinnersley and
Suil O and
Douglas B. West},
title = {Game matching number of graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {1828--1836},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.010},
doi = {10.1016/J.DAM.2013.03.010},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CranstonKOW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CukiermanY13,
author = {Ari Cukierman and
Gexin Yu},
title = {New bounds on the minimum density of an identifying code for the infinite
hexagonal grid},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {2910--2924},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.06.002},
doi = {10.1016/J.DAM.2013.06.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CukiermanY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CzabarkaEJM13,
author = {{\'{E}}va Czabarka and
P{\'{e}}ter L. Erd{\"{o}}s and
Virginia Johnson and
Vincent Moulton},
title = {Generating functions for multi-labeled trees},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {107--117},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.010},
doi = {10.1016/J.DAM.2012.08.010},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CzabarkaEJM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DalfoFG13,
author = {Cristina Dalf{\'{o}} and
Miguel Angel Fiol and
Ernest Garriga},
title = {Moments in graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {6},
pages = {768--777},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.10.024},
doi = {10.1016/J.DAM.2012.10.024},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/DalfoFG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Debled-RennessonDKE13,
author = {Isabelle Debled{-}Rennesson and
Eric Domenjoud and
Bertrand Kerautret and
Philippe Even},
title = {Discrete Geometry for Computer Imagery},
journal = {Discret. Appl. Math.},
volume = {161},
number = {15},
pages = {2223},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.026},
doi = {10.1016/J.DAM.2013.03.026},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Debled-RennessonDKE13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DeinekoW13,
author = {Vladimir G. Deineko and
Gerhard J. Woeginger},
title = {Two hardness results for core stability in hedonic coalition formation
games},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {1837--1842},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.003},
doi = {10.1016/J.DAM.2013.03.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DeinekoW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Dejter13,
author = {Italo J. Dejter},
title = {Worst-case efficient dominating sets in digraphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {944--952},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.11.016},
doi = {10.1016/J.DAM.2012.11.016},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/Dejter13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DemangeLPR13,
author = {Marc Demange and
Vadim V. Lozin and
Christophe Picouleau and
Bernard Ries},
title = {{GO} {VII} Meeting, Ovronnaz (CH), June 13-17, 2010},
journal = {Discret. Appl. Math.},
volume = {161},
number = {4-5},
pages = {453},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.11.023},
doi = {10.1016/J.DAM.2012.11.023},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DemangeLPR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DengBAV13,
author = {Hanyuan Deng and
Selvaraj Balachandran and
S. K. Ayyaswamy and
Yanamandram B. Venkatakrishnan},
title = {On the harmonic index and the chromatic number of a graph},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2740--2744},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.04.003},
doi = {10.1016/J.DAM.2013.04.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DengBAV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DengKM13,
author = {Aiping Deng and
Alexander K. Kelmans and
Juan Meng},
title = {Laplacian spectra of regular graph transformations},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {118--133},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.020},
doi = {10.1016/J.DAM.2012.08.020},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/DengKM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DereniowskiDD13,
author = {Dariusz Dereniowski and
{\"{O}}znur Yasar Diner and
Danny Dyer},
title = {Three-fast-searchable graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {1950--1958},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.004},
doi = {10.1016/J.DAM.2013.03.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DereniowskiDD13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DesormeauxHH13,
author = {Wyatt J. Desormeaux and
Teresa W. Haynes and
Michael A. Henning},
title = {Relating the annihilation number and the total domination number of
a tree},
journal = {Discret. Appl. Math.},
volume = {161},
number = {3},
pages = {349--354},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.09.006},
doi = {10.1016/J.DAM.2012.09.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DesormeauxHH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DesormeauxHH13a,
author = {Wyatt J. Desormeaux and
Teresa W. Haynes and
Michael A. Henning},
title = {Bounds on the connected domination number of a graph},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {2925--2931},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.06.023},
doi = {10.1016/J.DAM.2013.06.023},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DesormeauxHH13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DingL13,
author = {Guoli Ding and
Cheng Liu},
title = {Excluding a small minor},
journal = {Discret. Appl. Math.},
volume = {161},
number = {3},
pages = {355--368},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.09.001},
doi = {10.1016/J.DAM.2012.09.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DingL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DivnicP13,
author = {Tomica Divnic and
Ljiljana Pavlovic},
title = {Proof of the first part of the conjecture of Aouchiche and Hansen
about the Randi{\'{c}} index},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {953--960},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.11.004},
doi = {10.1016/J.DAM.2012.11.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DivnicP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DobrevKPTV13,
author = {Stefan Dobrev and
Rastislav Kr{\'{a}}lovic and
Dana Pardubsk{\'{a}} and
L'ubom{\'{\i}}r T{\"{o}}r{\"{o}}k and
Imrich Vrt'o},
title = {Antibandwidth and cyclic antibandwidth of Hamming graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1402--1408},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.12.026},
doi = {10.1016/J.DAM.2012.12.026},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DobrevKPTV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DoerrHL13,
author = {Benjamin Doerr and
Anna Huber and
Ariel Levavi},
title = {Strong robustness of randomized rumor spreading protocols},
journal = {Discret. Appl. Math.},
volume = {161},
number = {6},
pages = {778--793},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.10.014},
doi = {10.1016/J.DAM.2012.10.014},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DoerrHL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DongYZ13,
author = {Fengming Dong and
Weigen Yan and
Fuji Zhang},
title = {On the number of perfect matchings of line graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {6},
pages = {794--801},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.10.032},
doi = {10.1016/J.DAM.2012.10.032},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DongYZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DressMSW13,
author = {Andreas W. M. Dress and
Vincent Moulton and
Andreas Spillner and
Taoyang Wu},
title = {Obtaining splits from cut sets of tight spans},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1409--1420},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.001},
doi = {10.1016/J.DAM.2013.02.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DressMSW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Drgas-BurchardtS13,
author = {Ewa Drgas{-}Burchardt and
Zbigniew Switalski},
title = {A number of stable matchings in models of the Gale-Shapley type},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {2932--2936},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.06.031},
doi = {10.1016/J.DAM.2013.06.031},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/Drgas-BurchardtS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Du13,
author = {Zhibin Du},
title = {An edge grafting theorem on the Estrada index of graphs and its applications},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {134--139},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.07.014},
doi = {10.1016/J.DAM.2012.07.014},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Du13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Ducoffe13,
author = {Guillaume Ducoffe},
title = {Hamiltonicity of large generalized de Bruijn cycles},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2200--2204},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.027},
doi = {10.1016/J.DAM.2013.02.027},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Ducoffe13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DudekFR13,
author = {Andrzej Dudek and
Peter Frankl and
Vojtech R{\"{o}}dl},
title = {Some recent results on Ramsey-type numbers},
journal = {Discret. Appl. Math.},
volume = {161},
number = {9},
pages = {1197--1202},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2010.09.005},
doi = {10.1016/J.DAM.2010.09.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DudekFR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DuffusFR13,
author = {Dwight Duffus and
Peter Frankl and
Vojtech R{\"{o}}dl},
title = {Maximal independent sets in the covering graph of the cube},
journal = {Discret. Appl. Math.},
volume = {161},
number = {9},
pages = {1203--1208},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2010.09.003},
doi = {10.1016/J.DAM.2010.09.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DuffusFR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DulioP13,
author = {Paolo Dulio and
Carla Peri},
title = {Discrete tomography for inscribable lattice sets},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {1959--1974},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.025},
doi = {10.1016/J.DAM.2013.03.025},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DulioP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/EadesL13,
author = {Peter Eades and
Giuseppe Liotta},
title = {Right angle crossing graphs and 1-planarity},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {961--969},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.11.019},
doi = {10.1016/J.DAM.2012.11.019},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/EadesL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Edwards13,
author = {Keith J. Edwards},
title = {Harmonious chromatic number of directed graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {3},
pages = {369--376},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.09.003},
doi = {10.1016/J.DAM.2012.09.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Edwards13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/EpsteinFTWW13,
author = {Leah Epstein and
Michal Feldman and
Tami Tamir and
Lukasz Witkowski and
Marcin Witkowski},
title = {Approximate strong equilibria in job scheduling games with two uniformly
related machines},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {1843--1858},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.035},
doi = {10.1016/J.DAM.2013.02.035},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/EpsteinFTWW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/EpsteinIL13,
author = {Leah Epstein and
Csan{\'{a}}d Imreh and
Asaf Levin},
title = {Bin covering with cardinality constraints},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {1975--1987},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.020},
doi = {10.1016/J.DAM.2013.03.020},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/EpsteinIL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ErvesZ13,
author = {Rija Erves and
Janez Zerovnik},
title = {Mixed fault diameter of Cartesian graph bundles},
journal = {Discret. Appl. Math.},
volume = {161},
number = {12},
pages = {1726--1733},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2011.11.020},
doi = {10.1016/J.DAM.2011.11.020},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ErvesZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FaigleS13,
author = {Ulrich Faigle and
Rainer Schrader},
title = {9th Cologne/Twente Workshop on Graphs and Combinatorial Optimization
{(CTW} 2010)},
journal = {Discret. Appl. Math.},
volume = {161},
number = {12},
pages = {1673},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.018},
doi = {10.1016/J.DAM.2013.02.018},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FaigleS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FederS13,
author = {Tom{\'{a}}s Feder and
Carlos S. Subi},
title = {On hypercube labellings and antipodal monochromatic paths},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1421--1426},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.12.025},
doi = {10.1016/J.DAM.2012.12.025},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FederS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FeldheimH13,
author = {Ohad N. Feldheim and
Rani Hod},
title = {3/2 firefighters are not enough},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {301--306},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.005},
doi = {10.1016/J.DAM.2012.08.005},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/FeldheimH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Feldmann0W13,
author = {Andreas Emil Feldmann and
Shantanu Das and
Peter Widmayer},
title = {Corner cuts are close to optimal: From solid grids to polygons and
back},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {970--998},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.12.002},
doi = {10.1016/J.DAM.2012.12.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Feldmann0W13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FengXW13,
author = {Min Feng and
Min Xu and
Kaishun Wang},
title = {On the metric dimension of line graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {6},
pages = {802--805},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.10.018},
doi = {10.1016/J.DAM.2012.10.018},
timestamp = {Thu, 31 Mar 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/FengXW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FerraraGHSW13,
author = {Michael Ferrara and
Ellen Gethner and
Stephen G. Hartke and
Derrick Stolee and
Paul S. Wenger},
title = {List distinguishing parameters of trees},
journal = {Discret. Appl. Math.},
volume = {161},
number = {6},
pages = {864--869},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.10.003},
doi = {10.1016/J.DAM.2012.10.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FerraraGHSW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Frias-ArmentaLNP13,
author = {Mart{\'{\i}}n Eduardo Fr{\'{\i}}as{-}Armenta and
Francisco Larri{\'{o}}n and
Victor Neumann{-}Lara and
Miguel A. Piza{\~{n}}a},
title = {Edge contraction and edge removal on iterated clique graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1427--1439},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.003},
doi = {10.1016/J.DAM.2013.02.003},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/Frias-ArmentaLNP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Friedmann13,
author = {Oliver Friedmann},
title = {A superpolynomial lower bound for strategy iteration based on snare
memorization},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1317--1337},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.007},
doi = {10.1016/J.DAM.2013.02.007},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Friedmann13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FritzilasMMR13,
author = {Epameinondas Fritzilas and
Martin Milanic and
J{\'{e}}r{\^{o}}me Monnot and
Yasm{\'{\i}}n {\'{A}}. R{\'{\i}}os{-}Sol{\'{\i}}s},
title = {Resilience and optimization of identifiable bipartite graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {4-5},
pages = {593--603},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.01.005},
doi = {10.1016/J.DAM.2012.01.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FritzilasMMR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FuLX13,
author = {Fang{-}Wei Fu and
San Ling and
Chaoping Xing},
title = {New results on two hypercube coloring problems},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {2937--2945},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.07.006},
doi = {10.1016/J.DAM.2013.07.006},
timestamp = {Wed, 03 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FuLX13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FujitaF13,
author = {Shinya Fujita and
Michitaka Furuya},
title = {Difference between 2-rainbow domination and Roman domination in graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {6},
pages = {806--812},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.10.017},
doi = {10.1016/J.DAM.2012.10.017},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FujitaF13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Furuya13,
author = {Michitaka Furuya},
title = {Upper bounds on the diameter of domination dot-critical graphs with
given connectivity},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2420--2426},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.05.011},
doi = {10.1016/J.DAM.2013.05.011},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Furuya13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GagarinPZ13,
author = {Andrei Gagarin and
Anush Poghosyan and
Vadim E. Zverovich},
title = {Randomized algorithms and upper bounds for multiple domination in
graphs and networks},
journal = {Discret. Appl. Math.},
volume = {161},
number = {4-5},
pages = {604--611},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2011.07.004},
doi = {10.1016/J.DAM.2011.07.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GagarinPZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GalcikK13,
author = {Frantisek Galc{\'{\i}}k and
J{\'{a}}n Katrenic},
title = {A note on approximating the \emph{b}-chromatic number},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {1137--1140},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.11.008},
doi = {10.1016/J.DAM.2012.11.008},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GalcikK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GalluccioGV13,
author = {Anna Galluccio and
Claudio Gentile and
Paolo Ventura},
title = {22-clique-bond of stable set polyhedra},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {1988--2000},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.022},
doi = {10.1016/J.DAM.2013.02.022},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GalluccioGV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Gangopadhyay13,
author = {Sugata Gangopadhyay},
title = {Affine inequivalence of cubic Maiorana-McFarland type bent functions},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {1141--1146},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.11.017},
doi = {10.1016/J.DAM.2012.11.017},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Gangopadhyay13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GaoHN13,
author = {Yong Gao and
Donovan R. Hare and
James Nastos},
title = {The parametric complexity of graph diameter augmentation},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1626--1631},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.01.016},
doi = {10.1016/J.DAM.2013.01.016},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GaoHN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GaoY13,
author = {Ze{-}Tu Gao and
Jian{-}Hua Yin},
title = {On the \emph{t}-pebbling number and the 2\emph{t}-pebbling property
of graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {999--1005},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.12.005},
doi = {10.1016/J.DAM.2012.12.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GaoY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GarijoGM13,
author = {Delia Garijo and
Antonio Gonz{\'{a}}lez Herrera and
Alberto M{\'{a}}rquez},
title = {On the metric dimension, the upper dimension and the resolving number
of graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1440--1447},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.01.026},
doi = {10.1016/J.DAM.2013.01.026},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/GarijoGM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GengLZ13,
author = {Xianya Geng and
Shuchao Li and
Meng Zhang},
title = {Extremal values on the eccentric distance sum of trees},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2427--2439},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.05.023},
doi = {10.1016/J.DAM.2013.05.023},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GengLZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GerbnerKPP13,
author = {D{\'{a}}niel Gerbner and
Gyula O. H. Katona and
D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
Bal{\'{a}}zs Patk{\'{o}}s},
title = {Majority and plurality problems},
journal = {Discret. Appl. Math.},
volume = {161},
number = {6},
pages = {813--818},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.10.023},
doi = {10.1016/J.DAM.2012.10.023},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GerbnerKPP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GheblehN13,
author = {Mohammad Ghebleh and
Ludov{\'{\i}}t Niepel},
title = {Locating and identifying codes in circulant networks},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2001--2007},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.008},
doi = {10.1016/J.DAM.2013.03.008},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GheblehN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GhoshH13,
author = {Subir Kumar Ghosh and
Penny E. Haxell},
title = {Packing and covering tetrahedra},
journal = {Discret. Appl. Math.},
volume = {161},
number = {9},
pages = {1209--1215},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2010.05.027},
doi = {10.1016/J.DAM.2010.05.027},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GhoshH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GolovachPS13,
author = {Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Jian Song},
title = {4-coloring H-free graphs when {H} is small},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {140--150},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.022},
doi = {10.1016/J.DAM.2012.08.022},
timestamp = {Wed, 24 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GolovachPS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GoncalvesPP13,
author = {Daniel Gon{\c{c}}alves and
Aline Parreau and
Alexandre Pinlou},
title = {Locally identifying coloring in bounded expansion classes of graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {2946--2951},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.07.003},
doi = {10.1016/J.DAM.2013.07.003},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/GoncalvesPP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GoringH13,
author = {Frank G{\"{o}}ring and
Jochen Harant},
title = {Prescribed edges and forbidden edges for a cycle in a planar graph},
journal = {Discret. Appl. Math.},
volume = {161},
number = {12},
pages = {1734--1738},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2011.08.020},
doi = {10.1016/J.DAM.2011.08.020},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/GoringH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GoupilCP13,
author = {Alain Goupil and
Hugo Cloutier and
Marie{-}Eve Pellerin},
title = {Generating functions for inscribed polyominoes},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {151--166},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.017},
doi = {10.1016/J.DAM.2012.08.017},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GoupilCP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GourvesLMM13,
author = {Laurent Gourv{\`{e}}s and
Adria Lyra and
Carlos A. J. Martinhon and
J{\'{e}}r{\^{o}}me Monnot},
title = {Complexity of trails, paths and circuits in arc-colored digraphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {6},
pages = {819--828},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.10.025},
doi = {10.1016/J.DAM.2012.10.025},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GourvesLMM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GravierLS13,
author = {Sylvain Gravier and
Anne Lacroix and
Souad Slimani},
title = {(\emph{a}, \emph{b})-codes in \emph{Z}/\emph{n}\emph{Z}},
journal = {Discret. Appl. Math.},
volume = {161},
number = {4-5},
pages = {612--617},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.03.032},
doi = {10.1016/J.DAM.2012.03.032},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GravierLS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GruseaL13,
author = {Simona Grusea and
Anthony Labarre},
title = {The distribution of cycles in breakpoint graphs of signed permutations},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1448--1466},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.002},
doi = {10.1016/J.DAM.2013.02.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GruseaL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GruterGH13,
author = {Steffen Gr{\"{u}}ter and
Yubao Guo and
Andreas Holtkamp},
title = {Restricted arc-connectivity of bipartite tournaments},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2008--2013},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.01.028},
doi = {10.1016/J.DAM.2013.01.028},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GruterGH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GruterGHU13,
author = {Steffen Gr{\"{u}}ter and
Yubao Guo and
Andreas Holtkamp and
Eduard Ulmer},
title = {Restricted arc-connectivity in tournaments},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1467--1471},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.010},
doi = {10.1016/J.DAM.2013.02.010},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GruterGHU13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GurevskyBD13,
author = {Evgeny Gurevsky and
Olga Batta{\"{\i}}a and
Alexandre Dolgui},
title = {Stability measure for a generalized assembly line balancing problem},
journal = {Discret. Appl. Math.},
volume = {161},
number = {3},
pages = {377--394},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.037},
doi = {10.1016/J.DAM.2012.08.037},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/GurevskyBD13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GyurkiM13,
author = {Stefan Gy{\"{u}}rki and
J{\'{a}}n Maz{\'{a}}k},
title = {An efficient algorithm for testing goal-minimality of graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1632--1634},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.017},
doi = {10.1016/J.DAM.2013.02.017},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/GyurkiM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HansbergP13,
author = {Adriana Hansberg and
Ryan Pepper},
title = {On \emph{k}k-domination and \emph{j}j-independence in graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1472--1480},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.008},
doi = {10.1016/J.DAM.2013.02.008},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HansbergP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HansenIPT13,
author = {Kristoffer Arnsfelt Hansen and
Rasmus Ibsen{-}Jensen and
Vladimir V. Podolskii and
Elias P. Tsigaridas},
title = {Patience of matrix games},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2440--2459},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.05.008},
doi = {10.1016/J.DAM.2013.05.008},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/HansenIPT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HaouariLS13,
author = {Mohamed Haouari and
Safa Bhar Layeb and
Hanif D. Sherali},
title = {Tight compact models and comparative analysis for the prize collecting
Steiner tree problem},
journal = {Discret. Appl. Math.},
volume = {161},
number = {4-5},
pages = {618--632},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2011.09.012},
doi = {10.1016/J.DAM.2011.09.012},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HaouariLS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Hartung13,
author = {Elizabeth J. Hartung},
title = {Fullerenes with complete Clar structure},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {2952--2957},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.06.009},
doi = {10.1016/J.DAM.2013.06.009},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/Hartung13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Harutyunyan13,
author = {Ararat Harutyunyan},
title = {Some bounds on global alliances in trees},
journal = {Discret. Appl. Math.},
volume = {161},
number = {12},
pages = {1739--1746},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2011.11.026},
doi = {10.1016/J.DAM.2011.11.026},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Harutyunyan13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HaukkanenM13,
author = {Pentti Haukkanen and
Jorma K. Merikoski},
title = {Asymptotics of the number of threshold functions on a two-dimensional
rectangular grid},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {13--18},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.012},
doi = {10.1016/J.DAM.2012.08.012},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HaukkanenM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HellersteinK13,
author = {Lisa Hellerstein and
Devorah Kletenik},
title = {On the gap between ess(f) and cnf{\_}size(f)},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {19--27},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.07.004},
doi = {10.1016/J.DAM.2012.07.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HellersteinK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Hellmuth13,
author = {Marc Hellmuth},
title = {On the complexity of recognizing S-composite and S-prime graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {1006--1013},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.11.003},
doi = {10.1016/J.DAM.2012.11.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Hellmuth13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HenningJ13,
author = {Michael A. Henning and
Ernst J. Joubert},
title = {Equality in a linear Vizing-like relation that relates the size and
total domination number of a graph},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2014--2024},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.017},
doi = {10.1016/J.DAM.2013.03.017},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HenningJ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HenningR13,
author = {Michael A. Henning and
Nader Jafari Rad},
title = {Bounds on neighborhood total domination in graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2460--2466},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.05.014},
doi = {10.1016/J.DAM.2013.05.014},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HenningR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HoK13,
author = {Shan{-}Yuan Ho and
Daniel J. Kleitman},
title = {An odd kind of {BCH} code},
journal = {Discret. Appl. Math.},
volume = {161},
number = {9},
pages = {1216--1220},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.021},
doi = {10.1016/J.DAM.2012.08.021},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HoK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HoangKSS13,
author = {Ch{\'{\i}}nh T. Ho{\`{a}}ng and
Marcin Kaminski and
Joe Sawada and
R. Sritharan},
title = {Finding and listing induced paths and cycles},
journal = {Discret. Appl. Math.},
volume = {161},
number = {4-5},
pages = {633--641},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.01.024},
doi = {10.1016/J.DAM.2012.01.024},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HoangKSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HocquardMRV13,
author = {Herv{\'{e}} Hocquard and
Micka{\"{e}}l Montassier and
Andr{\'{e}} Raspaud and
Petru Valicov},
title = {On strong edge-colouring of subcubic graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2467--2479},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.05.021},
doi = {10.1016/J.DAM.2013.05.021},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HocquardMRV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HossainS13,
author = {Shahadat Hossain and
Trond Steihaug},
title = {Graph models and their efficient implementation for sparse Jacobian
matrix determination},
journal = {Discret. Appl. Math.},
volume = {161},
number = {12},
pages = {1747--1754},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.12.010},
doi = {10.1016/J.DAM.2012.12.010},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HossainS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HouWZ13,
author = {Jianfeng Hou and
Weitao Wang and
Xiaoran Zhang},
title = {Acyclic edge coloring of planar graphs with girth at least 5},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {2958--2967},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.06.013},
doi = {10.1016/J.DAM.2013.06.013},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HouWZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HuL13,
author = {Xiaolan Hu and
Huiqing Liu},
title = {The (conditional) matching preclusion for burnt pancake graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1481--1489},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.01.010},
doi = {10.1016/J.DAM.2013.01.010},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HuL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HuaD13,
author = {Hongbo Hua and
Kinkar Chandra Das},
title = {The relationship between the eccentric connectivity index and Zagreb
indices},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2480--2491},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.05.034},
doi = {10.1016/J.DAM.2013.05.034},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HuaD13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HumphriesLS13,
author = {Peter J. Humphries and
Simone Linz and
Charles Semple},
title = {On the complexity of computing the temporal hybridization number for
two phylogenies},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {871--880},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.11.022},
doi = {10.1016/J.DAM.2012.11.022},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HumphriesLS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Hurlbert13,
author = {Glenn Hurlbert},
title = {General graph pebbling},
journal = {Discret. Appl. Math.},
volume = {161},
number = {9},
pages = {1221--1231},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.03.010},
doi = {10.1016/J.DAM.2012.03.010},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Hurlbert13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HyunLL13,
author = {Jong Yoon Hyun and
Heisook Lee and
Yoonjin Lee},
title = {Nonexistence of certain types of plateaued functions},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2745--2748},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.04.007},
doi = {10.1016/J.DAM.2013.04.007},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HyunLL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JacksonJK13,
author = {Bill Jackson and
Tibor Jord{\'{a}}n and
Csaba Kir{\'{a}}ly},
title = {Strongly rigid tensegrity graphs on the line},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {1147--1149},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.12.009},
doi = {10.1016/J.DAM.2012.12.009},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/JacksonJK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JaehnP13,
author = {Florian Jaehn and
Erwin Pesch},
title = {New bounds and constraint propagation techniques for the clique partitioning
problem},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2025--2037},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.011},
doi = {10.1016/J.DAM.2013.02.011},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/JaehnP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JinS13,
author = {Hai{-}Tao Jin and
Lisa Hui Sun},
title = {On Spie{\ss}'s conjecture on harmonic numbers},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2038--2041},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.024},
doi = {10.1016/J.DAM.2013.03.024},
timestamp = {Wed, 01 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/JinS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JohnsonKM13,
author = {Oliver Johnson and
Ioannis Kontoyiannis and
Mokshay M. Madiman},
title = {Log-concavity, ultra-log-concavity, and a maximum entropy property
of discrete compound Poisson measures},
journal = {Discret. Appl. Math.},
volume = {161},
number = {9},
pages = {1232--1250},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2011.08.025},
doi = {10.1016/J.DAM.2011.08.025},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/JohnsonKM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JoshiWP13,
author = {Vinayak Joshi and
B. N. Waphare and
H. Y. Pourali},
title = {On generalized zero divisor graph of a poset},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1490--1495},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.12.019},
doi = {10.1016/J.DAM.2012.12.019},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/JoshiWP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Joubert13,
author = {Ernst J. Joubert},
title = {Maximum sizes of graphs with given restrained domination numbers},
journal = {Discret. Appl. Math.},
volume = {161},
number = {6},
pages = {829--837},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.10.004},
doi = {10.1016/J.DAM.2012.10.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Joubert13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Junnila13,
author = {Ville Junnila},
title = {New lower bound for 2-identifying code in the square grid},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2042--2051},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.032},
doi = {10.1016/J.DAM.2013.02.032},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Junnila13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Junosza-SzaniawskiKLR13,
author = {Konstanty Junosza{-}Szaniawski and
Jan Kratochv{\'{\i}}l and
Mathieu Liedloff and
Pawel Rzazewski},
title = {Determining the \emph{L}(2, 1)L(2, 1)-span in polynomial space},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2052--2061},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.027},
doi = {10.1016/J.DAM.2013.03.027},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Junosza-SzaniawskiKLR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KabadiP13,
author = {Santosh N. Kabadi and
Abraham P. Punnen},
title = {Spanning cactus of a graph: Existence, extension, optimization, and
approximation},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {167--175},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.006},
doi = {10.1016/J.DAM.2012.08.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KabadiP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Katona13,
author = {Gyula O. H. Katona},
title = {Sperner type theorems with excluded subposets},
journal = {Discret. Appl. Math.},
volume = {161},
number = {9},
pages = {1251--1258},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2011.08.021},
doi = {10.1016/J.DAM.2011.08.021},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Katona13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KatsL13,
author = {Vladimir Kats and
Eugene Levner},
title = {A note on periodic schedules for linear precedence constraints},
journal = {Discret. Appl. Math.},
volume = {161},
number = {3},
pages = {430--434},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.09.002},
doi = {10.1016/J.DAM.2012.09.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KatsL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Kazmierczak13,
author = {Wojciech Kazmierczak},
title = {The best choice problem for a union of two linear orders with common
maximum},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {3090--3096},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.06.026},
doi = {10.1016/J.DAM.2013.06.026},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/Kazmierczak13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KennedyK13,
author = {W. Sean Kennedy and
Andrew D. King},
title = {Finding a smallest odd hole in a claw-free graph using global structure},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2492--2498},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.04.026},
doi = {10.1016/J.DAM.2013.04.026},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KennedyK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KettleboroughR13,
author = {George Kettleborough and
Victor J. Rayward{-}Smith},
title = {Optimising sum-of-squares measures for clustering multisets defined
over a metric space},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2499--2513},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.04.015},
doi = {10.1016/J.DAM.2013.04.015},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KettleboroughR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KhanPABN13,
author = {Arindam Khan and
Sudebkumar Prasant Pal and
Mridul Aanjaneya and
Arijit Bishnu and
Subhas C. Nandy},
title = {Diffuse reflection diameter and radius for convex-quadrilateralizable
polygons},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1496--1505},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.12.020},
doi = {10.1016/J.DAM.2012.12.020},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KhanPABN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KianfarM13,
author = {Kamran Kianfar and
Ghasem Moslehi},
title = {A note on "Fully polynomial time approximation scheme for the total
weighted tardiness minimization with a common due date"},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2205--2206},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.026},
doi = {10.1016/J.DAM.2013.02.026},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KianfarM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KimLP13,
author = {Seog{-}Jin Kim and
Sangjune Lee and
Won{-}Jin Park},
title = {Dynamic coloring and list dynamic coloring of planar graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2207--2212},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.005},
doi = {10.1016/J.DAM.2013.03.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KimLP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KimPS13,
author = {Suh{-}Ryung Kim and
Boram Park and
Yoshio Sano},
title = {The competition number of the complement of a cycle},
journal = {Discret. Appl. Math.},
volume = {161},
number = {12},
pages = {1755--1760},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2011.10.034},
doi = {10.1016/J.DAM.2011.10.034},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KimPS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KitaevSSU13,
author = {Sergey Kitaev and
Pavel Salimov and
Christopher Severs and
Henning {\'{U}}lfarsson},
title = {Restricted non-separable planar maps and some pattern avoiding permutations},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2514--2526},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.01.004},
doi = {10.1016/J.DAM.2013.01.004},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KitaevSSU13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KlavzarN13,
author = {Sandi Klavzar and
Mohammad J. Nadjafi{-}Arani},
title = {Wiener index versus Szeged index in networks},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {1150--1153},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.12.007},
doi = {10.1016/J.DAM.2012.12.007},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KlavzarN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KleitmanSS13,
author = {Daniel J. Kleitman and
Aditya Shastri and
Vera T. S{\'{o}}s},
title = {Editorial},
journal = {Discret. Appl. Math.},
volume = {161},
number = {9},
pages = {1169},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.09.004},
doi = {10.1016/J.DAM.2012.09.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KleitmanSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KonsowaAT13,
author = {Mokhtar H. Konsowa and
Fahimah Al{-}Awadhi and
Andr{\'{a}}s Telcs},
title = {Commute times of random walks on trees},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {1014--1021},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.10.006},
doi = {10.1016/J.DAM.2012.10.006},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/KonsowaAT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Kovac13,
author = {Jakub Kov{\'{a}}c},
title = {Complexity of the path avoiding forbidden pairs problem revisited},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1506--1512},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.12.022},
doi = {10.1016/J.DAM.2012.12.022},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Kovac13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KowalikPS13,
author = {Lukasz Kowalik and
Marcin Pilipczuk and
Karol Suchan},
title = {Towards optimal kernel for connected vertex cover in planar graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {1154--1161},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.12.001},
doi = {10.1016/J.DAM.2012.12.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KowalikPS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KozakGF13,
author = {Adam Kozak and
Tomasz Glowacki and
Piotr Formanowicz},
title = {On a generalized model of labeled graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {1818--1827},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.019},
doi = {10.1016/J.DAM.2013.02.019},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KozakGF13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KranakisPS13,
author = {Evangelos Kranakis and
Oscar Morales{-}Ponce and
Ladislav Stacho},
title = {Strongly connected orientations of plane graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {176--183},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.004},
doi = {10.1016/J.DAM.2012.08.004},
timestamp = {Mon, 03 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/KranakisPS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KubaMP13,
author = {Markus Kuba and
Hosam M. Mahmoud and
Alois Panholzer},
title = {Analysis of a generalized Friedman's urn with multiple drawings},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {2968--2984},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.06.022},
doi = {10.1016/J.DAM.2013.06.022},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KubaMP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Kuhl13,
author = {Jaromy Kuhl},
title = {Transversals and competition numbers of complete multipartite graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {3},
pages = {435--440},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.09.012},
doi = {10.1016/J.DAM.2012.09.012},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Kuhl13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KuziakYR13,
author = {Dorota Kuziak and
Ismael Gonz{\'{a}}lez Yero and
Juan Alberto Rodr{\'{\i}}guez{-}Vel{\'{a}}zquez},
title = {On the strong metric dimension of corona product graphs and join graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {1022--1027},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.10.009},
doi = {10.1016/J.DAM.2012.10.009},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KuziakYR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LachaudS13,
author = {Jacques{-}Olivier Lachaud and
Mouhammad Said},
title = {Two efficient algorithms for computing the characteristics of a subsegment
of a digital straight line},
journal = {Discret. Appl. Math.},
volume = {161},
number = {15},
pages = {2293--2315},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.038},
doi = {10.1016/J.DAM.2012.08.038},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LachaudS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LanC13,
author = {James K. Lan and
Gerard Jennhwa Chang},
title = {Algorithmic aspects of the \emph{k}k-domination problem in graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1513--1520},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.01.015},
doi = {10.1016/J.DAM.2013.01.015},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LanC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LeR13,
author = {Van Bang Le and
Dieter Rautenbach},
title = {Integral mixed unit interval graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {1028--1036},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.09.013},
doi = {10.1016/J.DAM.2012.09.013},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LeR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LeSaulnierW13,
author = {Timothy D. LeSaulnier and
Douglas B. West},
title = {Acquisition-extremal graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1521--1529},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.12.014},
doi = {10.1016/J.DAM.2012.12.014},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LeSaulnierW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LescaMP13,
author = {Julien Lesca and
Michel Minoux and
Patrice Perny},
title = {Compact versus noncompact {LP} formulations for minimizing convex
Choquet integrals},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {184--199},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.07.007},
doi = {10.1016/J.DAM.2012.07.007},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LescaMP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LevitM13,
author = {Vadim E. Levit and
Eugen Mandrescu},
title = {On maximum matchings in K{\"{o}}nig-Egerv{\'{a}}ry graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1635--1638},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.01.005},
doi = {10.1016/J.DAM.2013.01.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LevitM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Li13,
author = {Mingchu Li},
title = {Hamiltonian claw-free graphs involving minimum degrees},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1530--1537},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.01.002},
doi = {10.1016/J.DAM.2013.01.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Li13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LiL13,
author = {Xueliang Li and
Mengmeng Liu},
title = {Bicyclic graphs with maximal revised Szeged index},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2527--2531},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.04.002},
doi = {10.1016/J.DAM.2013.04.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LiL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LiLGS13,
author = {Hongwei Li and
Shengjia Li and
Yubao Guo and
Michel Surmacs},
title = {On the vertex-pancyclicity of hypertournaments},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2749--2752},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.05.036},
doi = {10.1016/J.DAM.2013.05.036},
timestamp = {Wed, 01 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LiLGS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LiY13,
author = {Hao Li and
Weihua Yang},
title = {Bounding the size of the subgraph induced by \emph{m}m vertices and
extra edge-connectivity of hypercubes},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2753--2757},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.04.009},
doi = {10.1016/J.DAM.2013.04.009},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LiY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LiZ13,
author = {Xiangwen Li and
Sanming Zhou},
title = {Labeling outerplanar graphs with maximum degree three},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {200--211},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.018},
doi = {10.1016/J.DAM.2012.08.018},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LiZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Liang13,
author = {Hongyu Liang},
title = {On the k-edge-incident subgraph problem and its variants},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {2985--2991},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.06.014},
doi = {10.1016/J.DAM.2013.06.014},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Liang13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LiangL13,
author = {Meili Liang and
Bolian Liu},
title = {On the Randi{\'{c}} index and girth of graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {212--216},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.07.017},
doi = {10.1016/J.DAM.2012.07.017},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LiangL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LinC13,
author = {Wu{-}Hsiung Lin and
Gerard J. Chang},
title = {b-coloring of tight bipartite graphs and the Erd{\H{o}}s-Faber-Lov{\'{a}}sz
conjecture},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {1060--1066},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.11.012},
doi = {10.1016/J.DAM.2012.11.012},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LinC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LinC13a,
author = {Wu{-}Hsiung Lin and
Gerard J. Chang},
title = {\emph{b}b-chromatic numbers of powers of paths and cycles},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2532--2536},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.05.024},
doi = {10.1016/J.DAM.2013.05.024},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LinC13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LinJW13,
author = {Yo{-}Lin Lin and
Justie Su{-}tzu Juan and
Yue{-}Li Wang},
title = {Finding the edge ranking number through vertex partitions},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {1067--1071},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.10.012},
doi = {10.1016/J.DAM.2012.10.012},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/LinJW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LinS13,
author = {Huiqiu Lin and
Jinlong Shu},
title = {The distance spectral radius of digraphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2537--2543},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.04.011},
doi = {10.1016/J.DAM.2013.04.011},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LinS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LinSS13,
author = {Min Chih Lin and
Francisco J. Soulignac and
Jayme Luiz Szwarcfiter},
title = {Normal Helly circular-arc graphs and its subclasses},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {1037--1059},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.11.005},
doi = {10.1016/J.DAM.2012.11.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LinSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LinTHK13,
author = {Cheng{-}Kuan Lin and
Jimmy J. M. Tan and
Lih{-}Hsing Hsu and
Tzu{-}Liang Kung},
title = {Disjoint cycles in hypercubes with prescribed vertices in each cycle},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {2992--3004},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.07.004},
doi = {10.1016/J.DAM.2013.07.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LinTHK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Liu13,
author = {Jianxi Liu},
title = {On a conjecture of the Randi{\'{c}} index and the minimum degree
of graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2544--2548},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.05.013},
doi = {10.1016/J.DAM.2013.05.013},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/Liu13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LiuMS13,
author = {Henry Liu and
{\^{A}}ngela Mestre and
Teresa Sousa},
title = {Rainbow vertex \emph{k}-connection in graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2549--2555},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.04.025},
doi = {10.1016/J.DAM.2013.04.025},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LiuMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Lopez13,
author = {Susana{-}Clara L{\'{o}}pez},
title = {Small cutsets in arc-transitive digraphs of prime degree},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1639--1645},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.005},
doi = {10.1016/J.DAM.2013.02.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Lopez13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LopezMR13,
author = {Susana{-}Clara L{\'{o}}pez and
Francesc A. Muntaner{-}Batle and
Miquel Rius{-}Font},
title = {Labeling constructions using digraph products},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {3005--3016},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.06.006},
doi = {10.1016/J.DAM.2013.06.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LopezMR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LozanoMP13,
author = {Antonio J. Lozano and
Juan A. Mesa and
Frank Plastria},
title = {The ordered anti-median problem with distances derived from a strictly
convex norm},
journal = {Discret. Appl. Math.},
volume = {161},
number = {4-5},
pages = {642--649},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.10.015},
doi = {10.1016/J.DAM.2012.10.015},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LozanoMP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Lu13,
author = {Hongliang Lu},
title = {Simplified existence theorems on all fractional [\emph{a}, \emph{b}][a,
b]-factors},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2075--2078},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.006},
doi = {10.1016/J.DAM.2013.02.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Lu13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LuZ13,
author = {Changhong Lu and
Qing Zhou},
title = {Path covering number and \emph{L}(2, 1)L(2, 1)-labeling number of
graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2062--2074},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.020},
doi = {10.1016/J.DAM.2013.02.020},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LuZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LvW13,
author = {Benjian Lv and
Kaishun Wang},
title = {The energy of \emph{q}q-Kneser graphs and attenuated \emph{q}q-Kneser
graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2079--2083},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.013},
doi = {10.1016/J.DAM.2013.03.013},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LvW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MaffrayS13,
author = {Fr{\'{e}}d{\'{e}}ric Maffray and
Ana Silva},
title = {b-colouring the Cartesian product of trees and some other graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {4-5},
pages = {650--669},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2011.06.019},
doi = {10.1016/J.DAM.2011.06.019},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/MaffrayS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Major13,
author = {L{\'{a}}szl{\'{o}} Major},
title = {Unimodality and log-concavity of \emph{f}f-vectors for cyclic and
ordinary polytopes},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1669--1672},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.01.008},
doi = {10.1016/J.DAM.2013.01.008},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Major13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MansourS13,
author = {Toufik Mansour and
Mark Shattuck},
title = {A combinatorial approach to a general two-term recurrence},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2084--2094},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.016},
doi = {10.1016/J.DAM.2013.03.016},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MansourS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MansourS13a,
author = {Toufik Mansour and
Mark Shattuck},
title = {Counting humps and peaks in generalized Motzkin paths},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2213--2216},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.007},
doi = {10.1016/J.DAM.2013.03.007},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MansourS13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MantheyP13,
author = {Bodo Manthey and
Kai Plociennik},
title = {Approximating independent set in perturbed graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {12},
pages = {1761--1768},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.06.008},
doi = {10.1016/J.DAM.2012.06.008},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MantheyP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MartinT13,
author = {Daniel M. Martin and
Bhalchandra D. Thatte},
title = {The maximum agreement subtree problem},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {1805--1817},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.037},
doi = {10.1016/J.DAM.2013.02.037},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MartinT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Massberg13,
author = {Jens Ma{\ss}berg},
title = {Online binary minimax trees},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2556--2562},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.05.033},
doi = {10.1016/J.DAM.2013.05.033},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Massberg13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MassbergN13,
author = {Jens Ma{\ss}berg and
Tim Nieberg},
title = {Rectilinear paths with minimum segment lengths},
journal = {Discret. Appl. Math.},
volume = {161},
number = {12},
pages = {1769--1775},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2011.12.003},
doi = {10.1016/J.DAM.2011.12.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MassbergN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MasseFRV13,
author = {Alexandre Blondin Mass{\'{e}} and
Andrea Frosini and
Simone Rinaldi and
Laurent Vuillon},
title = {On the shape of permutomino tiles},
journal = {Discret. Appl. Math.},
volume = {161},
number = {15},
pages = {2316--2327},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.034},
doi = {10.1016/J.DAM.2012.08.034},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MasseFRV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MastrolilliR13,
author = {Monaldo Mastrolilli and
Arash Rafiey},
title = {On the approximation of minimum cost homomorphism to bipartite graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {4-5},
pages = {670--676},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2011.05.002},
doi = {10.1016/J.DAM.2011.05.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MastrolilliR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MavronicolasML13,
author = {Marios Mavronicolas and
Burkhard Monien and
Vicky Papadopoulou Lesta},
title = {How many attackers can selfish defenders catch?},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2563--2586},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.05.022},
doi = {10.1016/J.DAM.2013.05.022},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/MavronicolasML13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MaxovaT13,
author = {Jana Maxov{\'{a}} and
Daniel Turz{\'{\i}}k},
title = {Which distance-hereditary graphs are cover-incomparability graphs?},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2095--2100},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.01.017},
doi = {10.1016/J.DAM.2013.01.017},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MaxovaT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MilanicS13,
author = {Martin Milanic and
Oliver Schaudt},
title = {Computing square roots of trivially perfect and threshold graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1538--1545},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.12.027},
doi = {10.1016/J.DAM.2012.12.027},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MilanicS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MilanicT13,
author = {Martin Milanic and
Alexandru I. Tomescu},
title = {Set graphs. I. Hereditarily finite sets and extensional acyclic orientations},
journal = {Discret. Appl. Math.},
volume = {161},
number = {4-5},
pages = {677--690},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2011.11.027},
doi = {10.1016/J.DAM.2011.11.027},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MilanicT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MohrS13,
author = {Esther Mohr and
G{\"{u}}nter Schmidt},
title = {How much is it worth to know the future in online conversion problems?},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1546--1555},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.01.001},
doi = {10.1016/J.DAM.2013.01.001},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/MohrS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MonroyAL13,
author = {I. M. Monroy and
Ciro{-}Alberto Amaya and
Andr{\'{e}} Langevin},
title = {The periodic capacitated arc routing problem with irregular services},
journal = {Discret. Appl. Math.},
volume = {161},
number = {4-5},
pages = {691--701},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2011.05.014},
doi = {10.1016/J.DAM.2011.05.014},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MonroyAL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Mukwembi13,
author = {Simon Mukwembi},
title = {On spanning cycles, paths and trees},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2217--2222},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.018},
doi = {10.1016/J.DAM.2013.03.018},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Mukwembi13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MulderN13,
author = {Henry Martyn Mulder and
Beth Novick},
title = {A tight axiomatization of the median procedure on median graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {6},
pages = {838--846},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.10.027},
doi = {10.1016/J.DAM.2012.10.027},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MulderN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/NakamuraSTKM13,
author = {Atsuyoshi Nakamura and
Tomoya Saito and
Ichigaku Takigawa and
Mineichi Kudo and
Hiroshi Mamitsuka},
title = {Fast algorithms for finding a minimum repetition representation of
strings and trees},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1556--1575},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.12.013},
doi = {10.1016/J.DAM.2012.12.013},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/NakamuraSTKM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/NiesinkPS13,
author = {Patrick Niesink and
Keven Poulin and
Mateja Sajna},
title = {Computing transitive closure of bipolar weighted digraphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {217--243},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.06.013},
doi = {10.1016/J.DAM.2012.06.013},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/NiesinkPS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/NinhP13,
author = {Anh Ninh and
Andr{\'{a}}s Pr{\'{e}}kopa},
title = {Log-concavity of compound distributions with applications in stochastic
optimization},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {3017--3027},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.07.007},
doi = {10.1016/J.DAM.2013.07.007},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/NinhP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Nutov13,
author = {Zeev Nutov},
title = {Small \emph{{\(\mathscr{l}\)}}{\(\mathscr{l}\)}-edge-covers in \emph{k}k-connected
graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2101--2106},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.021},
doi = {10.1016/J.DAM.2013.02.021},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Nutov13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/OuZ13,
author = {Lifeng Ou and
Heping Zhang},
title = {Fibonacci (p, r)-cubes which are median graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {3},
pages = {441--444},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.09.008},
doi = {10.1016/J.DAM.2012.09.008},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/OuZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/PachT13,
author = {J{\'{a}}nos Pach and
G{\'{e}}za T{\'{o}}th},
title = {Monochromatic empty triangles in two-colored point sets},
journal = {Discret. Appl. Math.},
volume = {161},
number = {9},
pages = {1259--1261},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2011.08.026},
doi = {10.1016/J.DAM.2011.08.026},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/PachT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/PadroVY13,
author = {Carles Padr{\'{o}} and
Leonor V{\'{a}}zquez and
An Yang},
title = {Finding lower bounds on the complexity of secret sharing schemes by
linear programming},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {1072--1084},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.10.020},
doi = {10.1016/J.DAM.2012.10.020},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/PadroVY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/PandaP13,
author = {B. S. Panda and
Subhabrata Paul},
title = {Liar's domination in graphs: Complexity and algorithm},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {1085--1092},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.12.011},
doi = {10.1016/J.DAM.2012.12.011},
timestamp = {Tue, 25 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/PandaP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/PandaP13a,
author = {B. S. Panda and
Dinabandhu Pradhan},
title = {A linear time algorithm for computing a minimum paired-dominating
set of a convex bipartite graph},
journal = {Discret. Appl. Math.},
volume = {161},
number = {12},
pages = {1776--1783},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.04.014},
doi = {10.1016/J.DAM.2012.04.014},
timestamp = {Wed, 09 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/PandaP13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ParkI13,
author = {Jung{-}Heum Park and
Insung Ihm},
title = {Strong matching preclusion under the conditional fault model},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {1093--1105},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.10.002},
doi = {10.1016/J.DAM.2012.10.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ParkI13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/PattilloVBB13,
author = {Jeffrey Pattillo and
Alexander Veremyev and
Sergiy Butenko and
Vladimir Boginski},
title = {On the maximum quasi-clique problem},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {244--257},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.07.019},
doi = {10.1016/J.DAM.2012.07.019},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/PattilloVBB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/PelegSS13,
author = {David Peleg and
Ignasi Sau and
Mordechai Shalom},
title = {On approximating the \emph{d}-girth of a graph},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2587--2596},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.04.022},
doi = {10.1016/J.DAM.2013.04.022},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/PelegSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Pelto13,
author = {Mikko Pelto},
title = {Optimal (r, {\(\leq\)}3)-locating-dominating codes in the infinite
king grid},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2597--2603},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.04.027},
doi = {10.1016/J.DAM.2013.04.027},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Pelto13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/PerlesMK13,
author = {Micha A. Perles and
Horst Martini and
Yaakov S. Kupitz},
title = {On the polygonal diameter (= link diameter) of the interior, resp.
exterior, of a simple closed polygon in the plane},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1576--1585},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.01.018},
doi = {10.1016/J.DAM.2013.01.018},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/PerlesMK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/PlastriaGC13,
author = {Frank Plastria and
Jos{\'{e}} Gordillo and
Emilio Carrizosa},
title = {Locating a semi-obnoxious covering facility with repelling polygonal
regions},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2604--2623},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.05.010},
doi = {10.1016/J.DAM.2013.05.010},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/PlastriaGC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/PowersW13,
author = {Robert C. Powers and
Jeremy M. White},
title = {Injectivity and weak ternary separation},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1646--1650},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.12.015},
doi = {10.1016/J.DAM.2012.12.015},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/PowersW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ProtR13,
author = {Damien Prot and
Christophe Rapine},
title = {Approximations for the Two-Machine Cross-Docking Flow Shop Problem},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2107--2119},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.030},
doi = {10.1016/J.DAM.2013.02.030},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ProtR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Przybylo13,
author = {Jakub Przybylo},
title = {On upper bounds for multiple domination numbers of graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2758--2763},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.05.006},
doi = {10.1016/J.DAM.2013.05.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Przybylo13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/PuertoRR13,
author = {Justo Puerto and
A. B. Ramos and
Antonio M. Rodr{\'{\i}}guez{-}Ch{\'{\i}}a},
title = {A specialized branch {\&} bound {\&} cut for Single-Allocation
Ordered Median Hub Location problems},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2624--2646},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.05.035},
doi = {10.1016/J.DAM.2013.05.035},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/PuertoRR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/QuilliotC13,
author = {Alain Quilliot and
Philippe Chr{\'{e}}tienne},
title = {Homogeneously non-idling schedules of unit-time jobs on identical
parallel machines},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1586--1597},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.01.019},
doi = {10.1016/J.DAM.2013.01.019},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/QuilliotC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/RadV13,
author = {Nader Jafari Rad and
Lutz Volkmann},
title = {A note on the independent domination number in graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {3087--3089},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.07.009},
doi = {10.1016/J.DAM.2013.07.009},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/RadV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/RichardR13,
author = {Adrien Richard and
Paul Ruet},
title = {From kernels in directed graphs to fixed points and negative cycles
in Boolean networks},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {1106--1117},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.10.022},
doi = {10.1016/J.DAM.2012.10.022},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/RichardR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/RolandSF13,
author = {Julien Roland and
Yves De Smet and
Jos{\'{e}} Rui Figueira},
title = {Inverse multi-objective combinatorial optimization},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2764--2771},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.04.024},
doi = {10.1016/J.DAM.2013.04.024},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/RolandSF13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Sagnol13,
author = {Guillaume Sagnol},
title = {Approximation of a maximum-submodular-coverage problem involving spectral
functions, with application to experimental designs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {258--276},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.07.016},
doi = {10.1016/J.DAM.2012.07.016},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Sagnol13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/SarkarH13,
author = {Amites Sarkar and
Martin Haenggi},
title = {Percolation in the secrecy graph},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2120--2132},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.022},
doi = {10.1016/J.DAM.2013.03.022},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/SarkarH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Schaudt13,
author = {Oliver Schaudt},
title = {On dominating sets whose induced subgraphs have a bounded diameter},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2647--2652},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.05.030},
doi = {10.1016/J.DAM.2013.05.030},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Schaudt13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Schiermeyer13,
author = {Ingo Schiermeyer},
title = {On minimally rainbow \emph{k}-connected graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {4-5},
pages = {702--705},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2011.05.001},
doi = {10.1016/J.DAM.2011.05.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Schiermeyer13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Schiermeyer13a,
author = {Ingo Schiermeyer},
title = {Rainbow connection and minimum degree},
journal = {Discret. Appl. Math.},
volume = {161},
number = {12},
pages = {1784--1787},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2011.10.009},
doi = {10.1016/J.DAM.2011.10.009},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Schiermeyer13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Schweitzer13,
author = {Pascal Schweitzer},
title = {Iterated open neighborhood graphs and generalizations},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1598--1609},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.12.023},
doi = {10.1016/J.DAM.2012.12.023},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Schweitzer13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ShaiSW13,
author = {Offer Shai and
Adnan Sljoka and
Walter Whiteley},
title = {Directed graphs, decompositions, and spatial linkages},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {3028--3047},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.06.004},
doi = {10.1016/J.DAM.2013.06.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ShaiSW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ShangZ13,
author = {Li Shang and
Heping Zhang},
title = {Super restricted edge-connectivity of graphs with diameter 2},
journal = {Discret. Appl. Math.},
volume = {161},
number = {3},
pages = {445--451},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.030},
doi = {10.1016/J.DAM.2012.08.030},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ShangZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/SinhaK13,
author = {Deepa Sinha and
Jaspreet Kaur},
title = {Full friendly index set - {I}},
journal = {Discret. Appl. Math.},
volume = {161},
number = {9},
pages = {1262--1274},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.10.028},
doi = {10.1016/J.DAM.2012.10.028},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/SinhaK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/SinhaUK13,
author = {Deepa Sinha and
Somya Upadhyaya and
Priya Kataria},
title = {Characterization of common-edge sigraph},
journal = {Discret. Appl. Math.},
volume = {161},
number = {9},
pages = {1275--1285},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.10.013},
doi = {10.1016/J.DAM.2012.10.013},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/SinhaUK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/SmallM13,
author = {Lucy Small and
Oliver Mason},
title = {Information diffusion on the iterated local transitivity model of
online social networks},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1338--1344},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.10.029},
doi = {10.1016/J.DAM.2012.10.029},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/SmallM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/SuXX13,
author = {Guifu Su and
Liming Xiong and
Lan Xu},
title = {On the Co-PI and Laplacian Co-PI eigenvalues of a graph},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {277--283},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.019},
doi = {10.1016/J.DAM.2012.08.019},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/SuXX13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/SubramanianVC13,
author = {K. G. Subramanian and
Ibrahim Venkat and
Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}}},
title = {On the power of permitting features in cooperating context-free array
grammar systems},
journal = {Discret. Appl. Math.},
volume = {161},
number = {15},
pages = {2328--2335},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.036},
doi = {10.1016/J.DAM.2012.08.036},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/SubramanianVC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/SumenjakRT13,
author = {Tadeja Kraner Sumenjak and
Douglas F. Rall and
Aleksandra Tepeh},
title = {Rainbow domination in the lexicographic product of graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2133--2141},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.011},
doi = {10.1016/J.DAM.2013.03.011},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/SumenjakRT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/TavakoliRA13,
author = {Mostafa Tavakoli and
Freydoon Rahbarnia and
A. R. Ashrafi},
title = {Further results on hierarchical product of graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {1162--1167},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.11.021},
doi = {10.1016/J.DAM.2012.11.021},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/TavakoliRA13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/TiwariT13,
author = {Apurv Tiwari and
Amitabha Tripathi},
title = {On the range of size of sum graphs {\&} integral sum graphs of
a given order},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2653--2661},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.05.004},
doi = {10.1016/J.DAM.2013.05.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/TiwariT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Tokunaga13,
author = {Shin{-}ichi Tokunaga},
title = {Dominating sets of maximal outerplanar graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {3097--3099},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.06.025},
doi = {10.1016/J.DAM.2013.06.025},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Tokunaga13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ToutantAR13,
author = {Jean{-}Luc Toutant and
Eric Andres and
Tristan Roussillon},
title = {Digital circles, spheres and hyperspheres: From morphological models
to analytical characterizations and topological properties},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2662--2677},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.06.001},
doi = {10.1016/J.DAM.2013.06.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ToutantAR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Veelaert13,
author = {Peter Veelaert},
title = {Topological relations between separating circles},
journal = {Discret. Appl. Math.},
volume = {161},
number = {15},
pages = {2336--2347},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.039},
doi = {10.1016/J.DAM.2012.08.039},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Veelaert13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Vesel13,
author = {Aleksander Vesel},
title = {Fibonacci dimension of the resonance graphs of catacondensed benzenoid
graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2158--2168},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.019},
doi = {10.1016/J.DAM.2013.03.019},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Vesel13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Vinh13,
author = {Le Anh Vinh},
title = {An explicit construction of (3, \emph{t})(3, t)-existentially closed
graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1651--1654},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.12.016},
doi = {10.1016/J.DAM.2012.12.016},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Vinh13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Volkmann13,
author = {Lutz Volkmann},
title = {Complementary cycles in almost regular multipartite tournaments, where
one cycle has length four},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2169--2177},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.006},
doi = {10.1016/J.DAM.2013.03.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Volkmann13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/VukicevicC13,
author = {Damir Vukicevic and
Gilles Caporossi},
title = {Network descriptors based on betweenness centrality and transmission
and their extremal values},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2678--2686},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.04.005},
doi = {10.1016/J.DAM.2013.04.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/VukicevicC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/VukicevicS13,
author = {Zana Kovijanic Vukicevic and
Dragan Stevanovic},
title = {Bicyclic graphs with extremal values of {PI} index},
journal = {Discret. Appl. Math.},
volume = {161},
number = {3},
pages = {395--403},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.09.015},
doi = {10.1016/J.DAM.2012.09.015},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/VukicevicS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/WangB13,
author = {Jianfeng Wang and
Francesco Belardo},
title = {Signless Laplacian eigenvalues and circumference of graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1610--1617},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.01.013},
doi = {10.1016/J.DAM.2013.01.013},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/WangB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/WangFZ13,
author = {Shiying Wang and
Kai Feng and
Guozhen Zhang},
title = {Strong matching preclusion for k-ary n-cubes},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {3054--3062},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.06.011},
doi = {10.1016/J.DAM.2013.06.011},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/WangFZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/WangW13,
author = {Yan Wang and
Chunxiang Wang},
title = {On 4-\emph{{\(\gamma\)}}\({}_{\mbox{\emph{t}}}\){\(\gamma\)}t-critical
graphs of diameter two},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1660--1668},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.01.012},
doi = {10.1016/J.DAM.2013.01.012},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/WangW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/WangW13a,
author = {Yue{-}Li Wang and
Kuo{-}Hua Wu},
title = {A tight upper bound for 2-rainbow domination in generalized Petersen
graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2178--2188},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.031},
doi = {10.1016/J.DAM.2013.02.031},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/WangW13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/WangW13b,
author = {Ruixia Wang and
Shiying Wang},
title = {A sufficient condition for graphs to be {\(\lambda\)}\({}_{\mbox{k}}\)-optimal},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {3048--3053},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.05.037},
doi = {10.1016/J.DAM.2013.05.037},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/WangW13b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/WangX13,
author = {Yingqian Wang and
Lingji Xu},
title = {A sufficient condition for a plane graph with maximum degree 6 to
be class 1},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {307--310},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.011},
doi = {10.1016/J.DAM.2012.08.011},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/WangX13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/WangY13,
author = {Wei Wang and
Zhidan Yan},
title = {Connectivity of Kronecker products with complete multipartite graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1655--1659},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.01.009},
doi = {10.1016/J.DAM.2013.01.009},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/WangY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/WangYL13,
author = {Weizhong Wang and
Dong Yang and
Yanfeng Luo},
title = {The Laplacian polynomial and Kirchhoff index of graphs derived from
regular graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {3063--3071},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.06.010},
doi = {10.1016/J.DAM.2013.06.010},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/WangYL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/WanlessZ13,
author = {Ian M. Wanless and
Xiande Zhang},
title = {On the existence of retransmission permutation arrays},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2772--2777},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.04.017},
doi = {10.1016/J.DAM.2013.04.017},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/WanlessZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/WlochBBWW13,
author = {Iwona Wloch and
Urszula Bednarz and
Dorota Br{\'{o}}d and
Andrzej Wloch and
Malgorzata Wolowiec{-}Musial},
title = {On a new type of distance Fibonacci numbers},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2695--2701},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.05.029},
doi = {10.1016/J.DAM.2013.05.029},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/WlochBBWW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/XuLL13,
author = {Shou{-}Jun Xu and
Xianyue Li and
Ronghua Liang},
title = {Moplex orderings generated by the LexDFS algorithm},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2189--2195},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.028},
doi = {10.1016/J.DAM.2013.02.028},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/XuLL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/YangK13,
author = {Yujun Yang and
Douglas J. Klein},
title = {A recursion formula for resistance distances and its applications},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2702--2715},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.07.015},
doi = {10.1016/J.DAM.2012.07.015},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/YangK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Ye13,
author = {Dong Ye},
title = {On the anti-Kekul{\'{e}} number and odd cycle transversal of
regular graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2196--2199},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.014},
doi = {10.1016/J.DAM.2013.03.014},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/Ye13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/YeroR13,
author = {Ismael Gonz{\'{a}}lez Yero and
Juan Alberto Rodr{\'{\i}}guez{-}Vel{\'{a}}zquez},
title = {Computing global offensive alliances in Cartesian product graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {1-2},
pages = {284--293},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.009},
doi = {10.1016/J.DAM.2012.08.009},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/YeroR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/YeroRB13,
author = {Ismael Gonz{\'{a}}lez Yero and
Juan Alberto Rodr{\'{\i}}guez{-}Vel{\'{a}}zquez and
Sergio Bermudo},
title = {Alliance free sets in Cartesian product graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {10-11},
pages = {1618--1625},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.01.011},
doi = {10.1016/J.DAM.2013.01.011},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/YeroRB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Yin13,
author = {Jian{-}Hua Yin},
title = {An extension of {A.R.} Rao's characterization of potentially K\({}_{\mbox{m+1}}\)-graphic
sequences},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {1118--1127},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.12.008},
doi = {10.1016/J.DAM.2012.12.008},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Yin13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Yordzhev13,
author = {Krasimir Yordzhev},
title = {On the number of disjoint pairs of S-permutation matrices},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {3072--3079},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.06.007},
doi = {10.1016/J.DAM.2013.06.007},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Yordzhev13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/YouYH13,
author = {Zhifu You and
Lihua You and
Wenxi Hong},
title = {Comment on "Kirchhoff index in line, subdivision and total graphs
of a regular graph"},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {3100--3103},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.06.015},
doi = {10.1016/J.DAM.2013.06.015},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/YouYH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/YuW13,
author = {Yuyin Yu and
Mingsheng Wang},
title = {Permutation polynomials and their differential properties over residue
class rings},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {3104--3108},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.06.020},
doi = {10.1016/J.DAM.2013.06.020},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/YuW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/YuanLWL13,
author = {Jun Yuan and
Aixia Liu and
Hongmei Wu and
Jing Li},
title = {Panconnectivity of n-dimensional torus networks with faulty vertices
and edges},
journal = {Discret. Appl. Math.},
volume = {161},
number = {3},
pages = {404--423},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.08.027},
doi = {10.1016/J.DAM.2012.08.027},
timestamp = {Fri, 30 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/YuanLWL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Zaker13,
author = {Manouchehr Zaker},
title = {Generalized degeneracy, dynamic monopolies and maximum degenerate
subgraphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2716--2723},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.04.012},
doi = {10.1016/J.DAM.2013.04.012},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Zaker13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Zamfirescu13,
author = {Carol T. Zamfirescu},
title = {(2)-pancyclic graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {1128--1136},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.11.002},
doi = {10.1016/J.DAM.2012.11.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Zamfirescu13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Zuylen13,
author = {Anke van Zuylen},
title = {Deterministic approximation algorithms for the maximum traveling salesman
and maximum triangle packing problems},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2142--2157},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.001},
doi = {10.1016/J.DAM.2013.03.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Zuylen13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-04-23 15:18 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
