Mourad El Ouali

According to our database1, Mourad El Ouali authored at least 12 papers between 2011 and 2021.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Approximation algorithm for the multicovering problem.
J. Comb. Optim., 2021

2020
Approximation of set multi-cover via hypergraph matching.
Theor. Comput. Sci., 2020

The Exact Query Complexity of Yes-No Permutation Mastermind.
Games, 2020

2018
On the Query Complexity of Black-Peg AB-Mastermind.
Games, 2018

2016
An approximation algorithm for the partial vertex cover problem in hypergraphs.
J. Comb. Optim., 2016

Randomized Approximation for the Set Multicover Problem in Hypergraphs.
Algorithmica, 2016

2015
Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection.
J. Oper. Res. Soc., 2015

2014
A randomised approximation algorithm for the hitting set problem.
Theor. Comput. Sci., 2014

2013
Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012
A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs.
Proceedings of the Design and Analysis of Algorithms, 2012

The b-Matching Problem in Hypergraphs: Hardness and Approximability.
Proceedings of the Combinatorial Optimization and Applications, 2012

2011
Inapproximability of <i>b</i>-Matching in <i>k</i>-Uniform Hypergraphs.
Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011


  Loading...