共 50 条
- [21] The Straight-Line RAC Drawing Problem Is NP-Hard SOFSEM 2011: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2011, 6543 : 74 - 85
- [23] Noisy data make the partial digest problem NP-hard ALGORITHMS IN BIOINFORMATICS, PROCEEDINGS, 2003, 2812 : 111 - 123
- [26] The minimum feedback arc set problem is NP-hard for tournaments COMBINATORICS PROBABILITY & COMPUTING, 2007, 16 (01): : 1 - 4
- [28] Linear problem kernels for NP-hard problems on planar graphs AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2007, 4596 : 375 - +
- [29] Measurement errors make the partial digest problem NP-hard LATIN 2004: THEORETICAL INFORMATICS, 2004, 2976 : 379 - 390