Mourad El Ouali

Publication Activity (10 Years)

Years Active: 2011-2022
Publications (10 Years): 11

Top Topics

Query Complexity

Top Venues

J. Comb. Optim.

Theor. Comput. Sci.

Publications

Nouhayla Ait Oussaid, Khalid Akhlil, Sultana Ben Aadi, Mourad El Ouali, Anand Srivastav
Hemivariational inequalities on graphs. Comput. Appl. Math. 41 (4) (2022)
Abbass Gorgi, Mourad El Ouali, Anand Srivastav, Mohamed Hachimi
Approximation algorithm for the multicovering problem. J. Comb. Optim. 41 (2) (2021)
Mourad El Ouali, Volkmar Sauerland
The Exact Query Complexity of Yes-No Permutation Mastermind. CoRR (2020)
Mourad El Ouali, Volkmar Sauerland
The Exact Query Complexity of Yes-No Permutation Mastermind. Games 11 (2) (2020)
Abbass Gorgi, Mourad El Ouali, Anand Srivastav, Mohamed Hachimi
Approximation of set multi-cover via hypergraph matching. Theor. Comput. Sci. 845 (2020)
Abbass Gorgi, Mourad El Ouali, Anand Srivastav, Mohamed Hachimi
Approximation algorithm for the Multicovering Problem. CoRR (2020)
Mourad El Ouali, Christian Glazik, Volkmar Sauerland, Anand Srivastav
On the Query Complexity of Black-Peg AB-Mastermind. Games 9 (1) (2018)
Mourad El Ouali, Helena Fohlin, Anand Srivastav
An approximation algorithm for the partial vertex cover problem in hypergraphs. J. Comb. Optim. 31 (2) (2016)
Mourad El Ouali, Peter Munstermann, Anand Srivastav
Randomized Approximation for the Set Multicover Problem in Hypergraphs. Algorithmica 74 (2) (2016)
Mourad El Ouali, Christian Glazik, Volkmar Sauerland, Anand Srivastav
On the Query Complexity of Black-Peg AB-Mastermind. CoRR (2016)
Andreas Baltz, Mourad El Ouali, Gerold Jäger, Volkmar Sauerland, Anand Srivastav
Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection. J. Oper. Res. Soc. 66 (4) (2015)
Mourad El Ouali, Helena Fohlin, Anand Srivastav
A randomised approximation algorithm for the hitting set problem. Theor. Comput. Sci. 555 (2014)
Mourad El Ouali, Volkmar Sauerland
Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation. IWOCA (2013)
Mourad El Ouali, Volkmar Sauerland
Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation CoRR (2013)
Mourad El Ouali, Helena Fohlin, Anand Srivastav
A Randomised Approximation Algorithm for the Hitting Set Problem. WALCOM (2013)
Mourad El Ouali, Helena Fohlin, Anand Srivastav
A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs. MedAlg (2012)
Mourad El Ouali, Gerold Jäger
The b-Matching Problem in Hypergraphs: Hardness and Approximability. COCOA (2012)
Mourad El Ouali, Antje Fretwurst, Anand Srivastav
-Uniform Hypergraphs. WALCOM (2011)