|
11 |
Limits of CSP problems and efficient parameter testing
Karpiński, Marek. - Bonn : Institut für Informatik, Universität Bonn, Juni 2014
|
|
|
|
12 |
A compendium on Steiner Tree Problems
Hauptmann, Mathias. - Bonn : Inst. für Informatik, 2013
|
|
|
|
13 |
Algorithmic perspectives of network transitive reduction problems and their applications to synthesis and analysis of biological networks
Aditya, Satabdi. - Bonn : Inst. für Informatik, 2013
|
|
|
|
14 |
Approximation hardness of graphic TSP on cubic graphs
Karpiński, Marek. - Bonn : Inst. für Informatik, 2013
|
|
|
|
15 |
Improved inapproximability results for the shortest superstring and the bounded metric TSP
Karpiński, Marek. - Bonn : Inst. für Informatik, 2013
|
|
|
|
16 |
Inapproximability of dominating set in power law graphs
Gast, Mikael. - Bonn : Inst. für Informatik, 2013, rev. version
|
|
|
|
17 |
New inapproximability bounds for TSP
Karpiński, Marek. - Bonn : Inst. für Informatik, 2013
|
|
|
|
18 |
Approximate counting of matchings in sparse hypergraphs
Karpiński, Marek. - Bonn : Inst. für Informatik, 2012
|
|
|
|
19 |
Approximate counting of matchings in sparse uniform hypergraphs
Karpiński, Marek. - Bonn : Inst. für Informatik, 2012
|
|
|
|
20 |
Improved approximation lower bounds for vertex cover on power law graphs and some generalizations
Gast, Mikael. - Bonn : Inst. für Informatik, 2012
|
|
Administration
