default search action
Search dblp for Publications
export results for "toc:db/journals/dam/dam281.bht:"
@article{DBLP:journals/dam/AlconPR20, author = {Liliana Alc{\'{o}}n and Miguel A. Piza{\~{n}}a and Gabriela Ravenna}, title = {Two infinite families of critical clique-Helly graphs}, journal = {Discret. Appl. Math.}, volume = {281}, pages = {2--5}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2019.06.025}, doi = {10.1016/J.DAM.2019.06.025}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/AlconPR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/ArgiroffoBLW20, author = {Gabriela R. Argiroffo and Silvia M. Bianchi and Yanina Lucarini and Annegret Katrin Wagler}, title = {Linear-time algorithms for three domination-based separation problems in block graphs}, journal = {Discret. Appl. Math.}, volume = {281}, pages = {6--41}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2019.08.001}, doi = {10.1016/J.DAM.2019.08.001}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/ArgiroffoBLW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BassinoBPV20, author = {Fr{\'{e}}d{\'{e}}rique Bassino and Flavia Bonomo{-}Braberman and Lionel Pournin and Mario Valencia{-}Pabon}, title = {Preface: {LAGOS} 2017 - {IX} Latin and American Algorithms, Graphs and Optimization Symposium, {C.I.R.M.} - Marseille, France, 2017}, journal = {Discret. Appl. Math.}, volume = {281}, pages = {1}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2020.05.009}, doi = {10.1016/J.DAM.2020.05.009}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/BassinoBPV20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Bonomo-Braberman20, author = {Flavia Bonomo{-}Braberman and Guillermo Dur{\'{a}}n and Mart{\'{\i}}n D. Safe and Annegret Katrin Wagler}, title = {On some graph classes related to perfect graphs: {A} survey}, journal = {Discret. Appl. Math.}, volume = {281}, pages = {42--60}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2019.05.019}, doi = {10.1016/J.DAM.2019.05.019}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/Bonomo-Braberman20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BornsteinPRS20, author = {Claudson F. Bornstein and Jos{\'{e}} Wilson Coura Pinto and Dieter Rautenbach and Jayme Luiz Szwarcfiter}, title = {Constant threshold intersection graphs of orthodox paths in trees}, journal = {Discret. Appl. Math.}, volume = {281}, pages = {61--68}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2018.09.029}, doi = {10.1016/J.DAM.2018.09.029}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/BornsteinPRS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BragaDEMUV20, author = {M{\'{o}}nica Braga and Diego Delle Donne and Mariana S. Escalante and Javier Marenco and Mar{\'{\i}}a Elisa Ugarte and Mar{\'{\i}}a del Carmen Varaldo}, title = {The minimum chromatic violation problem: {A} polyhedral approach}, journal = {Discret. Appl. Math.}, volume = {281}, pages = {69--80}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2019.05.010}, doi = {10.1016/J.DAM.2019.05.010}, timestamp = {Mon, 03 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/BragaDEMUV20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BrandstadtM20a, author = {Andreas Brandst{\"{a}}dt and Raffaele Mosca}, title = {On efficient domination for some classes of H-free chordal graphs}, journal = {Discret. Appl. Math.}, volume = {281}, pages = {81--95}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2019.04.029}, doi = {10.1016/J.DAM.2019.04.029}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/BrandstadtM20a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Caria20, author = {Pablo De Caria}, title = {Neighborhood inclusion posets and tree representations for chordal and dually chordal graphs}, journal = {Discret. Appl. Math.}, volume = {281}, pages = {151--161}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2019.05.009}, doi = {10.1016/J.DAM.2019.05.009}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/Caria20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/CerioliL20, author = {M{\'{a}}rcia R. Cerioli and Paloma T. Lima}, title = {Intersection of longest paths in graph classes}, journal = {Discret. Appl. Math.}, volume = {281}, pages = {96--105}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2019.03.022}, doi = {10.1016/J.DAM.2019.03.022}, timestamp = {Sun, 06 Oct 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/CerioliL20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/ChadderD20, author = {Nathan Chadder and Antoine Deza}, title = {Computational determination of the largest lattice polytope diameter}, journal = {Discret. Appl. Math.}, volume = {281}, pages = {106--110}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2019.10.026}, doi = {10.1016/J.DAM.2019.10.026}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/ChadderD20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Contreras-Mendoza20, author = {Fernando Esteban Contreras{-}Mendoza and C{\'{e}}sar Hern{\'{a}}ndez{-}Cruz}, title = {Minimal obstructions to (s, 1)-polarity in cographs}, journal = {Discret. Appl. Math.}, volume = {281}, pages = {111--117}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2018.11.028}, doi = {10.1016/J.DAM.2018.11.028}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/Contreras-Mendoza20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/CoutoFGKS20, author = {Fernanda Couto and Lu{\'{e}}rbio Faria and Sylvain Gravier and Sulamita Klein and Vin{\'{\i}}cius Fernandes dos Santos}, title = {Characterizations, probe and sandwich problems on (k, {\(\mathscr{l}\)})-cographs}, journal = {Discret. Appl. Math.}, volume = {281}, pages = {118--133}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2020.04.002}, doi = {10.1016/J.DAM.2020.04.002}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/CoutoFGKS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/CruzGGP20, author = {Edmilson Pereira da Cruz and Marina Groshaus and Andr{\'{e}} Luiz Pires Guedes and Juan Pablo Puppo}, title = {Biclique graphs of interval bigraphs}, journal = {Discret. Appl. Math.}, volume = {281}, pages = {134--143}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2020.02.010}, doi = {10.1016/J.DAM.2020.02.010}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/CruzGGP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/DantasMT20, author = {Simone Dantas and Rodrigo Marinho and Slobodan Tanushevski}, title = {The Solitaire Clobber game and correducibility of graphs}, journal = {Discret. Appl. Math.}, volume = {281}, pages = {144--150}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2019.06.023}, doi = {10.1016/J.DAM.2019.06.023}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/DantasMT20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Del-VecchioVP20, author = {Renata R. Del{-}Vecchio and Cybele T. M. Vinagre and Guilherme B. Pereira}, title = {On hyper-Hamiltonicity in graphs}, journal = {Discret. Appl. Math.}, volume = {281}, pages = {195--202}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2019.08.023}, doi = {10.1016/J.DAM.2019.08.023}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/Del-VecchioVP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/DucoffeMP20, author = {Guillaume Ducoffe and Ruxandra Marinescu{-}Ghemeci and Alexandru Popa}, title = {On the (di)graphs with (directed) proper connection number two}, journal = {Discret. Appl. Math.}, volume = {281}, pages = {203--215}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2019.06.024}, doi = {10.1016/J.DAM.2019.06.024}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/DucoffeMP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/EhardR20, author = {Stefan Ehard and Dieter Rautenbach}, title = {Approximating connected safe sets in weighted trees}, journal = {Discret. Appl. Math.}, volume = {281}, pages = {216--223}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2019.11.017}, doi = {10.1016/J.DAM.2019.11.017}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/EhardR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/EpsteinGLM20, author = {Dror Epstein and Martin Charles Golumbic and Abhiruk Lahiri and Gila Morgenstern}, title = {Hardness and approximation for {L-EPG} and {B1-EPG} graphs}, journal = {Discret. Appl. Math.}, volume = {281}, pages = {224--228}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2019.10.004}, doi = {10.1016/J.DAM.2019.10.004}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/EpsteinGLM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/FariaKSSS20, author = {Lu{\'{e}}rbio Faria and Sulamita Klein and Ignasi Sau and U{\'{e}}verton S. Souza and Rubens Sucupira}, title = {Maximum cuts in edge-colored graphs}, journal = {Discret. Appl. Math.}, volume = {281}, pages = {229--234}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2019.02.038}, doi = {10.1016/J.DAM.2019.02.038}, timestamp = {Sat, 25 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/FariaKSSS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/FederH20, author = {Tom{\'{a}}s Feder and Pavol Hell}, title = {Complexity of correspondence H-colourings}, journal = {Discret. Appl. Math.}, volume = {281}, pages = {235--245}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2019.11.005}, doi = {10.1016/J.DAM.2019.11.005}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/FederH20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Figueiredo20, author = {Celina M. H. de Figueiredo}, title = {Complexity-separating graph classes for vertex, edge and total colouring}, journal = {Discret. Appl. Math.}, volume = {281}, pages = {162--171}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2019.02.039}, doi = {10.1016/J.DAM.2019.02.039}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/Figueiredo20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/LimaFL20, author = {Murilo Santos de Lima and M{\'{a}}rio C{\'{e}}sar San Felice and Orlando Lee}, title = {Group parking permit problems}, journal = {Discret. Appl. Math.}, volume = {281}, pages = {172--194}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2019.05.013}, doi = {10.1016/J.DAM.2019.05.013}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/LimaFL20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/MatamalaZ20, author = {Mart{\'{\i}}n Matamala and Jos{\'{e}} Zamora}, title = {Graphs admitting antimagic labeling for arbitrary sets of positive numbers}, journal = {Discret. Appl. Math.}, volume = {281}, pages = {246--251}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2019.10.011}, doi = {10.1016/J.DAM.2019.10.011}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/MatamalaZ20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/MouraW20, author = {Phablo F. S. Moura and Yoshiko Wakabayashi}, title = {Strong intractability results for generalized convex recoloring problems}, journal = {Discret. Appl. Math.}, volume = {281}, pages = {252--260}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2019.08.002}, doi = {10.1016/J.DAM.2019.08.002}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/MouraW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/PizanaR20, author = {Miguel A. Piza{\~{n}}a and I. A. Robles}, title = {On bicliques and the second clique graph of suspensions}, journal = {Discret. Appl. Math.}, volume = {281}, pages = {261--267}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2019.02.015}, doi = {10.1016/J.DAM.2019.02.015}, timestamp = {Tue, 01 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/PizanaR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/ZateskoZCG20, author = {Leandro M. Zatesko and Alesom Zorzi and Renato Carmo and Andr{\'{e}} Luiz Pires Guedes}, title = {Edge-colouring graphs with bounded local degree sums}, journal = {Discret. Appl. Math.}, volume = {281}, pages = {268--283}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2020.03.044}, doi = {10.1016/J.DAM.2020.03.044}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/ZateskoZCG20.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.