{"id":44,"date":"2023-06-18T10:46:19","date_gmt":"2023-06-18T10:46:19","guid":{"rendered":"http:\/\/193.194.89.179\/wp_liforce\/?page_id=44"},"modified":"2024-11-05T14:40:17","modified_gmt":"2024-11-05T14:40:17","slug":"publications-internationales-de-lequipe-casdi","status":"publish","type":"page","link":"https:\/\/liforce.usthb.dz\/index.php\/publications-internationales-de-lequipe-casdi\/","title":{"rendered":"Publications internationales de l’\u00e9quipe CASDI"},"content":{"rendered":"\n
\n
    \n
  1. I. Bouchemakh and K. Engel. Interval stability and interval covering property in finite posets. Order 9 (1992), 163-175.(http:\/\/www.springer.com\/mathematics\/geometry\/journal\/11083<\/a>)<\/li>\n\n\n\n
  2. I. Bouchemakh and K. Engel. The order-interval hypergraph of a finite poset and the K\u00f6nig property. Discrete Math. 170 (1997), 51-61. (http:\/\/www.elsevier.com\/locate\/disc<\/a>)<\/li>\n\n\n\n
  3. I. Bouchemakh. On the chromatic number of order-interval hypergraphs. Rostock. Math. Kolloq. 54 (2000), 81-89.(http:\/\/www.math.uni-rostock.de\/math\/pub\/romako\/index.html<\/a>)<\/li>\n\n\n\n
  4. I. Bouchemakh. On the K\u00f6nig and dual K\u00f6nig properties of the order-interval hypergraphs of series-parallel posets. Rostock. Math. Kolloq. 56 (2002), 3-8. (http:\/\/www.math.un-rostock.de\/math\/pub\/romako\/index.html<\/a>)<\/li>\n\n\n\n
  5. I. Bouchemakh. On the dual K\u00f6nig property of the order-interval hypergraph of a new class of posets. Rostock. Math. Kolloq., 59 (2005), 19-27. (http:\/\/www.math.uni-rostock.de\/math\/pub\/romako\/index.html<\/a>)<\/li>\n\n\n\n
  6. I. Bouchemakh and S. Ouatiki. On the domatic and the total domatic numbers of the 2-section graph of the order-interval hypergraph of a finite poset. Electronic Notes in Discrete Mathematics 22 (2005), 245-251. (http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1571065305052133<\/a>)<\/li>\n\n\n\n
  7. I. Bouchemakh and M. Aouane. Independence set of maximum weight in the order-interval hypergraph of the interval Order. Electronic Notes in Discrete Mathematics 27 (2006), 9.(http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1571065306001259<\/a>)<\/li>\n\n\n\n
  8. I. Bouchemakh and S. Ouatiki. On the domatic and the total domatic numbers of the 2-section graph of the order-interval hypergraph of a finite poset. Discrete Math. 309 (2009), 3674-3679.(http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0012365X08000459<\/a>)<\/li>\n\n\n\n
  9. I. Kouider and S. Ouatiki. Stability number and even [2,b]-factors in graphs. AKCE J. Graphs Combin. 7(2), 151\u2013169 (2010).(http:\/\/akcejournal.org\/contents\/vol7no2\/pdf%20images\/4.pdf<\/a>)<\/li>\n\n\n\n
  10. I. Bouchemakh and R. Sahbi. On a conjecture of Erwin. Studia Informatica Universalis 9.2 (2011), 144-151. (http:\/\/studia.complexica.net\/index.php?option=com_content&view=category&layout=blog&id=57&Itemid=102&lang=fr<\/a>)<\/li>\n\n\n\n
  11. M. Kouider and S. Ouatiki. Sufficient Condition for the Existence of an Even [a, b]-Factor in Graph. Graphs and Combinatorics 29(4)<\/a> (2013), 1051-1057. (http:\/\/link.springer.com\/article\/10.1007%2Fs00373-012-1168-9<\/a>).<\/li>\n\n\n\n
  12. I. Bouchemakh and M. Zemir. On the broadcast independence number of Grid Graph. Graphs and Combinatorics 30(1) (2014), 83-100. (http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1253-0<\/a>)<\/li>\n\n\n\n
  13. I. Bouchemakh and F. Kaci. On the dual K\u00f6nig property of the order-interval hypergraph of two classes of N-free posets. Canad. Math. Bull. 60(2017), 43-53.
    (    https:\/\/cms.math.ca\/10.4153\/CMB-2016-036-8<\/a>)<\/li>\n\n\n\n
  14. D. La\u00efche, I. Bouchemakh and E. Sopena. On the packing coloring of undirected and oriented generalized theta graphs. Australasian Journal of Combinatorics 66(2) (2016), 310-329. (http:\/\/ajc.maths.uq.edu.au\/pdf\/66\/ajc_v66_p310.pdf<\/a>).<\/li>\n\n\n\n
  15. D. La\u00efche, I. Bouchemakh and E. Sopena. Packing coloring of some undirected and oriented coronae graphs. Discuss. Math. Graph Theory 37(3) (2017), 665-690. (http:\/\/www.discuss.wmie.uz.zgora.pl\/gt\/37_3\/gt37-1984.pdf<\/a>)<\/li>\n\n\n\n
  16. I. Bouchemakh and N. Fergani. On the upper broadcast domination number. Ars Combinatoria 130, (2017), 151-161. (http:\/\/www.combinatorialmath.ca\/arscombinatoria\/vol130.html<\/a>)<\/li>\n\n\n\n
  17. A. Rahmouni and M. Chellali. Independent Roman 2<\/em>-domination in graphs. Discrete Applied Mathematics 236 (2018), 408-414. (https:\/\/doi.org\/10.1016\/j.dam.2017.10.028<\/a>)<\/li>\n\n\n\n
  18. M. Ahmane, I. Bouchemakh and E. Sopena. On the Broadcast Independence Number of Caterpillars. Discrete Applied Mathematics 244 (2018), 20-35
    (    https:\/\/doi.org\/10.1016\/j.dam.2018.03.017<\/a>)<\/li>\n\n\n\n
  19. M. Bouzefrane and S. Ouatiki. On the global offensive alliance in unicycle graphs. AKCE International Journal of Graphs and Combinatorics 15(1) (2018), 72-78. (https:\/\/doi.org\/10.1016\/j.akcej.2018.01.001<\/a>)<\/li>\n\n\n\n
  20. B. Benmedjdoub, I.Bouchemakh and E. Sopena. Incidence Choosability of Graphs. Discrete Applied Mathematics 265 (2019), 40-55 (https:\/\/doi.org\/10.1016\/j.dam.2019.04.027<\/a>)<\/li>\n\n\n\n
  21. D. La\u00efche and E. Sopena. Packing colouring of some classes of cubic graphs. Australas. J. Combin. 72(2) (2018), 376\u2013404.  (https:\/\/ajc.maths.uq.edu.au\/pdf\/72\/ajc_v72_p376.pdf<\/a>)<\/li>\n\n\n\n
  22. B. Benmedjdoub, E. Sopena and I. Bouchemakh. 2-distance colorings of integer distance graphs. Discuss. Math. Graph Theory 39(2) (2019), 589\u2013603. (http:\/\/www.discuss.wmie.uz.zgora.pl\/gt\/index.php?doi=10.7151\/dmgt.2040<\/a>)<\/li>\n\n\n\n
  23. S. Bouchouika, I. Bouchemakh and E. Sopena. Broadcasts on Paths and Cycles. Discrete Applied Mathematics 283 (2020), 375-395. (https:\/\/doi.org\/10.1016\/j.dam.2020.01.030)<\/li>\n\n\n\n
  24. S. Ouatiki. On the upper global powerfull alliance number in trees.  Ars Combinatoria 151 (2020), 89-98.<\/li>\n\n\n\n
  25. M. Bouzefrane, I.Bouchemakh, M. Zamime and N. Ikhlef-Eschouf. Trees with unique minimum global offensive alliance. RAIRO-Oper. Res. 55 (2021), S863-S872. (https:\/\/www.rairo-ro.org\/articles\/ro\/pdf\/2021\/01\/ro180234.pdf)<\/li>\n\n\n\n
  26. H. Meraimi and M. Chellali, Edge lifting and Roman domination in graphs. Discrete Mathematics, Algorithms and Applications Vol. 13, No. 5 (2021) 2150064 (13 pages).<\/li>\n\n\n\n
  27. S. Ouatiki and M. Bouzefrane. A lower bound on the global powerful alliance number in trees. RAIRO-Oper. Res. 55(2) (2021), 495-503. (https:\/\/www.rairo-ro.org\/articles\/ro\/pdf\/2021\/03\/ro200260.pdf)<\/li>\n\n\n\n
  28. H. Labane, I. Bouchemakh and A. Semanicova-Fenovcikova. On H-irregularity Strength of Cycles and Diamond Graphs. Discrete Mathematics, Algorithms and Applications, 14(05),  Article No. 2150157 (2022). (https:\/\/doi.org\/10.1142\/S1793830921501573<\/a>)<\/li>\n\n\n\n
  29. L. Laouar, I. Bouchemakh and E. Sopena,   On the broadcast independence number of circulant graphs. Discrete Mathematics, Algorithms and Applications. Discrete Mathematics, Algorithms and Applications, Article No. 2350053 (36 pages), (2023). (https:\/\/doi.org\/10.1142\/S1793830923500532<\/a>)<\/li>\n\n\n\n
  30. Fatma Kaci. On disjoint maximum and maximal independent sets in graphs and inverse independence number. Discrete Mathematics, Algorithms and Applications. 15 (08), 2250165 (2023). (https:\/\/doi.org\/10.1142\/S1793830922501658<\/a>)<\/li>\n\n\n\n
  31. Paul Dorbec, Fatma Kaci. Disjoint maximal independent sets in graphs and hypergraphs. Discussiones Mathematicae Graph Theory (2023). (https :\/\/doi.org\/10.7151\/dmgt.2500)<\/a> <\/li>\n\n\n\n
  32. M. Ahmane, I. Bouchemakh and E. Sopena. On the Broadcast Independence Number of Locally Uniform 2-Lobsters. Discussiones Mathematicae Graph Theory 44 (2024) 199\u2013229. (https:\/\/doi.org\/10.7151\/dmgt.2443)<\/li>\n\n\n\n
  33. B. Benmedjdoub and E. Sopena. Strong incidence colouring of graphs Discussiones Mathematicae Graph Theory 442(2024), 663-689. (https:\/\/doi.org\/10.7151\/dmgt.2466)<\/a><\/li>\n\n\n\n
  34. S. Bouchouika, I. Bouchemakh and E. Sopena. Upper Broadcast Domination Number of Caterpillars with no Trunks. Electronic Journal of Graph Theory and Applications 12 (2): 219\u2013264 (2024).<\/li>\n<\/ol>\n<\/blockquote>\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-44","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/liforce.usthb.dz\/index.php\/wp-json\/wp\/v2\/pages\/44","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/liforce.usthb.dz\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/liforce.usthb.dz\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/liforce.usthb.dz\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/liforce.usthb.dz\/index.php\/wp-json\/wp\/v2\/comments?post=44"}],"version-history":[{"count":8,"href":"https:\/\/liforce.usthb.dz\/index.php\/wp-json\/wp\/v2\/pages\/44\/revisions"}],"predecessor-version":[{"id":882,"href":"https:\/\/liforce.usthb.dz\/index.php\/wp-json\/wp\/v2\/pages\/44\/revisions\/882"}],"wp:attachment":[{"href":"https:\/\/liforce.usthb.dz\/index.php\/wp-json\/wp\/v2\/media?parent=44"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}