Search dblp for Publications

export results for "toc:db/journals/dam/dam231.bht:"

 download as .bib file

@article{DBLP:journals/dam/Alvarez-RuizMSV17,
  author       = {M. P. {\'{A}}lvarez{-}Ruiz and
                  T. Mediavilla{-}Gradolph and
                  Seyed Mahmoud Sheikholeslami and
                  Juan Carlos Valenzuela Tripodoro and
                  Ismael Gonz{\'{a}}lez Yero},
  title        = {On the strong Roman domination number of graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {231},
  pages        = {44--59},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2016.12.013},
  doi          = {10.1016/J.DAM.2016.12.013},
  timestamp    = {Tue, 29 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Alvarez-RuizMSV17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Araujo-PardoR17,
  author       = {Gabriela Araujo{-}Pardo and
                  Christian Rubio{-}Montiel},
  title        = {Pseudoachromatic and connected-pseudoachromatic indices of the complete
                  graph},
  journal      = {Discret. Appl. Math.},
  volume       = {231},
  pages        = {60--66},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2017.03.019},
  doi          = {10.1016/J.DAM.2017.03.019},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Araujo-PardoR17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/BishnuGP17,
  author       = {Arijit Bishnu and
                  Arijit Ghosh and
                  Subhabrata Paul},
  title        = {Linear kernels for k-tuple and liar's domination in bounded genus
                  graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {231},
  pages        = {67--77},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2016.06.008},
  doi          = {10.1016/J.DAM.2016.06.008},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/BishnuGP17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/BonnetS17,
  author       = {{\'{E}}douard Bonnet and
                  Florian Sikora},
  title        = {The Graph Motif problem parameterized by the structure of the input
                  graph},
  journal      = {Discret. Appl. Math.},
  volume       = {231},
  pages        = {78--94},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2016.11.016},
  doi          = {10.1016/J.DAM.2016.11.016},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/BonnetS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Bonsma17,
  author       = {Paul S. Bonsma},
  title        = {Rerouting shortest paths in planar graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {231},
  pages        = {95--112},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2016.05.024},
  doi          = {10.1016/J.DAM.2016.05.024},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Bonsma17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Brause17,
  author       = {Christoph Brause},
  title        = {A subexponential-time algorithm for the Maximum Independent Set Problem
                  in Pt-free graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {231},
  pages        = {113--118},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2016.06.016},
  doi          = {10.1016/J.DAM.2016.06.016},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Brause17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/BresarHKMPPT17,
  author       = {Bostjan Bresar and
                  Pinar Heggernes and
                  Marcin Jakub Kaminski and
                  Martin Milanic and
                  Dani{\"{e}}l Paulusma and
                  Primoz Potocnik and
                  Nicolas Trotignon},
  title        = {Preface: Algorithmic Graph Theory on the Adriatic Coast},
  journal      = {Discret. Appl. Math.},
  volume       = {231},
  pages        = {1--3},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2017.05.007},
  doi          = {10.1016/J.DAM.2017.05.007},
  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/BresarHKMPPT17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/BrodnikG17,
  author       = {Andrej Brodnik and
                  Marko Grgurovic},
  title        = {Solving all-pairs shortest path by single-source computations: Theory
                  and practice},
  journal      = {Discret. Appl. Math.},
  volume       = {231},
  pages        = {119--130},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2017.03.008},
  doi          = {10.1016/J.DAM.2017.03.008},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/BrodnikG17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/BujtasT17,
  author       = {Csilla Bujt{\'{a}}s and
                  Zsolt Tuza},
  title        = {{F-WORM} colorings: Results for 2-connected graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {231},
  pages        = {131--138},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2017.05.008},
  doi          = {10.1016/J.DAM.2017.05.008},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/BujtasT17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/DarmannPS17a,
  author       = {Andreas Darmann and
                  Ulrich Pferschy and
                  Joachim Schauer},
  title        = {The shortest connection game},
  journal      = {Discret. Appl. Math.},
  volume       = {231},
  pages        = {139--154},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2017.01.024},
  doi          = {10.1016/J.DAM.2017.01.024},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/DarmannPS17a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/DehghanS17,
  author       = {Ali Dehghan and
                  Mohammad{-}Reza Sadeghi},
  title        = {Colorful edge decomposition of graphs: Some polynomial cases},
  journal      = {Discret. Appl. Math.},
  volume       = {231},
  pages        = {155--165},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2016.10.019},
  doi          = {10.1016/J.DAM.2016.10.019},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/DehghanS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/FraserHHHL17,
  author       = {Dallas J. Fraser and
                  Ang{\`{e}}le M. Hamel and
                  Ch{\'{\i}}nh T. Ho{\`{a}}ng and
                  Kevin Holmes and
                  Tom P. LaMantia},
  title        = {Characterizations of (4K1, C4, C5)-free graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {231},
  pages        = {166--174},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2016.08.016},
  doi          = {10.1016/J.DAM.2016.08.016},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/FraserHHHL17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/JardenLM17,
  author       = {Adi Jarden and
                  Vadim E. Levit and
                  Eugen Mandrescu},
  title        = {Two more characterizations of K{\"{o}}nig-Egerv{\'{a}}ry
                  graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {231},
  pages        = {175--180},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2016.05.012},
  doi          = {10.1016/J.DAM.2016.05.012},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/JardenLM17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/LeP17a,
  author       = {Van Bang Le and
                  Sheng{-}Lung Peng},
  title        = {Good characterizations and linear time recognition for 2-probe block
                  graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {231},
  pages        = {181--189},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2016.11.015},
  doi          = {10.1016/J.DAM.2016.11.015},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/LeP17a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/LopezPP17,
  author       = {Nacho L{\'{o}}pez and
                  Hebert P{\'{e}}rez{-}Ros{\'{e}}s and
                  Jordi Pujol{\`{a}}s},
  title        = {The Degree/Diameter Problem for mixed abelian Cayley graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {231},
  pages        = {190--197},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2017.04.018},
  doi          = {10.1016/J.DAM.2017.04.018},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/LopezPP17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Lozin17,
  author       = {Vadim V. Lozin},
  title        = {From matchings to independent sets},
  journal      = {Discret. Appl. Math.},
  volume       = {231},
  pages        = {4--14},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2016.04.012},
  doi          = {10.1016/J.DAM.2016.04.012},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Lozin17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/MaffrayP17,
  author       = {Fr{\'{e}}d{\'{e}}ric Maffray and
                  Lucas Pastor},
  title        = {4-coloring (P6, bull)-free graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {231},
  pages        = {198--210},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2016.03.011},
  doi          = {10.1016/J.DAM.2016.03.011},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/MaffrayP17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Oum17,
  author       = {Sang{-}il Oum},
  title        = {Rank-width: Algorithmic and structural results},
  journal      = {Discret. Appl. Math.},
  volume       = {231},
  pages        = {15--24},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2016.08.006},
  doi          = {10.1016/J.DAM.2016.08.006},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Oum17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Pilipczuk17,
  author       = {Marcin Pilipczuk},
  title        = {A tight lower bound for Vertex Planarization on graphs of bounded
                  treewidth},
  journal      = {Discret. Appl. Math.},
  volume       = {231},
  pages        = {211--216},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2016.05.019},
  doi          = {10.1016/J.DAM.2016.05.019},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Pilipczuk17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/RaymondT17,
  author       = {Jean{-}Florent Raymond and
                  Dimitrios M. Thilikos},
  title        = {Recent techniques and results on the Erd{\H{o}}s-P{\'{o}}sa property},
  journal      = {Discret. Appl. Math.},
  volume       = {231},
  pages        = {25--43},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2016.12.025},
  doi          = {10.1016/J.DAM.2016.12.025},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/RaymondT17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Vesel17,
  author       = {Aleksander Vesel},
  title        = {Regular coronoids and 4-tilings},
  journal      = {Discret. Appl. Math.},
  volume       = {231},
  pages        = {217--227},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2016.07.022},
  doi          = {10.1016/J.DAM.2016.07.022},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Vesel17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/WeilS17,
  author       = {Vera Weil and
                  Oliver Schaudt},
  title        = {On bounding the difference between the maximum degree and the chromatic
                  number by a constant},
  journal      = {Discret. Appl. Math.},
  volume       = {231},
  pages        = {228--234},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2016.11.018},
  doi          = {10.1016/J.DAM.2016.11.018},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/WeilS17.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.