Author:
Dorn Frederic,Penninkx Eelko,Bodlaender Hans L.,Fomin Fedor V.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference32 articles.
1. Alber, J., Bodlaender, H.L., Fernau, H., Kloks, T., Niedermeier, R.: Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica 33(4), 461–493 (2002)
2. Alber, J., Fernau, H., Niedermeier, R.: Graph separators: a parameterized view. J. Comput. Syst. Sci. 67(4), 808–832 (2003)
3. Alber, J., Fernau, H., Niedermeier, R.: Parameterized complexity: exponential speed-up for planar graph problems. J. Algorithms 52(1), 26–56 (2004)
4. Arora, S., Grigni, M., Karger, D., Klein, P.N., Woloszyn, A.: A polynomial-time approximation scheme for weighted planar graph TSP. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1998), pp. 33–41. ACM, New York (1998)
5. Bian, Z., Gu, Q.-P., Marzban, M., Tamaki, H., Yoshitake, Y.: Study on branchwidth and branch decomposition of planar graphs. In: Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX 2008), pp. 152–165. ACM, New York (2008)
Cited by
57 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献