|
1 |
Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields
Enthalten in Algorithmica 5.1.2017: 1-16
|
|
|
2 |
A QPTAS for the base of the number of crossing-free structures of a planar point set
Karpiński, Marek. - Bonn : Institut für Informatik, Universität Bonn, Februar 2015
|
|
|
|
3 |
Inapproximability of dominating set on power law graphs
Gast, Mikael. - Bonn : Institut für Informatik, Universität Bonn, Februar 2015, (Revised version)
|
|
|
|
4 |
On the approximability of independent set problem on power law graphs
Hauptmann, Mathias. - Bonn : Institut für Informatik, März 2015
|
|
|
|
5 |
On the complexity of nondeterministically testable hypergraph parameters
Karpiński, Marek. - Bonn : Institut für Informatik, März 2015
|
|
|
|
6 |
Polynomial interpolation and identity testing from high powers over finite fields
Ivanyos, Gábor. - Bonn : Institut für Informatik, Universität Bonn, Februar 2015
|
|
|
|
7 |
Towards better inapproximability bounds for TSP
Karpiński, Marek. - Bonn : Institut für Informatik, Universität Bonn, Juni 2015
|
|
|
|
8 |
A QPTAS for the base of the number of triangulations of a planar point set
Karpiński, Marek. - Bonn : Institut für Informatik, Universität Bonn, September 2014
|
|
|
|
9 |
Complexity of nondeterministic graph parameter testing
Karpiński, Marek. - Bonn : Institut für Informatik, Universität Bonn, August 2014
|
|
|
10 |
Generalized Wong sequences and their applications to Edmonds' problems
Ivanyos, Gábor. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2014
|
|
Administration
