|
21 |
Improved inapproximability results for the shortest superstring and related problems
Karpiński, Marek. - Bonn : Inst. für Informatik, 2012
|
|
|
|
22 |
On approximation lower bounds for TSP with bounded metrics
Karpiński, Marek. - Bonn : Inst. für Informatik, 2012
|
|
|
|
23 |
Optimal cuts and bisections on the real line polynomial time
Karpiński, Marek. - Bonn : Inst. für Informatik, 2012
|
|
|
|
24 |
Optimal cuts and partitions in tree metrics in polynomial time
Karpiński, Marek. - Bonn : Inst. für Informatik, 2012
|
|
|
|
25 |
Approximation schemes for the Betweenness problem in tournaments and related ranking problems
Karpiński, Marek. - Bonn : Inst. für Informatik, 2011, Rev. version
|
|
|
|
26 |
Improved lower bounds for the shortest superstring and related problems
Karpiński, Marek. - Bonn : Inst. für Informatik, 2011
|
|
|
|
27 |
Tight approximation bounds for vertex cover on dense k-partite hypergraphs
Karpiński, Marek. - Bonn : Inst. für Informatik, 2011
|
|
|
|
28 |
Computational complexity of the perfect matching problem in hypergraphs with subcritical density
Karpiński, Marek. - Bonn : Inst. für Informatik, 2010
|
|
|
|
29 |
Exact and approximation algorithms for geometric and capacitatived set cover problems
Berman, Piotr. - Bonn : Inst. für Informatik, 2010, Rev. version
|
|
|
|
30 |
Faster algorithms for feedback arc set tournament, Kemeny Rank aggrgation and betweenness tournament
Karpiński, Marek. - Bonn : Inst. für Informatik, 2010
|
|
Administration
