|
91 |
A polynomial time approximation scheme for MAX BISECTION on planar graphs
Jansen, Klaus. - Bonn : Inst. für Informatik, 2000
|
|
|
|
92 |
Approximability of dense instances of nearest codeword problem
Bazgan, Cristina. - Bonn : Inst. für Informatik, 2000
|
|
|
|
93 |
Approximation algorithms for max bisection on low degree regular graphs and planar graphs
Karpiński, Marek. - Bonn : Inst. für Informatik, 2000
|
|
|
|
94 |
Approximation hardness of TSP with bounded metrics
Engebretsen, Lars. - Bonn : Inst. für Informatik, 2000
|
|
|
|
95 |
Improved approximation of max cut on graphs of bounded degree
Feige, Uriel. - Bonn : Inst. für Informatik, 2000
|
|
|
|
96 |
Polynomial time approximation of dense weighted instances of MAX CUT
Fernandez de la Vega, Wenceslas. - Bonn : Inst. für Informatik, 2000
|
|
|
|
97 |
Polynomial time approximation schemes for some dense instances of NP hard optimization problems
Karpiński, Marek. - Bonn : Inst. für Informatik, 2000
|
|
|
|
98 |
Randomized splay trees
Albers, Susanne. - Dortmund : Dekanat Informatik, Univ., 2000
|
|
|
|
99 |
Randomized splay trees
Albers, Susanne. - Bonn : Inst. für Informatik, 2000
|
|
|
|
100 |
A generalization of Wilkie's theorem of the complement, and an application to Pfaffian closure
Karpiński, Marek. - Bonn : Inst. für Informatik, 1999
|
|
Administration
