A. Srivastav

activity

20172021

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

1 citations · 1 across the 3 of their papers we have counts for

collaborators

5 papers

math.AP2021

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…

math.CO2021

Repeated randomized algorithm for the Multicovering Problem

Abbass Gorgi, Mourad El Ouali, Anand Srivastav +1

Let $H = (V, E)$ be a hypergraph with maximum edge size $ℓ$ and maximum degree $Δ$ . For given numbers $b_{v} \in N_{\geq 2}$ , $v \in V$ , a set multicover i…

math.CO2020

Approximation algorithm for the Multicovering Problem

Abbass Gorgi, Mourad El Ouali, Anand Srivastav +1

Let $H = (V, E)$ be a hypergraph with maximum edge size $ℓ$ and maximum degree $Δ$ . For given numbers $b_{v} \in N_{\geq 2}$ , $v \in V$ , a set multicover i…

math.CO2018

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 $n, q \in N$ , the $(n, q)$ -triangle game is played by two players,…

cs.DS2017★ 1 cited

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…