The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Lasse Kliemann" ( http://dblp.L3S.de/Authors/Lasse_Kliemann )

  Author page on DBLP  Author page in RDF  Community of Lasse Kliemann in ASPL-2

Publication years (Num. hits)
2004-2012 (10)
Publication types (Num. hits)
article(3) inproceedings(7)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 14 occurrences of 13 keywords

Results
Found 10 publication records. Showing 10 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Sebastian Eggert, Lasse Kliemann, Peter Munstermann, Anand Srivastav Bipartite Matching in the Semi-streaming Model. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Lasse Kliemann The Price of Anarchy for Network Formation in an Adversary Model Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Lasse Kliemann The Price of Anarchy for Network Formation in an Adversary Model. Search on Bibsonomy Games The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Lasse Kliemann Matching in Bipartite Graph Streams in a Small Number of Passes. Search on Bibsonomy SEA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Lasse Kliemann Brief announcement: the price of anarchy for distributed network formation in an adversary model. Search on Bibsonomy PODC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF pairwise nash equilibrium, pairwise stability, game theory, nash equilibrium, price of anarchy, network formation
1Sebastian Eggert, Lasse Kliemann, Anand Srivastav Bipartite Graph Matchings in the Semi-streaming Model. Search on Bibsonomy ESA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF approx, algorithms, streaming algorithms, bipartite graph matching
1Lasse Kliemann, Anand Srivastav Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching. Search on Bibsonomy SEA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF hypergraph matching, approximation algorithms, greedy algorithms, hybrid algorithms, NP-hard problems, randomized rounding
1Lasse Kliemann, Anand Srivastav Models of Non-atomic Congestion Games - From Unicast to Multicast Routing. Search on Bibsonomy Algorithmics of Large and Complex Networks The full citation details ... 2009 DBLP  DOI  BibTeX  RDF non-atomic congestion games, Wardrop model, unicast routing, multicast routing, price of anarchy
1Andreas Baltz, Sandro Esquivel, Lasse Kliemann, Anand Srivastav The Price of Anarchy in Selfish Multicast Routing. Search on Bibsonomy CAAN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Andreas Baltz, Lasse Kliemann Spectral Analysis. Search on Bibsonomy Network Analysis The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #10 of 10 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.