| 2009 | ||
|---|---|---|
| 5 | Lasse Kliemann, Anand Srivastav: Models of Non-atomic Congestion Games - From Unicast to Multicast Routing. Algorithmics of Large and Complex Networks 2009: 292-318 | |
| 4 | Sebastian Eggert, Lasse Kliemann, Anand Srivastav: Bipartite Graph Matchings in the Semi-streaming Model. ESA 2009: 492-503 | |
| 3 | Lasse Kliemann, Anand Srivastav: Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching. SEA 2009: 185-196 | |
| 2006 | ||
| 2 | Andreas Baltz, Sandro Esquivel, Lasse Kliemann, Anand Srivastav: The Price of Anarchy in Selfish Multicast Routing. CAAN 2006: 5-18 | |
| 2004 | ||
| 1 | Andreas Baltz, Lasse Kliemann: Spectral Analysis. Network Analysis 2004: 373-416 | |
| 1 | Andreas Baltz | [1] [2] |
| 2 | Sebastian Eggert | [4] |
| 3 | Sandro Esquivel | [2] |
| 4 | Anand Srivastav | [2] [3] [4] [5] |