Mohammed Lalou

21 papers C 4Journal 10Unranked 7
YearRankTypeTitle / Venue / Authors
2025 J jnl
Completely Independent Spanning Trees in Split Graphs: Structural Properties and Complexity.
CoRR
Mohammed Lalou, Nader Mbarek, Abdallah Skender, Olivier Togni
2025 J jnl
Enhancing controller placement in SD-IoT with dynamic heterogeneous switch traffic via weighted betweenness and GWO.
J. Supercomput.
Raid Boudi, Mohammed Lalou, Nardjes Bouchemal
2025 — conf
Optimizing Predictive Maintenance in Vehicular Systems via Positive Influence Dominating Sets.
KST
Mohammed Lalou, Mawloud Omar, Khaled Hamouid
2025 J jnl
PSO-HSL: A controller placement strategy using PSO with heterogeneous switch load awareness in SD-IoT.
Clust. Comput.
Raid Boudi, Mohammed Lalou, Nardjes Bouchemal
2025 — conf
SOLAR-FU : Raisonner avec des règles logiques du second ordre dans une unification de bases de connaissances.
IC
David Camarazo, Mohammed Lalou, Ana Roxin
2025 J jnl
The k-way vertex cut problem on bipartite graphs: Complexity results and algorithms.
Discret. Optim.
Mohammed Lalou, Hamamache Kheddouci
2024 J jnl
Eternal feedback vertex sets: A new graph protection model using guards.
Discret. Math. Algorithms Appl.
Nour Dyab, Mohammed Lalou, Hamamache Kheddouci
2024 C conf
Finding Important Nodes in Chordal Graphs
CoDIT
Mohammed Lalou, Hamamache Kheddouci
2024 — conf
On the Controller Placement Problem: a New SD-IoT Topology for the Algerian Network.
ICT-DM
Raid Boudi, Mohammed Lalou, Nardjes Bouchemal
2024 C conf
Optimizing Latency in SD-IoT through Heterogeneous Traffic Flow-Based Controller Placement.
ISNCC
Raid Boudi, Mohammed Lalou, Nardjes Bouchemal, Chirihane Gherbi
2024 — conf
Railway Systems' Ontologies: A Literature Review and an Alignment Proposal.
iiWAS (1)
David Camarazo, Ana Roxin, Mohammed Lalou
2023 C conf
A Linear Algorithm for the Eternal Feedback Vertex Set on Interval Graphs.
CoDIT
Nour Dyab, Mohammed Lalou, Hamamache Kheddouci
2023 C conf
Network Vulnerability Assessment Using Critical Nodes Identification.
ISNCC
Mohammed Lalou, Hamamache Kheddouci
2023 J jnl
Pseudo-polynomial algorithms for solving the Knapsack Problem with dependencies between items.
Comput. Oper. Res.
Mohammed Lalou, Hamamache Kheddouci
2021 J jnl
On the Complexity of the K-way Vertex Cut Problem.
CoRR
Mohammed Lalou
2019 J jnl
A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs.
Optim. Lett.
Mohammed Lalou, Hamamache Kheddouci
2018 J jnl
The Critical Node Detection Problem in networks: A survey.
Comput. Sci. Rev.
Mohammed Lalou, Mohammed Amin Tahraoui, Hamamache Kheddouci
2017 — conf
Identifying the Cyber Attack Origin with Partial Observation: A Linear Regression Based Approach.
FAS*W@SASO/ICCAC
Mohammed Lalou, Hamamache Kheddouci, Salim Hariri
2016 J jnl
Component-cardinality-constrained critical node problem in graphs.
Discret. Appl. Math.
Mohammed Lalou, Mohammed Amin Tahraoui, Hamamache Kheddouci
2016 — conf
Least Squares Method for Diffusion Source Localization in Complex Networks.
COMPLEX NETWORKS
Mohammed Lalou, Hamamache Kheddouci
2009 — conf
Solving Hypertree Structured CSP: Sequential and Parallel Approaches.
RCRA@AI*IA
Mohammed Lalou, Zineb Habbas, Kamal Amroun