Mohammed Lalou

Orcid: 0000-0002-8837-4351

According to our database1, Mohammed Lalou authored at least 11 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Eternal feedback vertex sets: A new graph protection model using guards.
Discret. Math. Algorithms Appl., April, 2024

2023
Pseudo-polynomial algorithms for solving the Knapsack Problem with dependencies between items.
Comput. Oper. Res., October, 2023

Network Vulnerability Assessment Using Critical Nodes Identification.
Proceedings of the International Symposium on Networks, Computers and Communications, 2023

A Linear Algorithm for the Eternal Feedback Vertex Set on Interval Graphs.
Proceedings of the 9th International Conference on Control, 2023

2021
On the Complexity of the K-way Vertex Cut Problem.
CoRR, 2021

2019
A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs.
Optim. Lett., 2019

2018
The Critical Node Detection Problem in networks: A survey.
Comput. Sci. Rev., 2018

2017
Identifying the Cyber Attack Origin with Partial Observation: A Linear Regression Based Approach.
Proceedings of the 2nd IEEE International Workshops on Foundations and Applications of Self* Systems, 2017

2016
Component-cardinality-constrained critical node problem in graphs.
Discret. Appl. Math., 2016

Least Squares Method for Diffusion Source Localization in Complex Networks.
Proceedings of the Complex Networks & Their Applications V - Proceedings of the 5th International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2016), Milan, Italy, November 30, 2016

2009
Solving Hypertree Structured CSP: Sequential and Parallel Approaches.
Proceedings of the 16th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2009


  Loading...