default search action
Search dblp for Publications
export results for "toc:db/journals/dam/dam319.bht:"
@article{DBLP:journals/dam/AjayJR22, author = {Jammigumpula Ajay and Satyabrata Jana and Sasanka Roy}, title = {Collision-free routing problem with restricted L-path}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {71--80}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.04.013}, doi = {10.1016/J.DAM.2021.04.013}, timestamp = {Thu, 25 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/AjayJR22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/AnandDNR22, author = {Bijo S. Anand and Mitre Costa Dourado and Prasanth G. Narasimha{-}Shenoi and Sabeer Sain Ramla}, title = {On the {\(\Delta\)}-interval and the {\(\Delta\)}-convexity numbers of graphs and graph products}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {487--498}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.07.041}, doi = {10.1016/J.DAM.2021.07.041}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/AnandDNR22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/AravindKK22, author = {N. R. Aravind and Subrahmanyam Kalyanasundaram and Anjeneya Swami Kare}, title = {Vertex partitioning problems on graphs with bounded tree width}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {254--270}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.05.016}, doi = {10.1016/J.DAM.2021.05.016}, timestamp = {Thu, 25 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/AravindKK22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/AravindM22, author = {N. R. Aravind and Udit Maniyar}, title = {Planar projections of graphs}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {216--222}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.08.015}, doi = {10.1016/J.DAM.2021.08.015}, timestamp = {Thu, 25 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/AravindM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/ArifBGK22, author = {Umair Arif and Robert Benkoczi and Daya Ram Gaur and Ramesh Krishnamurti}, title = {A primal-dual approximation algorithm for Minsat}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {372--381}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.07.016}, doi = {10.1016/J.DAM.2021.07.016}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/ArifBGK22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/AshokBGKY22, author = {Pradeesha Ashok and Rathin Bhargava and Naman Gupta and Mohammad Khalid and Dolly Yadav}, title = {Structural parameterization for minimum conflict-free colouring}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {239--253}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.12.026}, doi = {10.1016/J.DAM.2021.12.026}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/AshokBGKY22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/AsirR22, author = {Thangaraj Asir and V. Rabikka}, title = {The Wiener index of the zero-divisor graph of Zn}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {461--471}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.02.035}, doi = {10.1016/J.DAM.2021.02.035}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/AsirR22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BabuCFPRW22, author = {Jasine Babu and L. Sunil Chandran and Mathew C. Francis and Veena Prabhakaran and Deepak Rajendraprasad and J. Nandini Warrier}, title = {On graphs whose eternal vertex cover number and vertex cover number coincide}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {171--182}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.02.004}, doi = {10.1016/J.DAM.2021.02.004}, timestamp = {Thu, 25 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/BabuCFPRW22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BaigKS22, author = {Mirza Galib Anwarul Husain Baig and Deepanjan Kesh and Chirag Sodani}, title = {Storing four elements in the two query bitprobe model}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {121--131}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.05.008}, doi = {10.1016/J.DAM.2021.05.008}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/BaigKS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BalakrishnanCHL22, author = {Kannan Balakrishnan and Manoj Changat and Andreas M. Hinz and Divya Sindhu Lekha}, title = {The median of Sierpi{\'{n}}ski graphs}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {159--170}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.02.005}, doi = {10.1016/J.DAM.2021.02.005}, timestamp = {Thu, 25 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/BalakrishnanCHL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BeaudouFN22, author = {Laurent Beaudou and Florent Foucaud and Reza Naserasr}, title = {Smallest C2{\(\mathscr{l}\)}+1-critical graphs of odd-girth 2k+1}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {564--575}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.08.040}, doi = {10.1016/J.DAM.2021.08.040}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/BeaudouFN22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BeregH22, author = {Sergey Bereg and Mohammadreza Haghpanah}, title = {New algorithms and bounds for halving pseudolines}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {194--206}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.05.029}, doi = {10.1016/J.DAM.2021.05.029}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/BeregH22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BeregH22a, author = {Sergey Bereg and Mohammadreza Haghpanah}, title = {Algorithms for Radon partitions with tolerance}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {207--215}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.09.014}, doi = {10.1016/J.DAM.2021.09.014}, timestamp = {Thu, 25 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/BeregH22a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BhoreCJMPR22, author = {Sujoy Bhore and Sourav Chakraborty and Satyabrata Jana and Joseph S. B. Mitchell and Supantha Pandit and Sasanka Roy}, title = {The balanced connected subgraph problem}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {111--120}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2020.12.030}, doi = {10.1016/J.DAM.2020.12.030}, timestamp = {Thu, 25 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/BhoreCJMPR22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/ChandranDT22a, author = {S. V. Ullas Chandran and Mitre Costa Dourado and Maya G. S. Thankachy}, title = {Computational and structural aspects of the geodetic and the hull numbers of shadow graphs}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {499--510}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.12.019}, doi = {10.1016/J.DAM.2021.12.019}, timestamp = {Mon, 08 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/ChandranDT22a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/ChandranLS22, author = {L. Sunil Chandran and Abhiruk Lahiri and Nitin Singh}, title = {Improved approximation for maximum edge colouring problem}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {42--52}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.05.017}, doi = {10.1016/J.DAM.2021.05.017}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/ChandranLS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/ChangatD22, author = {Manoj Changat and Sandip Das}, title = {Preface: {CALDAM} 2020}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {192--193}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2022.06.038}, doi = {10.1016/J.DAM.2022.06.038}, timestamp = {Mon, 08 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/ChangatD22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/DasG22, author = {Sandip Das and Harmender Gahlawat}, title = {Bumblebee visitation problem}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {27--41}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2022.01.007}, doi = {10.1016/J.DAM.2022.01.007}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/DasG22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/FernauKOR22, author = {Henning Fernau and Lakshmanan Kuppusamy and Rufus O. Oladele and Indhumathi Raman}, title = {Improved descriptional complexity results on generalized forbidding grammars}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {2--18}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2020.12.027}, doi = {10.1016/J.DAM.2020.12.027}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/FernauKOR22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/FoucaudKKMR22, author = {Florent Foucaud and Shih{-}Shun Kao and Ralf Klasing and Mirka Miller and Joe Ryan}, title = {Monitoring the edges of a graph using distances}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {424--438}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.07.002}, doi = {10.1016/J.DAM.2021.07.002}, timestamp = {Thu, 25 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/FoucaudKKMR22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/FrancisRG22, author = {P. Francis and S. Francis Raj and M. Gokulnath}, title = {On indicated coloring of lexicographic product of graphs}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {576--582}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.04.021}, doi = {10.1016/J.DAM.2021.04.021}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/FrancisRG22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Frizzell22, author = {Carrie Frizzell}, title = {Generalized bijective maps between G-parking functions, spanning trees, and the Tutte polynomial}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {517--532}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.07.032}, doi = {10.1016/J.DAM.2021.07.032}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/Frizzell22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/HakanenJLY22, author = {Anni Hakanen and Ville Junnila and Tero Laihonen and Ismael G. Yero}, title = {On vertices contained in all or in no metric basis}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {407--423}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.12.004}, doi = {10.1016/J.DAM.2021.12.004}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/HakanenJLY22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/HavetMNW22, author = {Fr{\'{e}}d{\'{e}}ric Havet and Dorian Mazauric and Viet{-}Ha Nguyen and R{\'{e}}mi Watrigant}, title = {Overlaying a hypergraph with a graph with bounded maximum degree}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {394--406}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2022.05.022}, doi = {10.1016/J.DAM.2022.05.022}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/HavetMNW22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/HinzHZ22, author = {Andreas M. Hinz and Caroline {Holz auf der Heide} and Sara Sabrina Zemljic}, title = {Metric properties of Sierpi{\'{n}}ski triangle graphs}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {439--453}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.03.002}, doi = {10.1016/J.DAM.2021.03.002}, timestamp = {Thu, 25 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/HinzHZ22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/HinzLP22, author = {Andreas M. Hinz and Borut Luzar and Ciril Petr}, title = {The Dudeney-Stockmeyer Conjecture}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {19--26}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.05.019}, doi = {10.1016/J.DAM.2021.05.019}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/HinzLP22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/JenaD22, author = {Sangram Kishor Jena and Gautam K. Das}, title = {Vertex-edge domination in unit disk graphs}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {351--361}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.06.002}, doi = {10.1016/J.DAM.2021.06.002}, timestamp = {Thu, 21 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/JenaD22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/JungingerMP22, author = {Kolja Junginger and Ioannis Mantas and Evanthia Papadopoulou}, title = {On selecting a fraction of leaves with disjoint neighborhoods in a plane tree}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {141--148}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.02.002}, doi = {10.1016/J.DAM.2021.02.002}, timestamp = {Thu, 25 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/JungingerMP22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/KeshS22, author = {Deepanjan Kesh and Vidya Sagar Sharma}, title = {On the bitprobe complexity of two probe adaptive schemes}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {132--140}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.07.021}, doi = {10.1016/J.DAM.2021.07.021}, timestamp = {Thu, 25 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/KeshS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/KleinKLSS22, author = {Rolf Klein and David K{\"{u}}bel and Elmar Langetepe and J{\"{o}}rg{-}R{\"{u}}diger Sack and Barbara Schwarzwald}, title = {A new model and algorithms in firefighting theory}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {296--309}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.12.005}, doi = {10.1016/J.DAM.2021.12.005}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/KleinKLSS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/KnorSY22, author = {Martin Knor and Riste Skrekovski and Ismael G. Yero}, title = {A note on the metric and edge metric dimensions of 2-connected graphs}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {454--460}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.02.020}, doi = {10.1016/J.DAM.2021.02.020}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/KnorSY22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/KorenblitL22, author = {Mark Korenblit and Vadim E. Levit}, title = {On lengths of edge-labeled graph expressions}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {583--594}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2022.04.015}, doi = {10.1016/J.DAM.2022.04.015}, timestamp = {Thu, 25 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/KorenblitL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/KorzeSV22, author = {Danilo Korze and Zehui Shao and Aleksander Vesel}, title = {New results on radio k-labelings of distance graphs}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {472--479}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.09.007}, doi = {10.1016/J.DAM.2021.09.007}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/KorzeSV22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/KumarRS22, author = {K. S. Ajish Kumar and Deepak Rajendraprasad and K. S. Sudeep}, title = {Oriented diameter of star graphs}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {362--371}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.01.025}, doi = {10.1016/J.DAM.2021.01.025}, timestamp = {Thu, 25 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/KumarRS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Lajou22, author = {Dimitri Lajou}, title = {On Cartesian products of signed graphs}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {533--555}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.03.023}, doi = {10.1016/J.DAM.2021.03.023}, timestamp = {Thu, 25 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/Lajou22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/MahalingamR22, author = {Kalpana Mahalingam and Helda Princy Rajendran}, title = {Properties of m-bonacci-sum graphs}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {149--158}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.02.022}, doi = {10.1016/J.DAM.2021.02.022}, timestamp = {Thu, 25 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/MahalingamR22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/MandalG22, author = {Subhrangsu Mandal and Arobinda Gupta}, title = {Maximum 0-1 timed matching on temporal graphs}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {310--326}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.12.027}, doi = {10.1016/J.DAM.2021.12.027}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/MandalG22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/MaoYLX22, author = {Yuying Mao and Wei Yu and Zhaohui Liu and Jiafeng Xiong}, title = {Approximation algorithms for some Minimum Postmen Cover Problems}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {382--393}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2022.01.005}, doi = {10.1016/J.DAM.2022.01.005}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/MaoYLX22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/MohanP22, author = {Anuraj Mohan and K. V. Pramod}, title = {Representation learning for temporal networks using temporal random walk and deep autoencoder}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {595--605}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2022.01.017}, doi = {10.1016/J.DAM.2022.01.017}, timestamp = {Thu, 25 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/MohanP22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/NeethuC22, author = {P. K. Neethu and S. V. Ullas Chandran}, title = {A note on the convexity number of the complementary prisms of trees}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {480--486}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.07.033}, doi = {10.1016/J.DAM.2021.07.033}, timestamp = {Thu, 25 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/NeethuC22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/PandaG22, author = {B. S. Panda and Pooja Goyal}, title = {Hardness results of global total k-domination problem in graphs}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {223--238}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.02.018}, doi = {10.1016/J.DAM.2021.02.018}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/PandaG22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Pandit22, author = {Supantha Pandit}, title = {Covering and packing of triangles intersecting a straight line}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {92--110}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.11.017}, doi = {10.1016/J.DAM.2021.11.017}, timestamp = {Thu, 25 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/Pandit22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/PradhanBL22, author = {Dinabandhu Pradhan and S. Banerjee and Jia{-}Bao Liu}, title = {Perfect Italian domination in graphs: Complexity and algorithms}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {271--295}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.08.020}, doi = {10.1016/J.DAM.2021.08.020}, timestamp = {Thu, 25 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/PradhanBL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Ramachandran22, author = {S. Ramachandran}, title = {Are all pairs of hypomorphic digraphs S-isomorphic?}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {556--563}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.08.003}, doi = {10.1016/J.DAM.2021.08.003}, timestamp = {Thu, 25 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/Ramachandran22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/SalamWCKS22, author = {Sameera Muhamed Salam and J. Nandini Warrier and Daphna Chacko and K. Murali Krishnan and K. S. Sudeep}, title = {On chordal and perfect plane near-triangulations}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {53--60}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2020.12.031}, doi = {10.1016/J.DAM.2020.12.031}, timestamp = {Thu, 25 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/SalamWCKS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Sarvattamananda22, author = {Swami Sarvattamananda and Sudebkumar Prasant Pal}, title = {Preface: {CALDAM} 2019}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {1}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2022.03.017}, doi = {10.1016/J.DAM.2022.03.017}, timestamp = {Mon, 08 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/Sarvattamananda22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/ShaluA22, author = {M. A. Shalu and Cyriac Antony}, title = {The complexity of restricted star colouring}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {327--350}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.05.015}, doi = {10.1016/J.DAM.2021.05.015}, timestamp = {Thu, 25 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/ShaluA22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/ShaluVSM22, author = {M. A. Shalu and S. Vijayakumar and T. P. Sandhya and Joyashree Mondal}, title = {Induced star partition of graphs}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {81--91}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.04.015}, doi = {10.1016/J.DAM.2021.04.015}, timestamp = {Wed, 24 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/ShaluVSM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/SinghSB22, author = {Ranveer Singh and Naomi Shaked{-}Monderer and Avi Berman}, title = {A linear time algorithm for the nullity of vertex-weighted block graphs}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {61--70}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2020.12.028}, doi = {10.1016/J.DAM.2020.12.028}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/SinghSB22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/ZhouBP22, author = {Sizhong Zhou and Qiuxiang Bian and Quanru Pan}, title = {Path factors in subgraphs}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {183--191}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.04.012}, doi = {10.1016/J.DAM.2021.04.012}, timestamp = {Mon, 08 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/ZhouBP22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/ZhouLX22, author = {Sizhong Zhou and Hongxia Liu and Yang Xu}, title = {A note on fractional ID-[a, b]-factor-critical covered graphs}, journal = {Discret. Appl. Math.}, volume = {319}, pages = {511--516}, year = {2022}, url = {https://doi.org/10.1016/j.dam.2021.03.004}, doi = {10.1016/J.DAM.2021.03.004}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/ZhouLX22.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.