Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/dam/dam267.bht:"
@article{DBLP:journals/dam/ArcherGM19, author = {Kassie Archer and Christina Graves and David Milan}, title = {Classes of uniformly most reliable graphs for all-terminal reliability}, journal = {Discret. Appl. Math.}, volume = {267}, pages = {12--29}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.04.022}, doi = {10.1016/J.DAM.2019.04.022}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/ArcherGM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BasteRS19, author = {Julien Baste and Dieter Rautenbach and Ignasi Sau}, title = {Approximating maximum uniquely restricted matchings in bipartite graphs}, journal = {Discret. Appl. Math.}, volume = {267}, pages = {30--40}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.04.024}, doi = {10.1016/J.DAM.2019.04.024}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/BasteRS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Benitez-Bobadilla19, author = {Germ{\'{a}}n Ben{\'{\i}}tez{-}Bobadilla and Hortensia Galeana{-}S{\'{a}}nchez and C{\'{e}}sar Hern{\'{a}}ndez{-}Cruz}, title = {Characterization of color patterns by dynamic H-paths}, journal = {Discret. Appl. Math.}, volume = {267}, pages = {41--51}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.04.020}, doi = {10.1016/J.DAM.2019.04.020}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/Benitez-Bobadilla19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BoyadzhiyskaIT19, author = {Simona Boyadzhiyska and Garth Isaak and Ann N. Trenk}, title = {Interval orders with two interval lengths}, journal = {Discret. Appl. Math.}, volume = {267}, pages = {52--63}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.06.021}, doi = {10.1016/J.DAM.2019.06.021}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/BoyadzhiyskaIT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/ChetryBM19, author = {Moon K. Chetry and Susil Kumar Bishoi and Vashek Matyas}, title = {When Lagged Fibonacci Generators jump}, journal = {Discret. Appl. Math.}, volume = {267}, pages = {64--72}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.06.022}, doi = {10.1016/J.DAM.2019.06.022}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/ChetryBM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Drgas-Burchardt19, author = {Ewa Drgas{-}Burchardt and Agata Drzystek}, title = {Improper sum-list colouring of 2-trees}, journal = {Discret. Appl. Math.}, volume = {267}, pages = {73--84}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.07.004}, doi = {10.1016/J.DAM.2019.07.004}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/Drgas-Burchardt19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/FengJW19, author = {Kai Feng and Zhangjian Ji and Wei Wei}, title = {Subnetwork reliability analysis in k-ary n-cubes}, journal = {Discret. Appl. Math.}, volume = {267}, pages = {85--92}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.07.003}, doi = {10.1016/J.DAM.2019.07.003}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/FengJW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GrijoLOPT19, author = {Rodrigo Grij{\'{o}} and Leonardo Silva de Lima and Carla Silva Oliveira and Guilherme Porto and Vilmar Trevisan}, title = {Nordhaus-Gaddum type inequalities for the two largest Laplacian eigenvalues}, journal = {Discret. Appl. Math.}, volume = {267}, pages = {176--183}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.04.005}, doi = {10.1016/J.DAM.2019.04.005}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/GrijoLOPT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GroenlandORSSS19, author = {Carla Groenland and Karolina Okrasa and Pawel Rzazewski and Alex D. Scott and Paul D. Seymour and Sophie Spirkl}, title = {H-colouring Pt-free graphs in subexponential time}, journal = {Discret. Appl. Math.}, volume = {267}, pages = {184--189}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.04.010}, doi = {10.1016/J.DAM.2019.04.010}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/GroenlandORSSS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Hellmuth19, author = {Marc Hellmuth}, title = {Generalized Fitch graphs: Edge-labeled graphs that are explained by edge-labeled trees}, journal = {Discret. Appl. Math.}, volume = {267}, pages = {1--11}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.06.015}, doi = {10.1016/J.DAM.2019.06.015}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Hellmuth19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/HongL19, author = {Jin Hong and Hyeonmi Lee}, title = {Solving discrete logarithm problems faster with the aid of pre-computation}, journal = {Discret. Appl. Math.}, volume = {267}, pages = {93--119}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.03.023}, doi = {10.1016/J.DAM.2019.03.023}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/HongL19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/LavorSCL19, author = {Carlile Lavor and Michael Souza and Luiz Mariano Carvalho and Leo Liberti}, title = {On the polynomiality of finding {KDMDGP} re-orders}, journal = {Discret. Appl. Math.}, volume = {267}, pages = {190--194}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.07.021}, doi = {10.1016/J.DAM.2019.07.021}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/LavorSCL19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/LiangRX19, author = {Meilian Liang and Stanislaw P. Radziszowski and Xiaodong Xu}, title = {On a Diagonal Conjecture for classical Ramsey numbers}, journal = {Discret. Appl. Math.}, volume = {267}, pages = {195--200}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.07.006}, doi = {10.1016/J.DAM.2019.07.006}, timestamp = {Sun, 22 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/LiangRX19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/LiuHWW19, author = {Juan Liu and Xiaoxue Hu and Weifan Wang and Yiqiao Wang}, title = {Light structures in 1-planar graphs with an application to linear 2-arboricity}, journal = {Discret. Appl. Math.}, volume = {267}, pages = {120--130}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.05.001}, doi = {10.1016/J.DAM.2019.05.001}, timestamp = {Mon, 27 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/LiuHWW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/MyskovaP19, author = {Helena Myskov{\'{a}} and J{\'{a}}n Pl{\'{a}}vka}, title = {{XAE} and {XEA} robustness of max-min matrices}, journal = {Discret. Appl. Math.}, volume = {267}, pages = {142--150}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.04.021}, doi = {10.1016/J.DAM.2019.04.021}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/MyskovaP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Nicgorska-Miskiewicz19, author = {Angelika Nicgorska{-}Miskiewicz and Michal Tuczynski}, title = {On the hydra number of disconnected graphs}, journal = {Discret. Appl. Math.}, volume = {267}, pages = {201--208}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.04.015}, doi = {10.1016/J.DAM.2019.04.015}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Nicgorska-Miskiewicz19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/OuyangDT19, author = {Zhangdong Ouyang and Fengming Dong and Eng Guan Tay}, title = {On the skewness of Cartesian products with trees}, journal = {Discret. Appl. Math.}, volume = {267}, pages = {131--141}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.05.014}, doi = {10.1016/J.DAM.2019.05.014}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/OuyangDT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Pyaderkin19, author = {M. M. Pyaderkin}, title = {On the chromatic number of random subgraphs of a certain distance graph}, journal = {Discret. Appl. Math.}, volume = {267}, pages = {209--214}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.07.002}, doi = {10.1016/J.DAM.2019.07.002}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Pyaderkin19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/RaczekC19, author = {Joanna Raczek and Joanna Cyman}, title = {Weakly connected Roman domination in graphs}, journal = {Discret. Appl. Math.}, volume = {267}, pages = {151--159}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.05.002}, doi = {10.1016/J.DAM.2019.05.002}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/RaczekC19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Richard19, author = {Adrien Richard}, title = {Nilpotent dynamics on signed interaction graphs and weak converses of Thomas' rules}, journal = {Discret. Appl. Math.}, volume = {267}, pages = {160--175}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.04.025}, doi = {10.1016/J.DAM.2019.04.025}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Richard19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/TokunagaJK19, author = {Shin{-}ichi Tokunaga and Thiradet Jiarasuksakun and Pawaton Kaemawichanurat}, title = {Isolation number of maximal outerplanar graphs}, journal = {Discret. Appl. Math.}, volume = {267}, pages = {215--218}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.06.011}, doi = {10.1016/J.DAM.2019.06.011}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/TokunagaJK19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Tomescu19, author = {Ioan Tomescu}, title = {Proof of a conjecture concerning maximum general sum-connectivity index {\(\chi\)}{\(\alpha\)} of graphs with given cyclomatic number when 1{\(\alpha\)}2}, journal = {Discret. Appl. Math.}, volume = {267}, pages = {219--223}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.07.007}, doi = {10.1016/J.DAM.2019.07.007}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Tomescu19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Yang19, author = {Donglei Yang}, title = {A note on antimagic orientations of even regular graphs}, journal = {Discret. Appl. Math.}, volume = {267}, pages = {224--228}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.04.017}, doi = {10.1016/J.DAM.2019.04.017}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/Yang19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.