|
1 |
Batch dynamic single source shortest path algorithms
Bauer, Reinhard. - Karlsruhe : Univ., Fak. für Informatik, 2009
|
|
|
|
2 |
Computing large matchings in planar graphs with fixed minimum degree
Franke, Robert. - Karlsruhe : Univ., Fak. für Informatik, 2009
|
|
|
|
3 |
Dynamic graph clustering using minimum-cut trees
Görke, Robert. - Karlsruhe : Univ., Fak. für Informatik, 2009
|
|
|
|
4 |
On the complexity of scheduling with power control in geometric SINR
Völker, Markus. - Karlsruhe : Univ., Fak. für Informatik, 2009
|
|
|
|
5 |
Impact of shortcuts on speedup techniques
Bauer, Reinhard. - Karlsruhe : Univ., Fak. für Informatik, 2008
|
|
|
|
6 |
Algorithms for sensor and ad hoc networks
Berlin : Springer, 2007
|
|
|
|
7 |
Comparing clusterings
Wagner, Silke. - Karlsruhe : Univ., Fak. für Informatik, 2007
|
|
|
|
8 |
Shortest path indices
Bauer, Reinhard. - Karlsruhe : Univ., Fak. für Informatik, Bibliothek, 2007
|
|
|
|
9 |
Maximum rigid components as means for direction based localization in sensor networks
Katz, Bastian. - Karlsruhe : Univ., Fak. für Informatik, Bibliothek, 2006
|
|
|
|
10 |
Approximating clustering-coefficient and transitivity
Schank, Thomas. - Karlsruhe : Univ., Fak. für Informatik, Bibl., 2004
|
|
Administration
