VLDB 2026 Research / reviewers in the wild / expert

Mekkia Kouider

dblp:80/5301 · DBLP profile ↗
← Back
9ranked-venue papers
1as first author
1since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 8 · 1 first-author · 1 since 2021Computer networks · 1
YearPublicationVenuePosition
2022 New bounds for the b-chromatic number of vertex deleted graphs
Renata R. Del-Vecchio, Mekkia Kouider
 Discret. Appl. Math.2
2016 On quasi-monotonous graphs
Mekkia Kouider
 Discret. Appl. Math.1
2015 On the b-chromatic number of regular bounded graphs
Amine El Sahili, Mekkia Kouider, Maidoun Mortada
 Discret. Appl. Math.2
2015 On the b-coloring of G-e
Mohamed Zamime, Mekkia Kouider, Hacène Aït Haddadène
 Discret. Appl. Math.2
2014 The b-chromatic number and f-chromatic vertex number of regular graphs
Amine El Sahili, Hamamache Kheddouci, Mekkia Kouider, Maidoun Mortada
 Discret. Appl. Math.3
2010 On mean distance and girth
Siham Bekkai, Mekkia Kouider
 Discret. Appl. Math.2
2009 On pseudo 2-factors
Siham Bekkai, Mekkia Kouider
 Discret. Appl. Math.2
2005 On the b-dominating coloring of graphs
Chính T. Hoàng, Mekkia Kouider
 Discret. Appl. Math.2
1989 Edge-vulnerability and mean distance
abstract
Abstract The mean distance of a simple connected graph G of order n is defined by magnified image We answer a problem of Plesnik about the edge‐vulnerability of G related to μ, i.e., we find a bound for μ(G − e) − μ(G) and for magnified image where e is an edge of G such that G − e is still conencted. This question is of interest in interconnection La distance moyenne d'un graphe G, simple et connexe, d'ordre n, est définie par magnified image Nous répondons ici à un problème de Plesnik sur l'arěte‐vulnérabilité de G par rapport à μ, i.e. nous trouvons une borne pour μ(G −e) − μ(G) et pour magnified image oú e est une arěte de G telle que G − e soit encore connexe.
Odile Favaron, Mekkia Kouider, Maryvonne Mahéo
 Networks2