Lasse Kliemann

Publication Activity (10 Years)

Years Active: 2004-2017
Publications (10 Years): 6

Top Topics

Payoff Functions

Congestion Games

Quantum Inspired Evolutionary Algorithm

Nash Equilibria

Top Venues

Inform. Spektrum

Publications

Lasse Kliemann, Elmira Shirazi Sheykhdarabadi, Anand Srivastav
Swap Equilibria under Link and Vertex Destruction. Games 8 (1) (2017)
Axel Wedemeyer, Lasse Kliemann, Anand Srivastav, Christian Schielke, Thorsten B. Reusch, Philip Rosenstiel
An improved filtering algorithm for big read datasets and its application to single-cell assembly. BMC Bioinform. 18 (1) (2017)
Lasse Kliemann
The Price of Anarchy in Bilateral Network Formation in an Adversary Model. Algorithmica 77 (3) (2017)
Lasse Kliemann, Jan Schiemann, Anand Srivastav
Finding Euler Tours in the StrSort Model. CoRR (2016)
Lasse Kliemann, Christian Schielke, Anand Srivastav
A Streaming Algorithm for the Undirected Longest Path Problem. ESA (2016)
Lasse Kliemann, Elmira Shirazi Sheykhdarabadi, Anand Srivastav
Swap Equilibria under Link and Vertex Destruction. CoRR (2016)
Lasse Kliemann, Elmira Shirazi Sheykhdarabadi, Anand Srivastav
Price of Anarchy for Graph Coloring Games with Concave Payoff. CoRR (2015)
Lasse Kliemann
Price of Anarchy in the Link Destruction (Adversary) Model. OR (2014)
Lasse Kliemann, Ole Kliemann, Chellapilla Patvardhan, Volkmar Sauerland, Anand Srivastav
A New QEA Computing Near-Optimal Low-Discrepancy Colorings in the Hypergraph of Arithmetic Progressions. SEA (2013)
Lasse Kliemann, Anand Srivastav
Deutsch-indische Kooperation im Algorithm Engineering. Inform. Spektrum 36 (2) (2013)
Lasse Kliemann
The price of anarchy in nonatomic consumption-relevance congestion games. Networks 62 (2) (2013)
Lasse Kliemann
The Price of Anarchy in Bilateral Network Formation in an Adversary Model. CoRR (2013)
Sebastian Eggert, Lasse Kliemann, Peter Munstermann, Anand Srivastav
Bipartite Matching in the Semi-streaming Model. Algorithmica 63 (1-2) (2012)
Lasse Kliemann
The Price of Anarchy for Network Formation in an Adversary Model CoRR (2012)
Lasse Kliemann
The Price of Anarchy for Network Formation in an Adversary Model. Games 2 (3) (2011)
Lasse Kliemann
Matching in Bipartite Graph Streams in a Small Number of Passes. SEA (2011)
Lasse Kliemann
Brief announcement: the price of anarchy for distributed network formation in an adversary model. PODC (2010)
Sebastian Eggert, Lasse Kliemann, Anand Srivastav
Bipartite Graph Matchings in the Semi-streaming Model. ESA (2009)
Lasse Kliemann, Anand Srivastav
Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching. SEA (2009)
Lasse Kliemann, Anand Srivastav
Models of Non-atomic Congestion Games - From Unicast to Multicast Routing. Algorithmics of Large and Complex Networks (2009)
Andreas Baltz, Sandro Esquivel, Lasse Kliemann, Anand Srivastav
The Price of Anarchy in Selfish Multicast Routing. CAAN (2006)
Andreas Baltz, Lasse Kliemann
Spectral Analysis. Network Analysis (2004)