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/dam291.bht:"
download as .bib file
@article{DBLP:journals/dam/AlvesCB21,
author = {Jesmmer Alves and
Diane Castonguay and
Thomas Br{\"{u}}stle},
title = {Unit form recognition by mutations: Application of mutations in the
search of positive roots},
journal = {Discret. Appl. Math.},
volume = {291},
pages = {223--236},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.12.008},
doi = {10.1016/J.DAM.2020.12.008},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/AlvesCB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BaganJK21,
author = {Guillaume Bagan and
Alice Joffard and
Hamamache Kheddouci},
title = {Eternal dominating sets on digraphs and orientations of graphs},
journal = {Discret. Appl. Math.},
volume = {291},
pages = {99--115},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.10.024},
doi = {10.1016/J.DAM.2020.10.024},
timestamp = {Tue, 23 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BaganJK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BarbatoB21,
author = {Michele Barbato and
Dario Bezzi},
title = {Monopolar graphs: Complexity of computing classical graph parameters},
journal = {Discret. Appl. Math.},
volume = {291},
pages = {277--285},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.12.023},
doi = {10.1016/J.DAM.2020.12.023},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BarbatoB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChangCJKL21,
author = {Fei{-}Huang Chang and
Ma{-}Lian Chia and
Shih{-}Ang Jiang and
David Kuo and
Sheng{-}Chyang Liaw},
title = {L(p, q)-labelings of subdivisions of graphs},
journal = {Discret. Appl. Math.},
volume = {291},
pages = {264--270},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.12.019},
doi = {10.1016/J.DAM.2020.12.019},
timestamp = {Tue, 23 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChangCJKL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChoiKN21,
author = {Ho{-}Won Choi and
Hyoungjun Kim and
Sungjong No},
title = {The minor minimal intrinsically chiral graphs},
journal = {Discret. Appl. Math.},
volume = {291},
pages = {237--245},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.12.009},
doi = {10.1016/J.DAM.2020.12.009},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/ChoiKN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DaillyHV21,
author = {Antoine Dailly and
Adriana Hansberg and
Denae Ventura},
title = {On the balanceability of some graph classes},
journal = {Discret. Appl. Math.},
volume = {291},
pages = {51--63},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.12.005},
doi = {10.1016/J.DAM.2020.12.005},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/DaillyHV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DucoffeP21,
author = {Guillaume Ducoffe and
Alexandru Popa},
title = {The use of a pruned modular decomposition for Maximum Matching algorithms
on some graph classes},
journal = {Discret. Appl. Math.},
volume = {291},
pages = {201--222},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.12.018},
doi = {10.1016/J.DAM.2020.12.018},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/DucoffeP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FabriciHR21,
author = {Igor Fabrici and
Mirko Horn{\'{a}}k and
Simona Rindosov{\'{a}}},
title = {Facial unique-maximum edge and total coloring of plane graphs},
journal = {Discret. Appl. Math.},
volume = {291},
pages = {171--179},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.09.016},
doi = {10.1016/J.DAM.2020.09.016},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/FabriciHR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FanFGMS21,
author = {Jinping Fan and
Hung{-}Lin Fu and
Yujie Gu and
Ying Miao and
Maiko Shigeno},
title = {Strongly separable matrices for nonadaptive combinatorial group testing},
journal = {Discret. Appl. Math.},
volume = {291},
pages = {180--187},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.11.022},
doi = {10.1016/J.DAM.2020.11.022},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FanFGMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FangGLX21,
author = {Chunqiu Fang and
Ervin Gy{\"{o}}ri and
Mei Lu and
Jimeng Xiao},
title = {On the anti-Ramsey number of forests},
journal = {Discret. Appl. Math.},
volume = {291},
pages = {129--142},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.08.027},
doi = {10.1016/J.DAM.2020.08.027},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/FangGLX21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FangZW21,
author = {Longfei Fang and
Mingqing Zhai and
Bing Wang},
title = {Complete subgraphs in connected graphs and its application to spectral
moment},
journal = {Discret. Appl. Math.},
volume = {291},
pages = {36--42},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.11.023},
doi = {10.1016/J.DAM.2020.11.023},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/FangZW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GaoG21,
author = {Pu Gao and
Catherine S. Greenhill},
title = {Mixing time of the switch Markov chain and stable degree sequences},
journal = {Discret. Appl. Math.},
volume = {291},
pages = {143--162},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.12.004},
doi = {10.1016/J.DAM.2020.12.004},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/GaoG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GaulS21,
author = {Daniela Gaul and
Daniel R. Schmidt},
title = {Chv{\'{a}}tal-Gomory cuts for the Steiner tree problem},
journal = {Discret. Appl. Math.},
volume = {291},
pages = {188--200},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.12.016},
doi = {10.1016/J.DAM.2020.12.016},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/GaulS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HuqKMPS21,
author = {Reaz Huq and
Bogumil Kaminski and
Atefeh Mashatan and
Pawel Pralat and
Przemyslaw Szufel},
title = {On broadcasting time in the model of travelling agents},
journal = {Discret. Appl. Math.},
volume = {291},
pages = {246--263},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.12.022},
doi = {10.1016/J.DAM.2020.12.022},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/HuqKMPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KrithikaRST21,
author = {R. Krithika and
Ashutosh Rai and
Saket Saurabh and
Prafullkumar Tale},
title = {Parameterized and exact algorithms for class domination coloring},
journal = {Discret. Appl. Math.},
volume = {291},
pages = {286--299},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.12.015},
doi = {10.1016/J.DAM.2020.12.015},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/KrithikaRST21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LvL21,
author = {Zequn Lv and
Mei Lu},
title = {The terminal-pairability problem in complete bipartite graphs},
journal = {Discret. Appl. Math.},
volume = {291},
pages = {64--67},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.12.003},
doi = {10.1016/J.DAM.2020.12.003},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/LvL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/PandaP21,
author = {B. S. Panda and
Priyamvada},
title = {Injective coloring of some subclasses of bipartite graphs and chordal
graphs},
journal = {Discret. Appl. Math.},
volume = {291},
pages = {68--87},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.12.006},
doi = {10.1016/J.DAM.2020.12.006},
timestamp = {Wed, 09 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/PandaP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/PotocnikVW21,
author = {Primoz Potocnik and
Gabriel Verret and
Stephen E. Wilson},
title = {Base graph-connection graph: Dissection and construction},
journal = {Discret. Appl. Math.},
volume = {291},
pages = {116--128},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.10.028},
doi = {10.1016/J.DAM.2020.10.028},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/PotocnikVW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Rosenberg21,
author = {Noah A. Rosenberg},
title = {On the Colijn-Plazzotta numbering scheme for unlabeled binary rooted
trees},
journal = {Discret. Appl. Math.},
volume = {291},
pages = {88--98},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.11.021},
doi = {10.1016/J.DAM.2020.11.021},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/Rosenberg21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Segal-Halevi21,
author = {Erel Segal{-}Halevi},
title = {Fair multi-cake cutting},
journal = {Discret. Appl. Math.},
volume = {291},
pages = {15--35},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.10.011},
doi = {10.1016/J.DAM.2020.10.011},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/Segal-Halevi21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/SongYZ21,
author = {Zi{-}Xia Song and
Donglei Yang and
Fangfang Zhang},
title = {Antimagic orientations of graphs with given independence number},
journal = {Discret. Appl. Math.},
volume = {291},
pages = {163--170},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.12.017},
doi = {10.1016/J.DAM.2020.12.017},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/SongYZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/TangZCZ21,
author = {Lang Tang and
Shenglin Zhou and
Jing Chen and
Zhilin Zhang},
title = {Metric dimension and metric independence number of incidence graphs
of symmetric designs},
journal = {Discret. Appl. Math.},
volume = {291},
pages = {43--50},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.12.001},
doi = {10.1016/J.DAM.2020.12.001},
timestamp = {Tue, 23 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/TangZCZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Tsur21,
author = {Dekel Tsur},
title = {An O{\({_\ast}\)}(2.619k) algorithm for 4-Path Vertex Cover},
journal = {Discret. Appl. Math.},
volume = {291},
pages = {1--14},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.11.019},
doi = {10.1016/J.DAM.2020.11.019},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/Tsur21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/XiaoWF21,
author = {Han Xiao and
Yuanxi Wang and
Qizhi Fang},
title = {On the convexity of independent set games},
journal = {Discret. Appl. Math.},
volume = {291},
pages = {271--276},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.09.025},
doi = {10.1016/J.DAM.2020.09.025},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/XiaoWF21.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-06-07 11: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:
