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/dam261.bht:"
download as .bib file
@article{DBLP:journals/dam/AltinelAST19,
author = {I. Kuban Altinel and
Necati Aras and
Zeynep Suvak and
Z. Caner Taskin},
title = {Minimum cost noncrossing flow problem on layered networks},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {2--21},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.09.016},
doi = {10.1016/J.DAM.2018.09.016},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AltinelAST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ArbibKP19,
author = {Claudio Arbib and
Oya Ekin Karasan and
Mustafa {\c{C}}. Pinar},
title = {On envy-free perfect matching},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {22--27},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.03.034},
doi = {10.1016/J.DAM.2018.03.034},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ArbibKP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AriglianoGGGP19,
author = {Anna Arigliano and
Gianpaolo Ghiani and
Antonio Grieco and
Emanuela Guerriero and
Isaac Plana},
title = {Time-dependent asymmetric traveling salesman problem with time windows:
Properties and an exact algorithm},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {28--39},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.09.017},
doi = {10.1016/J.DAM.2018.09.017},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AriglianoGGGP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BeaudouFN19,
author = {Laurent Beaudou and
Florent Foucaud and
Reza Naserasr},
title = {Homomorphism bounds of signed bipartite K4-minor-free graphs and edge-colorings
of 2k-regular K4-minor-free multigraphs},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {40--51},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.09.004},
doi = {10.1016/J.DAM.2018.09.004},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BeaudouFN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BentoBMMSS19,
author = {Lucila M. S. Bento and
Davidson R. Boccardo and
Raphael C. S. Machado and
Fl{\'{a}}vio Keidi Miyazawa and
Vin{\'{\i}}cius Gusm{\~{a}}o Pereira de S{\'{a}} and
Jayme Luiz Szwarcfiter},
title = {Dijkstra graphs},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {52--62},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2017.07.033},
doi = {10.1016/J.DAM.2017.07.033},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BentoBMMSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BertazziGW19,
author = {Luca Bertazzi and
Bruce L. Golden and
Xingyin Wang},
title = {The Bin Packing Problem with Item Fragmentation: {A} worst-case analysis},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {63--77},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.08.023},
doi = {10.1016/J.DAM.2018.08.023},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BertazziGW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BonomoE19,
author = {Flavia Bonomo and
Diego de Estrada},
title = {On the thinness and proper thinness of a graph},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {78--92},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.03.072},
doi = {10.1016/J.DAM.2018.03.072},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BonomoE19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BougeretPP19,
author = {Marin Bougeret and
Artur Alves Pessoa and
Michael Poss},
title = {Robust scheduling with budgeted uncertainty},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {93--107},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.07.001},
doi = {10.1016/J.DAM.2018.07.001},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BougeretPP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrewsterMY19,
author = {Richard C. Brewster and
Gary MacGillivray and
Feiran Yang},
title = {Broadcast domination and multipacking in strongly chordal graphs},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {108--118},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.08.021},
doi = {10.1016/J.DAM.2018.08.021},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrewsterMY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CameronH19,
author = {Kathie Cameron and
Ch{\'{\i}}nh T. Ho{\`{a}}ng},
title = {Solving the clique cover problem on (bull, C4)-free graphs},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {119--122},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.09.037},
doi = {10.1016/J.DAM.2018.09.037},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CameronH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CramaGR19,
author = {Yves Crama and
Bernard Gendron and
Bernard Ries},
title = {Preface: Tenth International Colloquium on Graphs and Optimization
{(GO} X), 2016},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {1},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2019.02.026},
doi = {10.1016/J.DAM.2019.02.026},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CramaGR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DenizE19,
author = {Zakir Deniz and
T{\'{\i}}naz Ekim},
title = {Edge-stable equimatchable graphs},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {136--147},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.09.033},
doi = {10.1016/J.DAM.2018.09.033},
timestamp = {Fri, 17 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/DenizE19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ErnstFSZ19,
author = {Andreas T. Ernst and
Joey Fung and
Gaurav Singh and
Yakov Zinder},
title = {Flexible flow shop with dedicated buffers},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {148--163},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.07.002},
doi = {10.1016/J.DAM.2018.07.002},
timestamp = {Wed, 02 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ErnstFSZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FigueiredoFL19,
author = {Rosa Figueiredo and
Yuri Frota and
Martine Labb{\'{e}}},
title = {A branch-and-cut algorithm for the maximum k-balanced subgraph of
a signed graph},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {164--185},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.11.022},
doi = {10.1016/J.DAM.2018.11.022},
timestamp = {Wed, 21 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/FigueiredoFL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FurmanczykO19,
author = {Hanna Furmanczyk and
Pawel Obszarski},
title = {Equitable coloring of hypergraphs},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {186--192},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2019.01.016},
doi = {10.1016/J.DAM.2019.01.016},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/FurmanczykO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FurtadoDFG19,
author = {Ana Lu{\'{\i}}sa C. Furtado and
Simone Dantas and
Celina M. H. de Figueiredo and
Sylvain Gravier},
title = {Timber game as a counting problem},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {193--202},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2017.11.011},
doi = {10.1016/J.DAM.2017.11.011},
timestamp = {Wed, 21 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FurtadoDFG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Gendron19,
author = {Bernard Gendron},
title = {Revisiting Lagrangian relaxation for network design},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {203--218},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.07.003},
doi = {10.1016/J.DAM.2018.07.003},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Gendron19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HellHS19,
author = {Pavol Hell and
C{\'{e}}sar Hern{\'{a}}ndez{-}Cruz and
Cl{\'{a}}udia Linhares Sales},
title = {Minimal obstructions to 2-polar cographs},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {219--228},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.01.007},
doi = {10.1016/J.DAM.2018.01.007},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HellHS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HertzMG19,
author = {Alain Hertz and
Romain Montagn{\'{e}} and
Fran{\c{c}}ois Gagnon},
title = {A comparison of integer programming models for the partial directed
weighted improper coloring problem},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {229--245},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.08.026},
doi = {10.1016/J.DAM.2018.08.026},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HertzMG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HuangM19,
author = {Jing Huang and
Josh Manzer},
title = {Chronological rectangle digraphs which are two-terminal series-parallel},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {246--257},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.05.041},
doi = {10.1016/J.DAM.2018.05.041},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HuangM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KaminskiP19,
author = {Marcin Kaminski and
Anna Pstrucha},
title = {Certifying coloring algorithms for graphs without long induced paths},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {258--267},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.09.031},
doi = {10.1016/J.DAM.2018.09.031},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KaminskiP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KerdjoudjR19,
author = {Samia Kerdjoudj and
Andr{\'{e}} Raspaud},
title = {List star edge-coloring of k-degenerate graphs and K4-minor free graphs},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {268--275},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2019.01.030},
doi = {10.1016/J.DAM.2019.01.030},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KerdjoudjR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LabbeMR19,
author = {Martine Labb{\'{e}} and
Luisa I. Mart{\'{\i}}nez{-}Merino and
Antonio M. Rodr{\'{\i}}guez{-}Ch{\'{\i}}a},
title = {Mixed integer linear programming for feature selection in support
vector machine},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {276--304},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.10.025},
doi = {10.1016/J.DAM.2018.10.025},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/LabbeMR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LewonMMW19,
author = {Robert Lewon and
Anna Malafiejska and
Michal Malafiejski and
Kacper Wereszko},
title = {Global edge alliances in graphs},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {305--315},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.09.002},
doi = {10.1016/J.DAM.2018.09.002},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LewonMMW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/SantosLNP19,
author = {Marcio Costa Santos and
Hannan Luss and
Dritan Nace and
Michael Poss},
title = {Proportional and maxmin fairness for the sensor location problem with
chance constraints},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {316--331},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2019.03.004},
doi = {10.1016/J.DAM.2019.03.004},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/SantosLNP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/SilvaDS19,
author = {Anderson G. da Silva and
Simone Dantas and
Diana Sasaki},
title = {Equitable total coloring of complete r-partite p-balanced graphs},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {123--135},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.03.009},
doi = {10.1016/J.DAM.2018.03.009},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/SilvaDS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/SoperS19,
author = {Alan J. Soper and
Vitaly A. Strusevich},
title = {Schedules with a single preemption on uniform parallel machines},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {332--343},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.03.007},
doi = {10.1016/J.DAM.2018.03.007},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/SoperS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/TheveninZ19,
author = {Simon Thevenin and
Nicolas Zufferey},
title = {Learning Variable Neighborhood Search for a scheduling problem with
time windows and rejections},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {344--353},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.03.019},
doi = {10.1016/J.DAM.2018.03.019},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/TheveninZ19.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-05-25 10:20 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:
