Author:
Fomin Fedor V.,Kratsch Dieter,Woeginger Gerhard J.
Publisher
Springer Berlin Heidelberg
Reference14 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, 461–493 (2002)
2. Dantsin, E., Goerdt, A., Hirsch, E.A., Kannan, R., Kleinberg, J., Papadimitriou, C., Raghavan, P., Schöning, U.: A deterministic (2−2/(k+1))
n
algorithm for k-SAT based on local search. Theoretical Computer Science 289, 69–83 (2002)
3. Monographs in Computer Science;R.G. Downey,1999
4. Lecture Notes in Computer Science;D. Eppstein,2001
5. Fomin, F.V., Thilikos, D.M.: Dominating sets in planar graphs: Branchwidth and exponential speed-up. In: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), pp. 168–177 (2003)
Cited by
52 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献