Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/dam/dam167.bht:"
@article{DBLP:journals/dam/AlfaroV14, author = {Carlos A. Alfaro and Carlos E. Valencia}, title = {Graphs with two trivial critical ideals}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {33--44}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.11.002}, doi = {10.1016/J.DAM.2013.11.002}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/AlfaroV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BuFLZ14, author = {Yuehua Bu and Stephen Finbow and Daphne Der{-}Fen Liu and Xuding Zhu}, title = {List backbone colouring of graphs}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {45--51}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.11.008}, doi = {10.1016/J.DAM.2013.11.008}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/BuFLZ14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/CamposKSS14, author = {Victor A. Campos and Sulamita Klein and Rudini Menezes Sampaio and Ana Silva}, title = {Fixed-parameter algorithms for the cocoloring problem}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {52--60}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.11.010}, doi = {10.1016/J.DAM.2013.11.010}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/CamposKSS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/ChangT14, author = {Ting{-}Pang Chang and Li{-}Da Tong}, title = {Choice identification of a graph}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {61--71}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.12.003}, doi = {10.1016/J.DAM.2013.12.003}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/ChangT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/DankelmannM14, author = {Peter Dankelmann and Simon Mukwembi}, title = {Upper bounds on the average eccentricity}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {72--79}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.11.023}, doi = {10.1016/J.DAM.2013.11.023}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/DankelmannM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/DettlaffLY14, author = {Magda Dettlaff and Magdalena Lemanska and Ismael Gonz{\'{a}}lez Yero}, title = {Bondage number of grid graphs}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {94--99}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.11.020}, doi = {10.1016/J.DAM.2013.11.020}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/DettlaffLY14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/EksteinHT14, author = {Jan Ekstein and Premysl Holub and Olivier Togni}, title = {The packing coloring of distance graphs D(k, t)}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {100--106}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.10.036}, doi = {10.1016/J.DAM.2013.10.036}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/EksteinHT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GolovachPS14, author = {Petr A. Golovach and Dani{\"{e}}l Paulusma and Jian Song}, title = {Coloring graphs without short cycles and long induced paths}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {107--120}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.12.008}, doi = {10.1016/J.DAM.2013.12.008}, timestamp = {Wed, 24 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/GolovachPS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Guinez14, author = {Flavio Gui{\~{n}}ez}, title = {A formulation of the wide partition conjecture using the atom problem in discrete tomography}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {121--130}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.11.022}, doi = {10.1016/J.DAM.2013.11.022}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Guinez14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GurvichO14, author = {Vladimir Gurvich and Vladimir Oudalov}, title = {On Nash-solvability in pure stationary strategies of the deterministic n-person games with perfect information and mean or total effective cost}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {131--143}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.10.025}, doi = {10.1016/J.DAM.2013.10.025}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/GurvichO14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/HeldtKU14, author = {Daniel Heldt and Kolja B. Knauer and Torsten Ueckerdt}, title = {Edge-intersection graphs of grid paths: The bend-number}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {144--162}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.10.035}, doi = {10.1016/J.DAM.2013.10.035}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/HeldtKU14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/HoradamN14, author = {Kathy J. Horadam and M. A. Nyblom}, title = {Distances between sets based on set commonality}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {310--314}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.10.037}, doi = {10.1016/J.DAM.2013.10.037}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/HoradamN14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/HsuHHT14, author = {Lih{-}Hsing Hsu and Tung{-}Yang Ho and Yen{-}Hsun Ho and Chey{-}Woei Tsay}, title = {Cycles in cube-connected cycles graphs}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {163--171}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.11.021}, doi = {10.1016/J.DAM.2013.11.021}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/HsuHHT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/HwangL14, author = {Hark{-}Chin Hwang and Kyungkuk Lim}, title = {Exact performance of {MULTIFIT} for nonsimultaneous machines}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {172--187}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.10.022}, doi = {10.1016/J.DAM.2013.10.022}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/HwangL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/KaradenizDY14, author = {Suat Karadeniz and Steven T. Dougherty and Bahattin Yildiz}, title = {Constructing formally self-dual codes over R\({}_{\mbox{k}}\)}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {188--196}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.11.017}, doi = {10.1016/J.DAM.2013.11.017}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/KaradenizDY14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/KlerkPS14, author = {Etienne de Klerk and Dmitrii V. Pasechnik and Gelasio Salazar}, title = {Book drawings of complete bipartite graphs}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {80--93}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.11.001}, doi = {10.1016/J.DAM.2013.11.001}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/KlerkPS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/KnorPS14, author = {Martin Knor and Primoz Potocnik and Riste Skrekovski}, title = {Relationship between the edge-Wiener index and the Gutman index of a graph}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {197--201}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.12.009}, doi = {10.1016/J.DAM.2013.12.009}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/KnorPS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/LeePJ14, author = {Tae{-}Eog Lee and Seong{-}Ho Park and Chihyun Jung}, title = {Steady state analysis of timed event graphs with time window constraints}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {202--216}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.12.006}, doi = {10.1016/J.DAM.2013.12.006}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/LeePJ14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/LiuL14, author = {Muhuo Liu and Bolian Liu}, title = {The second Zagreb indices of unicyclic graphs with given degree sequences}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {217--221}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.10.033}, doi = {10.1016/J.DAM.2013.10.033}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/LiuL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/MaxovaDPT14, author = {Jana Maxov{\'{a}} and Miroslava Dubcov{\'{a}} and Pavla Pavl{\'{\i}}kov{\'{a}} and Daniel Turz{\'{\i}}k}, title = {Which k-trees are cover-incomparability graphs?}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {222--227}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.11.019}, doi = {10.1016/J.DAM.2013.11.019}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/MaxovaDPT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Nussbaum14, author = {Yahav Nussbaum}, title = {Recognition of probe proper interval graphs}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {228--238}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.11.013}, doi = {10.1016/J.DAM.2013.11.013}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Nussbaum14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/OrdogBSJG14, author = {Rafael {\"{O}}rd{\"{o}}g and D{\'{a}}niel B{\'{a}}nky and Bal{\'{a}}zs Szerencsi and P{\'{e}}ter Juh{\'{a}}sz and Vince Grolmusz}, title = {The Erd{\H{o}}s webgraph server}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {315--317}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.10.032}, doi = {10.1016/J.DAM.2013.10.032}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/OrdogBSJG14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/PorschenSSW14, author = {Stefan Porschen and Tatjana Schmidt and Ewald Speckenmeyer and Andreas Wotzlaw}, title = {{XSAT} and {NAE-SAT} of linear {CNF} classes}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {1--14}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.10.030}, doi = {10.1016/J.DAM.2013.10.030}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/PorschenSSW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/ShalabyS14, author = {Nabil Shalaby and Daniela Silvesan}, title = {The intersection spectrum of hooked Skolem sequences and applications}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {239--260}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.10.029}, doi = {10.1016/J.DAM.2013.10.029}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/ShalabyS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/StephenY14, author = {Tamon Stephen and Timothy Yusun}, title = {Counting inequivalent monotone Boolean functions}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {15--24}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.11.015}, doi = {10.1016/J.DAM.2013.11.015}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/StephenY14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/SuXS14, author = {Guifu Su and Liming Xiong and Xiaofeng Su}, title = {Maximally edge-connected graphs and Zeroth-order general Randi{\'{c}} index for 0{\textless}{\(\alpha\)}{\textless}1}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {261--268}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.11.016}, doi = {10.1016/J.DAM.2013.11.016}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/SuXS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/SzkaliczkiEHS14, author = {Tibor Szkaliczki and Michael Eberhard and Hermann Hellwagner and L{\'{a}}szl{\'{o}} Szobonya}, title = {Piece selection algorithms for layered video streaming in {P2P} networks}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {269--279}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.11.007}, doi = {10.1016/J.DAM.2013.11.007}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/SzkaliczkiEHS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Togni14, author = {Olivier Togni}, title = {On packing colorings of distance graphs}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {280--289}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.10.026}, doi = {10.1016/J.DAM.2013.10.026}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Togni14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/WangT14, author = {Qichun Wang and Chik How Tan}, title = {Balanced Boolean functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearity}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {25--32}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.11.014}, doi = {10.1016/J.DAM.2013.11.014}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/WangT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/WangZ14, author = {Tao Wang and Yaqiong Zhang}, title = {Acyclic edge coloring of graphs}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {290--303}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.12.001}, doi = {10.1016/J.DAM.2013.12.001}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/WangZ14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/YangTLLG14, author = {Weihua Yang and Yingzhi Tian and Hengzhe Li and Hao Li and Xiaofeng Guo}, title = {The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree}, journal = {Discret. Appl. Math.}, volume = {167}, pages = {304--309}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.10.028}, doi = {10.1016/J.DAM.2013.10.028}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/YangTLLG14.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.