default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLamia Sadeg-Belkacem
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Aissam Aouar
, Saïd Yahiaoui, Lamia Sadeg, Kadda Beghdad Bey:
Scalable Diversified Top-k Pattern Matching in Big Graphs. Big Data Res. 36: 100464 (2024)- [j6]Aissam Aouar, Saïd Yahiaoui, Lamia Sadeg, Nadia Nouali-Taboudjemat, Kadda Beghdad Bey:
Distributed Partial Simulation for Graph Pattern Matching. Comput. J. 67(1): 110-126 (2024) - [j5]Mohamed Hassen Kerkache, Lamia Sadeg-Belkacem, Fatima Benbouzid-Si Tayeb:
A hybrid approach for enhanced link prediction in social networks based on community detection. Int. J. Gen. Syst. 53(2): 154-183 (2024) - [j4]Mohamed Hassen Kerkache, Lamia Sadeg-Belkacem, Fatima Benbouzid-Si Tayeb:
Improved artificial bee colony algorithm based on community detection for link prediction problem. Multim. Tools Appl. 83(14): 41655-41681 (2024) - 2023
- [j3]Mohamed Hassen Kerkache, Lamia Sadeg-Belkacem, Fatima Benbouzid-Si Tayeb:
Similarity-Based Hybrid Algorithms for Link Prediction Problem in Social Networks. New Gener. Comput. 41(2): 281-314 (2023) - 2022
- [c5]Mohamed Hassen Kerkache, Lamia Sadeg-Belkacem, Fatima Benbouzid-Si Tayeb, Amri Ali:
Supervised Learning Using Community Detection for Link Prediction. CSA 2022: 85-94
2010 – 2019
- 2019
- [c4]Meriem Touat, Fatima Benbouzid-Si Tayeb, Belaid Benhamou, Lamia Sadeg, Salima Aklil, Meryem Karaoui:
An Integrated Guided Local Search considering Human Resource Constraints for the Single-machine Scheduling problem with Preventive Maintenance. SMC 2019: 3799-3804 - 2016
- [b1]Lamia Sadeg:
Méthodes de décomposition pour la résolution des PCSP (Partial Constraint Satisfaction Problem) : application aux problèmes FAP et coloration de graphes. (Decomposition methods for solving PCSP (Partial Constraint Satisfaction Problem) : application to FAP and graph coloring problems). University of Lorraine, Nancy, France, 2016 - [j2]Lamia Sadeg-Belkacem, Zineb Habbas, Wassila Aggoune-Mtalaa:
Adaptive genetic algorithms guided by decomposition for PCSPs: application to frequency assignment problems. Frontiers Comput. Sci. 10(6): 1012-1025 (2016) - [j1]Lamia Sadeg-Belkacem, Zineb Habbas, Wassila Aggoune-Mtalaa, Fatima Benbouzid-Si Tayeb:
Combining graph decomposition techniques and metaheuristics for solving PCSPs. Application to MI-FAP. Int. J. Reason. based Intell. Syst. 8(3/4): 104-118 (2016) - 2015
- [c3]Lamia Sadeg-Belkacem, Zineb Habbas, Wassila Aggoune-Mtalaa:
AGAGD - An Adaptive Genetic Algorithm Guided by Decomposition for Solving PCSPs. ICAART (2) 2015: 78-89 - [c2]Lamia Sadeg, Zineb Habbas, Wassila Aggoune-Mtalaa:
Solving PCSPs Using Genetic Algorithms Guided by Structural Knowledge. ICAART (Revised Selected Papers) 2015: 145-162 - 2014
- [c1]Lamia Sadeg-Belkacem, Zineb Habbas, Fatima Benbouzid-Si Tayeb, Daniel Singer:
Decomposition Tehniques for Solving Frequency Assigment Problems (FAP) - A Top-Down Approach. ICAART (1) 2014: 477-484
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-08-30 21:37 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:
