Subject
General Computer Science,Theoretical Computer Science
Reference36 articles.
1. Tree loop graphs;Alcón;Discrete Applied Mathematics,2007
2. Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles);Bafna;Discrete Applied Mathematics,1996
3. Scheduling split intervals;Bar-Yehuda;SIAM Journal on Computing,2006
4. N. Betzler, B. Dorn, Towards a dichotomy of finding possible winners in elections based on scoring rules, in: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science, MFCS’09, 2009, pp. 124–136.
5. H.L. Bodlaender, D. Lokshtanov, E. Penninkx, Planar capacitated dominating set is W[1]-hard, in: Proceedings of the 4th International Workshop on Parameterized and Exact Computation, IWPEC’09, 2009, pp. 50–60.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献