2 citations · 3 across the 8 of their papers we have counts for
10 papers
Hemivariational Inequalities on Graphs
Nouhayla Ait Oussaid, Khalid Akhlil, Sultana Ben Aadi +2
In this paper, a new class of hemivariational inequalities is introduced. It concerns Laplace operator on locally finite graphs together with multivalued nonmonotone nonlinearities…
Repeated randomized algorithm for the Multicovering Problem
Abbass Gorgi, Mourad El Ouali, Anand Srivastav +1
Let be a hypergraph with maximum edge size and maximum degree . For given numbers , , a set multicover i…
Approximation algorithm for the Multicovering Problem
Abbass Gorgi, Mourad El Ouali, Anand Srivastav +1
Let be a hypergraph with maximum edge size and maximum degree . For given numbers , , a set multicover i…
A new Bound for the Maker-Breaker Triangle Game
Christian Glazik, Anand Srivastav
The triangle game introduced by Chvátal and Erdős (1978) is one of the most famous combinatorial games. For , the -triangle game is played by two players,…
Finding Euler Tours in One Pass in the W-Streaming Model with O(n log(n)) RAM
Christian Glazik, Jan Schiemann, Anand Srivastav
We study the problem of finding an Euler tour in an undirected graph G in the W-Streaming model with O(n polylog(n)) RAM, where n resp. m is the number of nodes resp. edges of G. O…
On the Query Complexity of Black-Peg AB-Mastermind
Mourad El Ouali, Christian Glazik, Volkmar Sauerland +1
Mastermind game is a two players zero sum game of imperfect information. The first player, called codemaker, chooses a secret code and the second player, called codebreaker, tries…
Swap Equilibria under Link and Vertex Destruction
Lasse Kliemann, Elmira Shirazi Sheykhdarabadi, Anand Srivastav
We initiate the study of the \emph{destruction model} (\aka \emph{adversary model}) introduced by Kliemann (2010), using the stability concept of \emph{swap equilibrium} introduced…
An Improved Filtering Algorithm for Big Read Datasets
Axel Wedemeyer, Lasse Kliemann, Anand Srivastav +3
For single-cell or metagenomic sequencing projects, it is necessary to sequence with a very high mean coverage in order to make sure that all parts of the sample DNA get covered by…
Finding Euler Tours in the StrSort Model
Lasse Kliemann, Jan Schiemann, Anand Srivastav
We present a first algorithm for finding Euler tours in undirected graphs in the StrSort model. This model is a relaxation of the semi streaming model. The graph is given as a stre…
Price of Anarchy for Graph Coloring Games with Concave Payoff
Lasse Kliemann, Elmira Shirazi Sheykhdarabadi, Anand Srivastav
We study the price of anarchy in a class of graph coloring games (a subclass of polymatrix common-payoff games). In those games, players are vertices of an undirected, simple graph…