2 citations · 2 across the 4 of their papers we have counts for
7 papers
Chromatic number of randomly augmented graphs
Jan Geest, Anand Srivastav
An extension of the Erdős-Renyi random graph model is the model of perturbed graphs introduced by Bohman, Frieze and Martin (Bohman, Frieze, Martin 2003). This is a speci…
A Constructive Winning Maker Strategy in the Maker-Breaker -Game
Matthias Sowa, Anand Srivastav
Maker-Breaker subgraph games are among the most famous combinatorial games. For given and a subgraph of the complete graph , the two players, called M…
Asymptotically Optimal Threshold Bias for the Maker-Breaker Minimum Degree, Connectivity and Hamiltonicity Games
Adnane Fouadi, Mourad El Ouali, Anand Srivastav
We study the Maker-Breaker subgraph game played on the edges of the complete graph on vertices, where the goal of Maker is to build a copy…
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…