3 citations · 3 across the 5 of their papers we have counts for
6 papers
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…
The Price of Anarchy in Bilateral Network Formation in an Adversary Model
Lasse Kliemann
We study network formation with the bilateral link formation rule (Jackson and Wolinsky 1996) with players and link cost . After the network is built, an adversary randoml…
The Price of Anarchy for Network Formation in an Adversary Model
Lasse Kliemann
We study network formation with n players and link cost α> 0. After the network is built, an adversary randomly deletes one link according to a certain probability distribution. Co…