Mourad El Ouali

22 papers B 2C 2Journal 16Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
A hybrid algorithm based on a multiple randomized rounding for set multicover problem: Approximation guarantees and experiments.
Theor. Comput. Sci.
Abbass Gorgi, Adnane Fouadi, Bousselham Ganbouri, Mourad El Ouali
2025 J jnl
Advanced Modeling and Adaptive Control of a Nonholonomic Differential-Drive Mobile Robot Using Deep Physics-Informed Neural Networks.
Autom. Remote. Control.
Youssef Haddout, Soufiane Haddout, Mourad El Ouali, Abdelbasset Boukdir
2025 J jnl
Asymptotic Thresholds for (a:b) Minimum-Degree Games.
Games
Adnane Fouadi, Mourad El Ouali, Anand Srivastav
2022 J jnl
Hemivariational inequalities on graphs.
Comput. Appl. Math.
Nouhayla Ait Oussaid, Khalid Akhlil, Sultana Ben Aadi, Mourad El Ouali, Anand Srivastav
2021 J jnl
Approximation algorithm for the multicovering problem.
J. Comb. Optim.
Abbass Gorgi, Mourad El Ouali, Anand Srivastav, Mohamed Hachimi
2020 J jnl
Approximation algorithm for the Multicovering Problem.
CoRR
Abbass Gorgi, Mourad El Ouali, Anand Srivastav, Mohamed Hachimi
2020 J jnl
Approximation of set multi-cover via hypergraph matching.
Theor. Comput. Sci.
Abbass Gorgi, Mourad El Ouali, Anand Srivastav, Mohamed Hachimi
2020 J jnl
The Exact Query Complexity of Yes-No Permutation Mastermind.
CoRR
Mourad El Ouali, Volkmar Sauerland
2020 J jnl
The Exact Query Complexity of Yes-No Permutation Mastermind.
Games
Mourad El Ouali, Volkmar Sauerland
2018 J jnl
On the Query Complexity of Black-Peg AB-Mastermind.
Games
Mourad El Ouali, Christian Glazik, Volkmar Sauerland, Anand Srivastav
2016 J jnl
An approximation algorithm for the partial vertex cover problem in hypergraphs.
J. Comb. Optim.
Mourad El Ouali, Helena Fohlin, Anand Srivastav
2016 J jnl
On the Query Complexity of Black-Peg AB-Mastermind.
CoRR
Mourad El Ouali, Christian Glazik, Volkmar Sauerland, Anand Srivastav
2016 J jnl
Randomized Approximation for the Set Multicover Problem in Hypergraphs.
Algorithmica
Mourad El Ouali, Peter Munstermann, Anand Srivastav
2015 J jnl
Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection.
J. Oper. Res. Soc.
Andreas Baltz, Mourad El Ouali, Gerold Jäger, Volkmar Sauerland, Anand Srivastav
2014 J jnl
A randomised approximation algorithm for the hitting set problem.
Theor. Comput. Sci.
Mourad El Ouali, Helena Fohlin, Anand Srivastav
2013 B conf
A Randomised Approximation Algorithm for the Hitting Set Problem.
WALCOM
Mourad El Ouali, Helena Fohlin, Anand Srivastav
2013 J jnl
Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation
CoRR
Mourad El Ouali, Volkmar Sauerland
2013 C conf
Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation.
IWOCA
Mourad El Ouali, Volkmar Sauerland
2013 — —
Randomized Approximation for the Matching and Vertex Cover Problem in Hypergraphs: Complexity and Algorithms (Randomisierte Approximation für das Matching- und Knotenüberdeckung Problem in Hypergraphen: Komplexität und Algorithmen)
Mourad El Ouali
2012 — conf
A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs.
MedAlg
Mourad El Ouali, Helena Fohlin, Anand Srivastav
2012 C conf
The b-Matching Problem in Hypergraphs: Hardness and Approximability.
COCOA
Mourad El Ouali, Gerold Jäger
2011 B conf
Inapproximability of
WALCOM
Mourad El Ouali, Antje Fretwurst, Anand Srivastav