default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHacène Aït Haddadène
Person information
- affiliation: USTHB-University, Algiers, Algeria
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j13]Hayat Issaadi, Hacène Aït Haddadène, Hamamache Kheddouci:
On P5-free locally split graphs. Discuss. Math. Graph Theory 43(4): 1063-1090 (2023)- [j12]Adlane Baaziz, Hacène Aït Haddadène
, Ammar Oulamara, Ahmed Kouider:
Scheduling preemptive jobs on parallel machines with a conflict graph: a graph multi-colouring approach. Int. J. Math. Oper. Res. 25(1): 47-67 (2023) - 2021
- [j11]Ahmed Kouider, Hacène Aït Haddadène:
A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling : A mixed graph coloring approach. Comput. Oper. Res. 132: 105319 (2021)
2010 – 2019
- 2019
- [j10]Youcef Djeddi, Hacène Aït Haddadène, Nabil Belacel:
An extension of adaptive multi-start tabu search for the maximum quasi-clique problem. Comput. Ind. Eng. 132: 280-292 (2019) - [c3]Assia Gueham, Hacène Aït Haddadène, Anass Nagih:
Contraction-based method for computing a lower bound on the clique number of a graph. CoDIT 2019: 1758-1762 - 2018
- [j9]Assia Gueham, Anass Nagih, Hacène Aït Haddadène, Malek Masmoudi:
Graph coloring approach with new upper bounds for the chromatic number: team building application. RAIRO Oper. Res. 52(3): 807-818 (2018) - 2017
- [j8]Mouaouia Cherif Bouzid, Hacène Aït Haddadène, Saïd Salhi:
An integration of Lagrangian split and VNS: The case of the capacitated vehicle routing problem. Comput. Oper. Res. 78: 513-525 (2017) - [j7]Ahmed Kouider, Hacène Aït Haddadène, Samia Ourari, Ammar Oulamara:
Mixed graph colouring for unit-time scheduling. Int. J. Prod. Res. 55(6): 1720-1729 (2017) - 2015
- [j6]Mohamed Zamime, Mekkia Kouider, Hacène Aït Haddadène:
On the b-coloring of G-e. Discret. Appl. Math. 188: 41-50 (2015) - [j5]Mouaouia Cherif Bouzid, Hacène Aït Haddadène, Saïd Salhi:
Splitting a Giant Tour using Integer Linear Programming. Electron. Notes Discret. Math. 47: 245-252 (2015) - [c2]Ahmed Kouider, Hacène Aït Haddadène, Samia Ourari, Ammar Oulamara:
Mixed integer linear programs and tabu search approach to solve mixed graph coloring for unit-time job shop scheduling. CASE 2015: 1177-1181 - 2014
- [c1]Assia Gueham, Anass Nagih, Hacène Aït Haddadène:
Two bounds of chromatic number in graphs coloring problem. CoDIT 2014: 292-296
2000 – 2009
- 2003
- [j4]Hacène Aït Haddadène, Meriem Mechebbek:
On the quasi-locally paw-free graphs. Discret. Math. 266(1-3): 37-40 (2003)
1990 – 1999
- 1998
- [j3]Hacène Aït Haddadène, Sylvain Gravier, Frédéric Maffray:
An algorithm for coloring some perfect graphs. Discret. Math. 183(1-3): 1-16 (1998) - 1997
- [j2]Hacène Aït Haddadène, Frédéric Maffray:
Coloring perfect degenerate graphs. Discret. Math. 163(1-3): 211-215 (1997) - 1996
- [j1]Hacène Aït Haddadène, Sylvain Gravier:
On weakly diamond-free Berge graphs. Discret. Math. 159(1-3): 237-240 (1996)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
