Mourad El Ouali

According to our database, Mourad El Ouali authored at least 14 papers between 2011 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2022

Hemivariational inequalities on graphs.

Nouhayla Ait Oussaid, Khalid Akhlil, Sultana Ben Aadi, Mourad El Ouali, Anand Srivastav

Comput. Appl. Math., June, 2022

2021

Approximation algorithm for the multicovering problem.

Abbass Gorgi, Mourad El Ouali, Anand Srivastav, Mohamed Hachimi

J. Comb. Optim., 2021

2020

Approximation of set multi-cover via hypergraph matching.

Abbass Gorgi, Mourad El Ouali, Anand Srivastav, Mohamed Hachimi

Theor. Comput. Sci., 2020

The Exact Query Complexity of Yes-No Permutation Mastermind.

Mourad El Ouali, Volkmar Sauerland

Games, 2020

2018

On the Query Complexity of Black-Peg AB-Mastermind.

Mourad El Ouali, Christian Glazik, Volkmar Sauerland, Anand Srivastav

Games, 2018

2016

An approximation algorithm for the partial vertex cover problem in hypergraphs.

Mourad El Ouali, Helena Fohlin, Anand Srivastav

J. Comb. Optim., 2016

Randomized Approximation for the Set Multicover Problem in Hypergraphs.

Mourad El Ouali, Peter Munstermann, Anand Srivastav

Algorithmica, 2016

2015

Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection.

Andreas Baltz, Mourad El Ouali, Gerold Jäger, Volkmar Sauerland, Anand Srivastav

J. Oper. Res. Soc., 2015

2014

A randomised approximation algorithm for the hitting set problem.

Mourad El Ouali, Helena Fohlin, Anand Srivastav

Theor. Comput. Sci., 2014

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

PhD thesis, 2013

Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation.

Mourad El Ouali, Volkmar Sauerland

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012

A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs.

Mourad El Ouali, Helena Fohlin, Anand Srivastav

Proceedings of the Design and Analysis of Algorithms, 2012

The b-Matching Problem in Hypergraphs: Hardness and Approximability.

Mourad El Ouali, Gerold Jäger

Proceedings of the Combinatorial Optimization and Applications, 2012

2011

Inapproximability of <i>b</i>-Matching in <i>k</i>-Uniform Hypergraphs.

Mourad El Ouali, Antje Fretwurst, Anand Srivastav

Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011