default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLasse Kliemann
Person information
- affiliation: Christian Albrechts University Kiel, Department of Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j7]Lasse Kliemann:
The Price of Anarchy in Bilateral Network Formation in an Adversary Model. Algorithmica 77(3): 921-941 (2017)- [j6]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): 324 (2017) - [j5]Lasse Kliemann, Elmira Shirazi Sheykhdarabadi, Anand Srivastav:
Swap Equilibria under Link and Vertex Destruction. Games 8(1): 14 (2017) - 2016
- [c10]Lasse Kliemann, Christian Schielke, Anand Srivastav:
A Streaming Algorithm for the Undirected Longest Path Problem. ESA 2016: 56:1-56:17 - [p1]Lasse Kliemann:
Engineering a Bipartite Matching Algorithm in the Semi-Streaming Model. Algorithm Engineering 2016: 352-378 - [e1]Lasse Kliemann, Peter Sanders:
Algorithm Engineering - Selected Results and Surveys. Lecture Notes in Computer Science 9220, 2016, ISBN 978-3-319-49486-9 [contents] - [i5]Lasse Kliemann, Jan Schiemann, Anand Srivastav:
Finding Euler Tours in the StrSort Model. CoRR abs/1610.03412 (2016) - [i4]Lasse Kliemann, Elmira Shirazi Sheykhdarabadi, Anand Srivastav:
Swap Equilibria under Link and Vertex Destruction. CoRR abs/1611.05656 (2016) - 2015
- [i3]Lasse Kliemann, Elmira Shirazi Sheykhdarabadi, Anand Srivastav:
Price of Anarchy for Graph Coloring Games with Concave Payoff. CoRR abs/1507.08249 (2015) - 2014
- [c9]Lasse Kliemann:
Price of Anarchy in the Link Destruction (Adversary) Model. OR 2014: 285-291 - 2013
- [j4]Lasse Kliemann, Anand Srivastav:
Deutsch-indische Kooperation im Algorithm Engineering. Inform. Spektrum 36(2): 180-186 (2013) - [j3]Lasse Kliemann:
The price of anarchy in nonatomic consumption-relevance congestion games. Networks 62(2): 83-94 (2013) - [c8]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: 67-78 - [i2]Lasse Kliemann:
The Price of Anarchy in Bilateral Network Formation in an Adversary Model. CoRR abs/1308.1832 (2013) - 2012
- [j2]Sebastian Eggert, Lasse Kliemann, Peter Munstermann, Anand Srivastav:
Bipartite Matching in the Semi-streaming Model. Algorithmica 63(1-2): 490-508 (2012) - [i1]Lasse Kliemann:
The Price of Anarchy for Network Formation in an Adversary Model. CoRR abs/1202.5025 (2012) - 2011
- [j1]Lasse Kliemann:
The Price of Anarchy for Network Formation in an Adversary Model. Games 2(3): 302-332 (2011) - [c7]Lasse Kliemann:
Matching in Bipartite Graph Streams in a Small Number of Passes. SEA 2011: 254-266 - 2010
- [b1]Lasse Kliemann:
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). Kiel University, Germany, 2010 - [c6]Lasse Kliemann:
Brief announcement: the price of anarchy for distributed network formation in an adversary model. PODC 2010: 229-230
2000 – 2009
- 2009
- [c5]Lasse Kliemann, Anand Srivastav:
Models of Non-atomic Congestion Games - From Unicast to Multicast Routing. Algorithmics of Large and Complex Networks 2009: 292-318 - [c4]Sebastian Eggert, Lasse Kliemann, Anand Srivastav:
Bipartite Graph Matchings in the Semi-streaming Model. ESA 2009: 492-503 - [c3]Lasse Kliemann, Anand Srivastav:
Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching. SEA 2009: 185-196 - 2007
- [r1]Anand Srivastav, Lasse Kliemann:
Parallel Algorithms via the Probabilistic Method. Handbook of Parallel Computing 2007 - 2006
- [c2]Andreas Baltz, Sandro Esquivel, Lasse Kliemann, Anand Srivastav:
The Price of Anarchy in Selfish Multicast Routing. CAAN 2006: 5-18 - 2004
- [c1]Andreas Baltz, Lasse Kliemann:
Spectral Analysis. Network Analysis 2004: 373-416
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
