共 50 条
- [31] The set cover with pairs problem FSTTCS 2005: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2005, 3821 : 164 - 176
- [33] Solving Set Cover and Dominating Set via Maximum Satisfiability THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 1569 - 1576
- [35] Path finding in the tile assembly model THEORETICAL COMPUTER SCIENCE, 2009, 410 (15) : 1461 - 1472
- [38] The tile assembly model is intrinsically universal 2012 IEEE 53RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2012, : 302 - 310
- [40] Deterministic Algorithm for the Reordering Problem Using Tile Assembly 2009 FOURTH INTERNATIONAL CONFERENCE ON BIO-INSPIRED COMPUTING: THEORIES AND APPLICATIONS, PROCEEDINGS, 2009, : 125 - +