2005 | ||
---|---|---|
3 | EE | Anna Palbom: Complexity of the directed spanning cactus problem. Discrete Applied Mathematics 146(1): 81-91 (2005) |
2004 | ||
2 | EE | Anna Palbom: Worst Case Performance of an Approximation Algorithm for Asymmetric TSP. STACS 2004: 465-476 |
2003 | ||
1 | EE | Anna Palbom: On Spanning Cacti and Asymmetric TSP Electronic Colloquium on Computational Complexity (ECCC) 10(023): (2003) |