|
|
|
|
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 |
| 1 | Sebastian Eggert, Lasse Kliemann, Peter Munstermann, Anand Srivastav |
Bipartite Matching in the Semi-streaming Model.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Lasse Kliemann |
The Price of Anarchy for Network Formation in an Adversary Model  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Lasse Kliemann |
The Price of Anarchy for Network Formation in an Adversary Model.  |
Games  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Lasse Kliemann |
Matching in Bipartite Graph Streams in a Small Number of Passes.  |
SEA  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Lasse Kliemann |
Brief announcement: the price of anarchy for distributed network formation in an adversary model.  |
PODC  |
2010 |
DBLP DOI BibTeX RDF |
pairwise nash equilibrium, pairwise stability, game theory, nash equilibrium, price of anarchy, network formation |
| 1 | Sebastian Eggert, Lasse Kliemann, Anand Srivastav |
Bipartite Graph Matchings in the Semi-streaming Model.  |
ESA  |
2009 |
DBLP DOI BibTeX RDF |
approx, algorithms, streaming algorithms, bipartite graph matching |
| 1 | Lasse Kliemann, Anand Srivastav |
Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching.  |
SEA  |
2009 |
DBLP DOI BibTeX RDF |
hypergraph matching, approximation algorithms, greedy algorithms, hybrid algorithms, NP-hard problems, randomized rounding |
| 1 | Lasse Kliemann, Anand Srivastav |
Models of Non-atomic Congestion Games - From Unicast to Multicast Routing.  |
Algorithmics of Large and Complex Networks ![In: Algorithmics of Large and Complex Networks - Design, Analysis, and Simulation [DFG priority program 1126], pp. 292-318, 2009, Springer, 978-3-642-02093-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
non-atomic congestion games, Wardrop model, unicast routing, multicast routing, price of anarchy |
| 1 | Andreas Baltz, Sandro Esquivel, Lasse Kliemann, Anand Srivastav |
The Price of Anarchy in Selfish Multicast Routing.  |
CAAN  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Baltz, Lasse Kliemann |
Spectral Analysis.  |
Network Analysis ![In: Network Analysis: Methodological Foundations [outcome of a Dagstuhl seminar, 13-16 April 2004], pp. 373-416, 2004, Springer, 3-540-24979-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #10 of 10 (100 per page; Change: )
|
|