Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/dam/dam225.bht:"
@article{DBLP:journals/dam/AndoIS17, author = {Kazutoshi Ando and Ryosuke Inagaki and Kazuya Shoji}, title = {Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions}, journal = {Discret. Appl. Math.}, volume = {225}, pages = {1--10}, year = {2017}, url = {https://doi.org/10.1016/j.dam.2017.03.007}, doi = {10.1016/J.DAM.2017.03.007}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/AndoIS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BoyerHL17, author = {Kirk Boyer and Paul Horn and Mario Alberto L{\'{o}}pez}, title = {On the barrier graph of an arrangement of ray sensors}, journal = {Discret. Appl. Math.}, volume = {225}, pages = {11--21}, year = {2017}, url = {https://doi.org/10.1016/j.dam.2017.03.002}, doi = {10.1016/J.DAM.2017.03.002}, timestamp = {Wed, 06 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/BoyerHL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/CarballosaRST17, author = {Walter Carballosa and Jos{\'{e}} M. Rodr{\'{\i}}guez and Jos{\'{e}} Mar{\'{\i}}a Sigarreta and Yadira Torres{-}Nu{\~{n}}ez}, title = {Alliance polynomial of regular graphs}, journal = {Discret. Appl. Math.}, volume = {225}, pages = {22--32}, year = {2017}, url = {https://doi.org/10.1016/j.dam.2017.03.016}, doi = {10.1016/J.DAM.2017.03.016}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/CarballosaRST17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/DebskiLR17, author = {Michal Debski and Zbigniew Lonc and Pawel Rzazewski}, title = {Sequences of radius k for complete bipartite graphs}, journal = {Discret. Appl. Math.}, volume = {225}, pages = {51--63}, year = {2017}, url = {https://doi.org/10.1016/j.dam.2017.03.017}, doi = {10.1016/J.DAM.2017.03.017}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/DebskiLR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/DiemunschGKLNNS17, author = {Jennifer Diemunsch and Nathan Graber and Lucas Kramer and Victor Larsen and Lauren M. Nelsen and Luke L. Nelsen and Devon Sigler and Derrick Stolee and Charlie Suer}, title = {Color-blind index in graphs of very low degree}, journal = {Discret. Appl. Math.}, volume = {225}, pages = {122--129}, year = {2017}, url = {https://doi.org/10.1016/j.dam.2017.03.006}, doi = {10.1016/J.DAM.2017.03.006}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/DiemunschGKLNNS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/FitzpatrickL17, author = {Shannon L. Fitzpatrick and John Paul Larkin}, title = {The game of Cops and Robber on circulant graphs}, journal = {Discret. Appl. Math.}, volume = {225}, pages = {64--73}, year = {2017}, url = {https://doi.org/10.1016/j.dam.2017.03.004}, doi = {10.1016/J.DAM.2017.03.004}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/FitzpatrickL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/FrancisR17, author = {P. Francis and S. Francis Raj}, title = {On b-coloring of powers of hypercubes}, journal = {Discret. Appl. Math.}, volume = {225}, pages = {74--86}, year = {2017}, url = {https://doi.org/10.1016/j.dam.2017.03.005}, doi = {10.1016/J.DAM.2017.03.005}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/FrancisR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GorznyH17, author = {Jan Gorzny and Jing Huang}, title = {End-vertices of {LBFS} of (AT-free) bigraphs}, journal = {Discret. Appl. Math.}, volume = {225}, pages = {87--94}, year = {2017}, url = {https://doi.org/10.1016/j.dam.2017.02.027}, doi = {10.1016/J.DAM.2017.02.027}, timestamp = {Sun, 30 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/GorznyH17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/JesusK17a, author = {Jos{\'{e}} F. De Jes{\'{u}}s and Alexander K. Kelmans}, title = {k-circular matroids of graphs}, journal = {Discret. Appl. Math.}, volume = {225}, pages = {33--50}, year = {2017}, url = {https://doi.org/10.1016/j.dam.2017.02.026}, doi = {10.1016/J.DAM.2017.02.026}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/JesusK17a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/MakinenSTVW17, author = {Veli M{\"{a}}kinen and Valeria Staneva and Alexandru I. Tomescu and Daniel Valenzuela and Sebastian Wilzbach}, title = {Interval scheduling maximizing minimum coverage}, journal = {Discret. Appl. Math.}, volume = {225}, pages = {130--135}, year = {2017}, url = {https://doi.org/10.1016/j.dam.2016.08.021}, doi = {10.1016/J.DAM.2016.08.021}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/MakinenSTVW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/MartinRCM17, author = {Barnaby Martin and Franco Raimondi and Taolue Chen and Jos Martin}, title = {The packing chromatic number of the infinite square lattice is between 13 and 15}, journal = {Discret. Appl. Math.}, volume = {225}, pages = {136--142}, year = {2017}, url = {https://doi.org/10.1016/j.dam.2017.03.013}, doi = {10.1016/J.DAM.2017.03.013}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/MartinRCM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Riedl17, author = {Wolfgang F. Riedl}, title = {A complete characterization of jump inequalities for the hop-constrained shortest path problem}, journal = {Discret. Appl. Math.}, volume = {225}, pages = {95--113}, year = {2017}, url = {https://doi.org/10.1016/j.dam.2017.03.010}, doi = {10.1016/J.DAM.2017.03.010}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Riedl17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/WuP17, author = {Biao Wu and Yuejian Peng}, title = {The connection between polynomial optimization, maximum cliques and Tur{\'{a}}n densities}, journal = {Discret. Appl. Math.}, volume = {225}, pages = {114--121}, year = {2017}, url = {https://doi.org/10.1016/j.dam.2017.03.014}, doi = {10.1016/J.DAM.2017.03.014}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/WuP17.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.