共 15 条
- [1] Polynomial-time data reduction for DOMINATING SET [J]. JOURNAL OF THE ACM, 2004, 51 (03) : 363 - 384
- [2] Parameterized complexity: exponential speed-up for planar graph problems [J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2004, 52 (01): : 26 - 56
- [3] Graph separators: a parameterized view [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2003, 67 (04) : 808 - 832
- [4] Bar-Yehuda R., 1985, ANN DISCRETE MATH, V25, P27, DOI DOI 10.1016/S0304-0208(08)73101-3
- [6] Dinur I, 2002, ANN IEEE SYMP FOUND, P33, DOI 10.1109/SFCS.2002.1181880
- [7] DOWNEY R, 1999, PARAMETERIZED COMPLE
- [8] Downey Rodney G., 1999, Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, V49, P49
- [9] FELLOWS M, 2002, ELECT NOTES THEORETI, V61
- [10] Fellows MR, 2000, LECT NOTES COMPUT SC, V1974, P240