Spectral Analysis. - Andreas Baltz; Lasse Kliemann (Network Analysis, 2004)

The Price of Anarchy in Selfish Multicast Routing. - Andreas Baltz; Sandro Esquivel; Lasse Kliemann; Anand Srivastav (CAAN, 2006)

Parallel Algorithms via the Probabilistic Method. - Anand Srivastav; Lasse Kliemann (Handbook of Parallel Computing, 2007)

Models of Non-atomic Congestion Games - From Unicast to Multicast Routing. - Lasse Kliemann; Anand Srivastav (Algorithmics of Large and Complex Networks, 2009)

Bipartite Graph Matchings in the Semi-streaming Model. - Sebastian Eggert; Lasse Kliemann; Anand Srivastav (ESA, 2009)

Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching. - Lasse Kliemann; Anand Srivastav (SEA, 2009)

Brief announcement: the price of anarchy for distributed network formation in an adversary model. - Lasse Kliemann (PODC, 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 (2010)

Matching in Bipartite Graph Streams in a Small Number of Passes. - Lasse Kliemann (SEA, 2011)

The Price of Anarchy for Network Formation in an Adversary Model. - Lasse Kliemann (Games, 2011)

Bipartite Matching in the Semi-streaming Model. - Sebastian Eggert; Lasse Kliemann; Peter Munstermann; Anand Srivastav (Algorithmica, 2012)

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 (SEA, 2013)

Deutsch-indische Kooperation im Algorithm Engineering. - Lasse Kliemann; Anand Srivastav (Inform. Spektrum, 2013)

The price of anarchy in nonatomic consumption-relevance congestion games. - Lasse Kliemann (Networks, 2013)

Price of Anarchy in the Link Destruction (Adversary) Model. - Lasse Kliemann (OR, 2014)

Price of Anarchy for Graph Coloring Games with Concave Payoff. - Lasse Kliemann; Elmira Shirazi Sheykhdarabadi; Anand Srivastav (CoRR, 2015)

A Streaming Algorithm for the Undirected Longest Path Problem. - Lasse Kliemann; Christian Schielke; Anand Srivastav (ESA, 2016)

Finding Euler Tours in the StrSort Model. - Lasse Kliemann; Jan Schiemann; Anand Srivastav (CoRR, 2016)

Engineering a Bipartite Matching Algorithm in the Semi-Streaming Model. - Lasse Kliemann (Algorithm Engineering, 2016)

The Price of Anarchy in Bilateral Network Formation in an Adversary Model. - Lasse Kliemann (Algorithmica, 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)

Swap Equilibria under Link and Vertex Destruction. - Lasse Kliemann; Elmira Shirazi Sheykhdarabadi; Anand Srivastav (Games, 2017)