|
31 |
Range reporting for moving points on a grid
Karpiński, Marek. - Bonn : Inst. für Informatik, 2010
|
|
|
|
32 |
Approximating transitive reductions for directed networks
Berman, Piotr. - Bonn : Inst. für Informatik, 2009, Rev. version
|
|
|
|
33 |
Exact and approximation algorithms for geometric and capacitated set cover problems with applications
Berman, Piotr. - Bonn : Inst. für Informatik, 2009
|
|
|
|
34 |
1.25 approximation algorithm for the Steiner tree problem with distances one and two
Berman, Piotr. - Bonn : Inst. für Informatik, 2008
|
|
|
|
35 |
Approximating transitivity in directed networks
Berman, Piotr. - Bonn : Inst. für Informatik, 2008
|
|
|
|
36 |
Linear time approximation schemes for the Gale Berlekamp game and related minimization problems
Karpiński, Marek. - Bonn : Inst. für Informatik, 2008
|
|
|
|
37 |
Schemes for deterministic polynomial factoring
Ivanyos, Gábor. - Bonn : Inst. für Informatik, 2008
|
|
|
|
38 |
Searching for frequent colors in rectangles
Karpiński, Marek. - Bonn : Inst. für Informatik, 2008
|
|
|
|
39 |
Space-efficient multi-dimensional range reporting
Karpiński, Marek. - Bonn : Inst. für Informatik, 2008
|
|
|
|
40 |
The mixing rate of Glauber dynamics for Smpling colourings of regular trees with few colours
Goldberg, Leslie Ann. - Bonn : Inst. für Informatik, 2008
|
|
Administration
