Lasse Kliemann

According to our database1, Lasse Kliemann authored at least 21 papers between 2004 and 2017.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Swap Equilibria under Link and Vertex Destruction.
Games, 2017

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

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

2016
Engineering a Bipartite Matching Algorithm in the Semi-Streaming Model.
Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016

Finding Euler Tours in the StrSort Model.
CoRR, 2016

A Streaming Algorithm for the Undirected Longest Path Problem.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
Price of Anarchy for Graph Coloring Games with Concave Payoff.
CoRR, 2015

2014
Price of Anarchy in the Link Destruction (Adversary) Model.
Proceedings of the Operations Research Proceedings 2014, 2014

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

Deutsch-indische Kooperation im Algorithm Engineering.
Informatik Spektrum, 2013

A New QEA Computing Near-Optimal Low-Discrepancy Colorings in the Hypergraph of Arithmetic Progressions.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

2012
Bipartite Matching in the Semi-streaming Model.
Algorithmica, 2012

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

Matching in Bipartite Graph Streams in a Small Number of Passes.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

2010
Brief announcement: the price of anarchy for distributed network formation in an adversary model.
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.
Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

Bipartite Graph Matchings in the Semi-streaming Model.
Proceedings of the Algorithms, 2009

Models of Non-atomic Congestion Games - From Unicast to Multicast Routing.
Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

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

2006
The Price of Anarchy in Selfish Multicast Routing.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

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


  Loading...