default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMourad El Ouali
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j9]Nouhayla Ait Oussaid
, Khalid Akhlil, Sultana Ben Aadi, Mourad El Ouali, Anand Srivastav:
Hemivariational inequalities on graphs. Comput. Appl. Math. 41(4) (2022)- 2021
- [j8]Abbass Gorgi, Mourad El Ouali, Anand Srivastav, Mohamed Hachimi:
Approximation algorithm for the multicovering problem. J. Comb. Optim. 41(2): 433-450 (2021) - 2020
- [j7]Mourad El Ouali, Volkmar Sauerland:
The Exact Query Complexity of Yes-No Permutation Mastermind. Games 11(2): 19 (2020) - [j6]Abbass Gorgi, Mourad El Ouali, Anand Srivastav, Mohamed Hachimi:
Approximation of set multi-cover via hypergraph matching. Theor. Comput. Sci. 845: 136-143 (2020) - [i4]Abbass Gorgi, Mourad El Ouali, Anand Srivastav, Mohamed Hachimi:
Approximation algorithm for the Multicovering Problem. CoRR abs/2003.06936 (2020) - [i3]Mourad El Ouali, Volkmar Sauerland:
The Exact Query Complexity of Yes-No Permutation Mastermind. CoRR abs/2003.11538 (2020)
2010 – 2019
- 2018
- [j5]Mourad El Ouali, Christian Glazik, Volkmar Sauerland, Anand Srivastav:
On the Query Complexity of Black-Peg AB-Mastermind. Games 9(1): 2 (2018) - 2016
- [j4]Mourad El Ouali, Peter Munstermann, Anand Srivastav:
Randomized Approximation for the Set Multicover Problem in Hypergraphs. Algorithmica 74(2): 574-588 (2016) - [j3]Mourad El Ouali, Helena Fohlin, Anand Srivastav:
An approximation algorithm for the partial vertex cover problem in hypergraphs. J. Comb. Optim. 31(2): 846-864 (2016) - [i2]Mourad El Ouali, Christian Glazik, Volkmar Sauerland, Anand Srivastav:
On the Query Complexity of Black-Peg AB-Mastermind. CoRR abs/1611.05907 (2016) - 2015
- [j2]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): 615-626 (2015) - 2014
- [j1]Mourad El Ouali, Helena Fohlin, Anand Srivastav:
A randomised approximation algorithm for the hitting set problem. Theor. Comput. Sci. 555: 23-34 (2014) - 2013
- [b1]Mourad El Ouali:
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). Kiel University, Germany, 2013 - [c5]Mourad El Ouali, Volkmar Sauerland:
Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation. IWOCA 2013: 443-447 - [c4]Mourad El Ouali, Helena Fohlin, Anand Srivastav:
A Randomised Approximation Algorithm for the Hitting Set Problem. WALCOM 2013: 101-113 - [i1]Mourad El Ouali, Volkmar Sauerland:
Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation. CoRR abs/1303.5862 (2013) - 2012
- [c3]Mourad El Ouali, Gerold Jäger:
The b-Matching Problem in Hypergraphs: Hardness and Approximability. COCOA 2012: 200-211 - [c2]Mourad El Ouali, Helena Fohlin, Anand Srivastav:
A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs. MedAlg 2012: 174-187 - 2011
- [c1]Mourad El Ouali, Antje Fretwurst, Anand Srivastav:
Inapproximability of b-Matching in k-Uniform Hypergraphs. WALCOM 2011: 57-69
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
