Lasse Kliemann

According to our database, Lasse Kliemann authored at least 22 papers between 2004 and 2017.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2017

Swap Equilibria under Link and Vertex Destruction.

Lasse Kliemann, Elmira Shirazi Sheykhdarabadi, Anand Srivastav

Games, 2017

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

Axel Wedemeyer, Lasse Kliemann, Anand Srivastav, Christian Schielke, Thorsten B. Reusch, Philip Rosenstiel

BMC Bioinform., 2017

The Price of Anarchy in Bilateral Network Formation in an Adversary Model.

Lasse Kliemann

Algorithmica, 2017

2016

Engineering a Bipartite Matching Algorithm in the Semi-Streaming Model.

Lasse Kliemann

Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016

Finding Euler Tours in the StrSort Model.

Lasse Kliemann, Jan Schiemann, Anand Srivastav

CoRR, 2016

A Streaming Algorithm for the Undirected Longest Path Problem.

Lasse Kliemann, Christian Schielke, Anand Srivastav

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Price of Anarchy for Graph Coloring Games with Concave Payoff.

Lasse Kliemann, Elmira Shirazi Sheykhdarabadi, Anand Srivastav

CoRR, 2015

2014

Price of Anarchy in the Link Destruction (Adversary) Model.

Lasse Kliemann

Proceedings of the Operations Research Proceedings 2014, 2014

2013

The price of anarchy in nonatomic consumption-relevance congestion games.

Lasse Kliemann

Networks, 2013

Deutsch-indische Kooperation im Algorithm Engineering.

Lasse Kliemann, Anand Srivastav

Inform. Spektrum, 2013

A New QEA Computing Near-Optimal Low-Discrepancy Colorings in the Hypergraph of Arithmetic Progressions.

Lasse Kliemann, Ole Kliemann, Chellapilla Patvardhan, Volkmar Sauerland, Anand Srivastav

Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

2012

Bipartite Matching in the Semi-streaming Model.

Sebastian Eggert, Lasse Kliemann, Peter Munstermann, Anand Srivastav

Algorithmica, 2012

2011

The Price of Anarchy for Network Formation in an Adversary Model.

Lasse Kliemann

Games, 2011

Matching in Bipartite Graph Streams in a Small Number of Passes.

Lasse Kliemann

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

2010

Networks and distributed operation: the price of anarchy in non-atomic routing and network formation (Netzwerke und verteilte Operation: Der Preis der Anarchie in nicht-atomarem Routing und Netzwerkformierung)

Lasse Kliemann

PhD thesis, 2010

Brief announcement: the price of anarchy for distributed network formation in an adversary model.

Lasse Kliemann

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2009

Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching.

Lasse Kliemann, Anand Srivastav

Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

Bipartite Graph Matchings in the Semi-streaming Model.

Sebastian Eggert, Lasse Kliemann, Anand Srivastav

Proceedings of the Algorithms, 2009

Models of Non-atomic Congestion Games - From Unicast to Multicast Routing.

Lasse Kliemann, Anand Srivastav

Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

2007

Parallel Algorithms via the Probabilistic Method.

Anand Srivastav, Lasse Kliemann

Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

2006

The Price of Anarchy in Selfish Multicast Routing.

Andreas Baltz, Sandro Esquivel, Lasse Kliemann, Anand Srivastav

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

2004

Spectral Analysis.

Andreas Baltz, Lasse Kliemann

Proceedings of the Network Analysis: Methodological Foundations [outcome of a Dagstuhl seminar, 2004