Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/dam/dam166.bht:"
@article{DBLP:journals/dam/AlrawafCHM14, author = {Saad Alrawaf and Igor Chikalov and Shahid Hussain and Mikhail Moshkov}, title = {Diagnosis of constant faults in iteration-free circuits over monotone basis}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {287--291}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.08.009}, doi = {10.1016/J.DAM.2013.08.009}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/AlrawafCHM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Amano14, author = {Kazuyuki Amano}, title = {Some improved bounds on communication complexity via new decomposition of cliques}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {249--254}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.09.015}, doi = {10.1016/J.DAM.2013.09.015}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Amano14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/AubryGT14, author = {Yves Aubry and Jean{-}Christophe Godin and Olivier Togni}, title = {Every triangle-free induced subgraph of the triangular lattice is (5m, 2m)-choosable}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {51--58}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.09.028}, doi = {10.1016/J.DAM.2013.09.028}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/AubryGT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/AvisIP14, author = {David Avis and Kazuo Iwama and Daichi Paku}, title = {Reputation games for undirected graphs}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {1--13}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.09.022}, doi = {10.1016/J.DAM.2013.09.022}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/AvisIP14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BianchiNT14, author = {Silvia M. Bianchi and Graciela L. Nasini and Paola B. Tolomei}, title = {Some advances on the set covering polyhedron of circulant matrices}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {59--70}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.10.005}, doi = {10.1016/J.DAM.2013.10.005}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/BianchiNT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BrownHH14, author = {Lindsey Brown and Hoang Ha and Jonathan K. Hodge}, title = {Single-peaked preferences over multidimensional binary alternatives}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {14--25}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.11.006}, doi = {10.1016/J.DAM.2013.11.006}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/BrownHH14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/ChuanL14, author = {Wai{-}Fong Chuan and Fang{-}Yi Liao}, title = {The D-representation of nonnegative integers and the Fibonacci factorization of suffixes of infinite Fibonacci words}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {71--83}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.09.027}, doi = {10.1016/J.DAM.2013.09.027}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/ChuanL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/DongWZ14, author = {Aijun Dong and Guanghui Wang and Jianghua Zhang}, title = {Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {84--90}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.10.009}, doi = {10.1016/J.DAM.2013.10.009}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/DongWZ14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/FederHS14, author = {Tom{\'{a}}s Feder and Pavol Hell and Oren Shklarsky}, title = {Matrix partitions of split graphs}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {91--96}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.10.016}, doi = {10.1016/J.DAM.2013.10.016}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/FederHS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/FischerFJKMG14, author = {Anja Fischer and Frank Fischer and Gerold J{\"{a}}ger and Jens Keilwagen and Paul Molitor and Ivo Grosse}, title = {Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {97--114}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.09.011}, doi = {10.1016/J.DAM.2013.09.011}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/FischerFJKMG14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/FujitaF14, author = {Shinya Fujita and Michitaka Furuya}, title = {Rainbow domination numbers on graphs with given radius}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {115--122}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.10.020}, doi = {10.1016/J.DAM.2013.10.020}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/FujitaF14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GoddardX14, author = {Wayne Goddard and Honghai Xu}, title = {A note on S-packing colorings of lattices}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {255--262}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.09.016}, doi = {10.1016/J.DAM.2013.09.016}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/GoddardX14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GolovachP14, author = {Petr A. Golovach and Dani{\"{e}}l Paulusma}, title = {List coloring in the absence of two subgraphs}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {123--130}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.10.010}, doi = {10.1016/J.DAM.2013.10.010}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/GolovachP14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/IimuraW14, author = {Takuya Iimura and Takahiro Watanabe}, title = {Existence of a pure strategy equilibrium in finite symmetric games where payoff functions are integrally concave}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {26--33}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.12.005}, doi = {10.1016/J.DAM.2013.12.005}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/IimuraW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/JanczewskiMM14, author = {Robert Janczewski and Anna Malafiejska and Michal Malafiejski}, title = {Interval incidence coloring of bipartite graphs}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {131--140}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.10.007}, doi = {10.1016/J.DAM.2013.10.007}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/JanczewskiMM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Jha14, author = {Pranava K. Jha}, title = {Dense bipartite circulants and their routing via rectangular twisted torus}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {141--158}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.09.021}, doi = {10.1016/J.DAM.2013.09.021}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Jha14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Khmelnitskaya14, author = {Anna B. Khmelnitskaya}, title = {Values for games with two-level communication structures}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {34--50}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.10.019}, doi = {10.1016/J.DAM.2013.10.019}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Khmelnitskaya14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Kiraly14, author = {Csaba Kir{\'{a}}ly}, title = {Algorithms for finding a rooted (k, 1)-edge-connected orientation}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {263--268}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.10.004}, doi = {10.1016/J.DAM.2013.10.004}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Kiraly14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/KlavzarN14, author = {Sandi Klavzar and Mohammad J. Nadjafi{-}Arani}, title = {Computing distance moments on graphs with transitive Djokovi{\'{c}}-Winkler relation}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {269--272}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.10.006}, doi = {10.1016/J.DAM.2013.10.006}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/KlavzarN14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/LiC14, author = {Bo{-}Jr Li and Gerard Jennhwa Chang}, title = {Dot product dimensions of graphs}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {159--163}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.10.014}, doi = {10.1016/J.DAM.2013.10.014}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/LiC14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/MikawaT14, author = {Kenji Mikawa and Ken Tanaka}, title = {Lexicographic ranking and unranking of derangements in cycle notation}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {164--169}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.10.001}, doi = {10.1016/J.DAM.2013.10.001}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/MikawaT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/OjimaSS14, author = {Chihoko Ojima and Akira Saito and Kazuki Sano}, title = {Precoloring extension involving pairs of vertices of small distance}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {170--177}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.10.012}, doi = {10.1016/J.DAM.2013.10.012}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/OjimaSS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/PattilloWB14, author = {Jeffrey Pattillo and Yiming Wang and Sergiy Butenko}, title = {Approximating 2-cliques in unit disk graphs}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {178--187}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.10.017}, doi = {10.1016/J.DAM.2013.10.017}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/PattilloWB14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/PuertoRS14, author = {Justo Puerto and Federica Ricca and Andrea Scozzari}, title = {Unreliable point facility location problems on networks}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {188--203}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.10.013}, doi = {10.1016/J.DAM.2013.10.013}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/PuertoRS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Rodriguez-VelazquezYL14, author = {Juan Alberto Rodr{\'{\i}}guez{-}Vel{\'{a}}zquez and Ismael Gonz{\'{a}}lez Yero and Magdalena Lemanska}, title = {On the partition dimension of trees}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {204--209}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.09.026}, doi = {10.1016/J.DAM.2013.09.026}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Rodriguez-VelazquezYL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/RosenfeldK14, author = {Vladimir R. Rosenfeld and Douglas J. Klein}, title = {An infinite family of graphs with a facile count of perfect matchings}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {210--214}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.09.010}, doi = {10.1016/J.DAM.2013.09.010}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/RosenfeldK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/ShirdelV14, author = {Gholam Hassan Shirdel and B. Vaez{-}Zadeh}, title = {A note on "Tenacity of a graph with maximum connectivity"}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {273--275}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.06.016}, doi = {10.1016/J.DAM.2013.06.016}, timestamp = {Wed, 23 Nov 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/ShirdelV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Stanic14, author = {Zoran Stanic}, title = {Further results on controllable graphs}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {215--221}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.10.011}, doi = {10.1016/J.DAM.2013.10.011}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Stanic14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/TangPZZ14, author = {Qingsong Tang and Yuejian Peng and Xiangde Zhang and Cheng Zhao}, title = {Some results on Lagrangians of hypergraphs}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {222--238}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.09.023}, doi = {10.1016/J.DAM.2013.09.023}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/TangPZZ14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/WangW14, author = {Long Wang and Dein Wong}, title = {Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {276--281}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.09.012}, doi = {10.1016/J.DAM.2013.09.012}, timestamp = {Tue, 26 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/WangW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/ZhangYY14, author = {Heping Zhang and Dewu Yang and Haiyuan Yao}, title = {Decomposition theorem on matchable distributive lattices}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {239--248}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.09.008}, doi = {10.1016/J.DAM.2013.09.008}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/ZhangYY14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/ZhuTZ14, author = {Qiang Zhu and Wenliang Tang and Cun{-}Quan Zhang}, title = {Perfect matching covering, the Berge-Fulkerson conjecture, and the Fan-Raspaud conjecture}, journal = {Discret. Appl. Math.}, volume = {166}, pages = {282--286}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2013.10.008}, doi = {10.1016/J.DAM.2013.10.008}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/ZhuTZ14.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.