Explanipedia

Asymptotic Thresholds for (a:b) Minimum-Degree Games Open

Adnane Fouadi, Mourad El Ouali, Anand Srivastav · 2025

We investigate the (a:b) Maker–Breaker subgraph game played on the edge set of the complete graph Kn, where n,a,b∈N, and Maker’s objective is to construct a member of a prescribed family of graphs H, while Breaker aims to prevent this. In …

A Constructive Winning Maker Strategy in the Maker-Breaker $C_4$-Game Open

Matthias Sowa, Anand Srivastav · 2025

Maker-Breaker subgraph games are among the most famous combinatorial games. For given $n,q\in \mathbb{N}$ and a subgraph $C$ of the complete graph $K_n$, the two players, called Maker and Breaker, alternately claim edges of $K_n$. In each …

Chromatic number of randomly augmented graphs Open

Jan Geest, Anand Srivastav · 2024

An extension of the Erdős-Renyi random graph model $G_{n,p}$ is the model of perturbed graphs introduced by Bohman, Frieze and Martin (Bohman, Frieze, Martin 2003). This is a special case of the model of randomly augmented graphs studied i…

Asymptotically Optimal Threshold Bias for the $(a : b)$ Maker-Breaker Minimum Degree, Connectivity and Hamiltonicity Games Open

Adnane Fouadi, Mourad El Ouali, Anand Srivastav · 2024

We study the $(a:b)$ Maker-Breaker subgraph game played on the edges of the complete graph $K_n$ on $n$ vertices, $n,a,b \in \mathbb{N}$ where the goal of Maker is to build a copy of a specific fixed subgraph $H$. In our work this is a spa…

A Constructive Winning Maker Strategy in the Maker-Breaker $C_4$-Game Open

Anand Srivastav, Matthias Sowa · 2024

Maker-Breaker subgraph games are among the most famous combinatorial games. For given $n,q \in \mathbb{N}$ and a subgraph $C$ of the complete graph $K_n$, the two players, called Maker and Breaker, alternately claim edges of $K_n$. In each…

A One Pass Streaming Algorithm for Finding Euler Tours Open

Christian Glazik, Jan Schiemann, Anand Srivastav · 2022

Given an undirected graph G on n nodes and m edges in the form of a data stream we study the problem of finding an Euler tour in G . Our main result is the first one-pass streaming algorithm computing an Euler tour of G in the form of an e…

Neuronal networks underlying ictal and subclinical discharges in childhood absence epilepsy Open

Ami Kumar, E. Lyzhko, Laith Hamid, Anand Srivastav, Ulrich Stephani , et al. · 2022

Algorithms for Big Data Problems in de Novo Genome Assembly Open

Anand Srivastav, Axel Wedemeyer, Christian Schielke, Jan Schiemann · 2022

De novo genome assembly is a fundamental task in life sciences. It is mostly a typical big data problem with sometimes billions of reads, a big puzzle in which the genome is hidden. Memory and time efficient algorithms are sought, preferab…

Hemivariational Inequalities on Graphs Open

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

In this paper, a new class of hemivariational inequalities is introduced. It concerns Laplace operator on locally finite graphs together with multivalued nonmonotone nonlinearities expressed in terms of Clarke's subdifferential. First of a…

Repeated randomized algorithm for the Multicovering Problem Open

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

Let $\mathcal{H}=(V,\mathcal{E})$ be a hypergraph with maximum edge size $\ell$ and maximum degree $Δ$. For given numbers $b_v\in \mathbb{N}_{\geq 2}$, $v\in V$, a set multicover in $\mathcal{H}$ is a set of edges $C \subseteq \mathcal{E}$…

Approximation algorithm for the multicovering problem Open

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

Multiobjective Calibration of a Global Biogeochemical Ocean Model Against Nutrients, Oxygen, and Oxygen Minimum Zones Open

Volkmar Sauerland, Iris Kriest, Andreas Oschlies, Anand Srivastav · 2019

Global biogeochemical ocean models rely on many parameters, which govern the interaction between individual components, and their response to the physical environment. They are often assessed/calibrated against quasi‐synoptic data sets of …

A new Bound for the Maker-Breaker Triangle Game Open

Christian Glazik, Anand Srivastav · 2018

The triangle game introduced by Chvátal and Erdős (1978) is one of the most famous combinatorial games. For $n,q\in\mathbb{N}$, the $(n,q)$-triangle game is played by two players, called Maker and Breaker, on the complete graph $K_n$. Alte…

Error assessment of biogeochemical models by lower bound methods (NOMMA-1.0) Open

Volkmar Sauerland, Ulrike Löptien, Claudine Leonhard, Andreas Oschlies, Anand Srivastav · 2018

Biogeochemical models, capturing the major feedbacks of the pelagic ecosystem of the world ocean, are today often embedded into Earth system models which are increasingly used for decision making regarding climate policies. These models co…

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

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

Mastermind is a two players zero sum game of imperfect information. Starting with Erdős and Rényi (1963), its combinatorics have been studied to date by several authors, e.g., Knuth (1977), Chvátal (1983), Goodrich (2009). The first player…

Finding Euler Tours in One Pass in the W-Streaming Model with O(n log(n)) RAM Open

Christian Glazik, Jan Schiemann, Anand Srivastav · 2017

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. Our main result is the first one pass W-Streaming algorithm …

Finding Euler Tours in One Pass in the W-Streaming Model with O(n\n log(n)) RAM Open

Christian Glazik, Jan Schiemann, Anand Srivastav · 2017

We study the problem of finding an Euler tour in an undirected graph G in the\nW-Streaming model with O(n polylog(n)) RAM, where n resp. m is the number of\nnodes resp. edges of G. Our main result is the first one pass W-Streaming\nalgorit…

An improved filtering algorithm for big read datasets and its application to single-cell assembly Open

Axel Wedemeyer, Lasse Kliemann, Anand Srivastav, Christian Schielke, Thorsten B. H. Reusch , et al. · 2017

Error assessment of biogeochemical models by lower bound methods Open

Volkmar Sauerland, Ulrike Löptien, Claudine Leonhard, Andreas Oschlies, Anand Srivastav · 2017

Biogeochemical models, capturing the major feedbacks of the pelagic ecosystem of the world ocean, are today often embedded into Earth System models which are increasingly used for decision making regarding climate policies. These models co…

Swap Equilibria under Link and Vertex Destruction Open

Lasse Kliemann, Elmira Shirazi Sheykhdarabadi, Anand Srivastav · 2017

We initiate the study of the destruction or adversary model (Kliemann 2010) using the swap equilibrium (SE) stability concept (Alon et al., 2010). The destruction model is a network formation game incorporating the robustness of a network …

Calibrating a global three-dimensional biogeochemical ocean model (MOPS-1.0) Open

Iris Kriest, Volkmar Sauerland, Samar Khatiwala, Anand Srivastav, Andreas Oschlies · 2017

Global biogeochemical ocean models contain a variety of different biogeochemical components and often much simplified representations of complex dynamical interactions, which are described by many ( ≈ 10 to ≈ 100) parameters. The values of…

Price of anarchy for graph coloring games with concave payoff Open

Lasse Kliemann, Elmira Shirazi Sheykhdarabadi, Anand Srivastav · 2016

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, and the strategy space of each player is the set of color…

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

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

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 to break the secret code by making as few guesses as possib…

Swap Equilibria under Link and Vertex Destruction Open

Lasse Kliemann, Elmira Shirazi Sheykhdarabadi, Anand Srivastav · 2016

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 by Alon et. al (2010). The destruction model is a network …

Finding Euler Tours in the StrSort Model Open

Lasse Kliemann, Jan Schiemann, Anand Srivastav · 2016

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 stream of its edges and can only be read sequentially, but whil…

An Improved Filtering Algorithm for Big Read Datasets Open

Axel Wedemeyer, Lasse Kliemann, Anand Srivastav, Christian Schielke, Thorsten B. H. Reusch , et al. · 2016

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 the reads produced. This leads to huge datasets with lots …

Calibrating a global three-dimensional biogeochemical ocean model (MOPS-1.0) Open

Iris Kriest, Volkmar Sauerland, Samar Khatiwala, Anand Srivastav, Andreas Oschlies · 2016

Global biogeochemical ocean models contain a variety of different biogeochemical components and often much simplified representations of complex dynamical interactions, which are described by many (≈10–≈100) parameters. The values of many …

A Streaming Algorithm for the Undirected Longest Path Problem Open

Lasse Kliemann, Christian Schielke, Anand Srivastav · 2016

We present the first streaming algorithm for the longest path problem in undirected graphs. The input graph is given as a stream of edges and RAM is limited to only a linear number of edges at a time (linear in the number of vertices n). W…

Anand Srivastav YOU? Author Swipe