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/dam339.bht:"
download as .bib file
@article{DBLP:journals/dam/BianchettiM23,
author = {Marcelo Bianchetti and
Javier Marenco},
title = {A branch-and-cut algorithm for the routing and spectrum allocation
problem},
journal = {Discret. Appl. Math.},
volume = {339},
pages = {107--126},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.06.015},
doi = {10.1016/J.DAM.2023.06.015},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BianchettiM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BonomoBrabermanB23,
author = {Flavia Bonomo{-}Braberman and
Gast{\'{o}}n Abel Brito},
title = {Intersection models and forbidden pattern characterizations for 2-thin
and proper 2-thin graphs},
journal = {Discret. Appl. Math.},
volume = {339},
pages = {53--77},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.06.013},
doi = {10.1016/J.DAM.2023.06.013},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BonomoBrabermanB23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Borg23,
author = {Peter Borg},
title = {Isolation of connected graphs},
journal = {Discret. Appl. Math.},
volume = {339},
pages = {154--165},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.05.004},
doi = {10.1016/J.DAM.2023.05.004},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/Borg23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CarufelHMRS23,
author = {Jean{-}Lou De Carufel and
Darryl Hill and
Anil Maheshwari and
Sasanka Roy and
Lu{\'{\i}}s Fernando Schultz Xavier da Silveira},
title = {Constant delay lattice train schedules},
journal = {Discret. Appl. Math.},
volume = {339},
pages = {1--10},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.06.016},
doi = {10.1016/J.DAM.2023.06.016},
timestamp = {Tue, 26 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/CarufelHMRS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FabregaMM23,
author = {Josep F{\`{a}}brega and
Jaume Mart{\'{\i}}{-}Farr{\'{e}} and
Xavier Mu{\~{n}}oz},
title = {Immune sets in monotone infection rules. Characterization and complexity},
journal = {Discret. Appl. Math.},
volume = {339},
pages = {202--215},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.06.032},
doi = {10.1016/J.DAM.2023.06.032},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FabregaMM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FranklinM23,
author = {Atli Fannar Frankl{\'{\i}}n and
Robert K. Moniot},
title = {The difficulty of beating the Taxman},
journal = {Discret. Appl. Math.},
volume = {339},
pages = {166--171},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.06.019},
doi = {10.1016/J.DAM.2023.06.019},
timestamp = {Tue, 26 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/FranklinM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GuoWXLL23,
author = {Chen Guo and
Chengzhong Wu and
Zhifang Xiao and
Jianbo Lu and
Zhihong Liu},
title = {The intermittent diagnosability for two families of interconnection
networks under the {PMC} model and MM* model},
journal = {Discret. Appl. Math.},
volume = {339},
pages = {89--106},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.05.029},
doi = {10.1016/J.DAM.2023.05.029},
timestamp = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/GuoWXLL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Jannesari23,
author = {Mohsen Jannesari},
title = {Graphs with doubly resolving number 2},
journal = {Discret. Appl. Math.},
volume = {339},
pages = {178--183},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.06.017},
doi = {10.1016/J.DAM.2023.06.017},
timestamp = {Tue, 26 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/Jannesari23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JinLX23,
author = {Qihui Jin and
Shasha Li and
Mengmeng Xie},
title = {3-path-connectivity of Cayley graphs generated by transposition trees},
journal = {Discret. Appl. Math.},
volume = {339},
pages = {292--299},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.06.034},
doi = {10.1016/J.DAM.2023.06.034},
timestamp = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/JinLX23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JoeN23,
author = {Jonathan Joe and
Matt Noble},
title = {A Triangle-free, 4-chromatic {Q3} Euclidean distance graph Scavenger
hunt!},
journal = {Discret. Appl. Math.},
volume = {339},
pages = {216--226},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.06.027},
doi = {10.1016/J.DAM.2023.06.027},
timestamp = {Tue, 26 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/JoeN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KahlL23,
author = {Nathan Kahl and
Kristi Luttrell},
title = {On maximum graphs in Tutte polynomial posets},
journal = {Discret. Appl. Math.},
volume = {339},
pages = {78--88},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.06.018},
doi = {10.1016/J.DAM.2023.06.018},
timestamp = {Tue, 26 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/KahlL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KlamsakulTSKSK23,
author = {Natawat Klamsakul and
Pantaree Thengarnanchai and
Mattanaporn Suebtangjai and
Pailin Kaewperm and
Nuttanon Songsuwan and
Pawaton Kaemawichanurat},
title = {Counting maximal independent sets in some n-gonal cacti},
journal = {Discret. Appl. Math.},
volume = {339},
pages = {234--280},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.06.023},
doi = {10.1016/J.DAM.2023.06.023},
timestamp = {Tue, 26 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/KlamsakulTSKSK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KuusistoR23,
author = {Antti Kuusisto and
Raine R{\"{o}}nnholm},
title = {The optimal way to play the most difficult repeated two-player coordination
games},
journal = {Discret. Appl. Math.},
volume = {339},
pages = {36--52},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.06.010},
doi = {10.1016/J.DAM.2023.06.010},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KuusistoR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LanLZ23a,
author = {Kaiyang Lan and
Feng Liu and
Yidong Zhou},
title = {Some remarks on graphs with no induced subdivision of {K4}},
journal = {Discret. Appl. Math.},
volume = {339},
pages = {227--233},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.06.031},
doi = {10.1016/J.DAM.2023.06.031},
timestamp = {Tue, 26 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/LanLZ23a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LouWY23,
author = {Jiayu Lou and
Ligong Wang and
Ming Yuan},
title = {On the {\(\alpha\)}-index of minimally 2-connected graphs with given
order or size},
journal = {Discret. Appl. Math.},
volume = {339},
pages = {281--291},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.06.026},
doi = {10.1016/J.DAM.2023.06.026},
timestamp = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/LouWY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LuzarMRSSS23,
author = {Borut Luzar and
M{\'{a}}ria Macekov{\'{a}} and
Simona Rindosov{\'{a}} and
Roman Sot{\'{a}}k and
Katar{\'{\i}}na Srokov{\'{a}} and
Kenny Storgel},
title = {Locally irregular edge-coloring of subcubic graphs},
journal = {Discret. Appl. Math.},
volume = {339},
pages = {136--148},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.06.020},
doi = {10.1016/J.DAM.2023.06.020},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/LuzarMRSSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ManurangsiS23,
author = {Pasin Manurangsi and
Warut Suksompong},
title = {Fixing knockout tournaments with seeds},
journal = {Discret. Appl. Math.},
volume = {339},
pages = {21--35},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.06.012},
doi = {10.1016/J.DAM.2023.06.012},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ManurangsiS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MartinezE23,
author = {Abel Cabrera Mart{\'{\i}}nez and
Alejandro Estrada{-}Moreno},
title = {Double domination in rooted product graphs},
journal = {Discret. Appl. Math.},
volume = {339},
pages = {127--135},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.06.021},
doi = {10.1016/J.DAM.2023.06.021},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/MartinezE23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Murphy23,
author = {Kyle Murphy},
title = {Strict optimal rubbling of graphs},
journal = {Discret. Appl. Math.},
volume = {339},
pages = {349--361},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.04.018},
doi = {10.1016/J.DAM.2023.04.018},
timestamp = {Tue, 26 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/Murphy23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/NakanoSS23,
author = {Fumihiko Nakano and
Taizo Sadahiro and
Tetsuya Sakurai},
title = {Top to random shuffles on colored permutations},
journal = {Discret. Appl. Math.},
volume = {339},
pages = {336--348},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.06.037},
doi = {10.1016/J.DAM.2023.06.037},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/NakanoSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Pavlik23,
author = {Jan Pavl{\'{\i}}k},
title = {Distributivity of a segmentation lattice},
journal = {Discret. Appl. Math.},
volume = {339},
pages = {300--316},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.06.028},
doi = {10.1016/J.DAM.2023.06.028},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/Pavlik23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/WeffortSantosS23,
author = {Celso A. Weffort{-}Santos and
Rafael C. S. Schouery},
title = {Graphs without gap-vertex-labellings: Families and bounds},
journal = {Discret. Appl. Math.},
volume = {339},
pages = {317--335},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.06.036},
doi = {10.1016/J.DAM.2023.06.036},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/WeffortSantosS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Wu23,
author = {Biao Wu},
title = {A refined result on cross-intersecting families},
journal = {Discret. Appl. Math.},
volume = {339},
pages = {149--153},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.06.007},
doi = {10.1016/J.DAM.2023.06.007},
timestamp = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/Wu23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/WuXK23,
author = {Jiadong Wu and
Yisai Xue and
Liying Kang},
title = {Some sufficient conditions for graphs being k-leaf-connected},
journal = {Discret. Appl. Math.},
volume = {339},
pages = {11--20},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.06.009},
doi = {10.1016/J.DAM.2023.06.009},
timestamp = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/WuXK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/YangHY23,
author = {Yuxing Yang and
Xiaohui Hua and
Lulu Yang},
title = {Hyper K1,r and sub-K1,r fault tolerance of star graphs},
journal = {Discret. Appl. Math.},
volume = {339},
pages = {172--177},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.06.022},
doi = {10.1016/J.DAM.2023.06.022},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/YangHY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/YangJLHZW23,
author = {Yu Yang and
Bang{-}Bang Jin and
Mei Lu and
Zhihao Hui and
Lu{-}Xuan Zhao and
Hua Wang},
title = {Computing the expected subtree number of random hexagonal and phenylene
chains based on probability matrices},
journal = {Discret. Appl. Math.},
volume = {339},
pages = {184--201},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.06.011},
doi = {10.1016/J.DAM.2023.06.011},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/YangJLHZW23.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-29 09:00 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:
