为了提供给您更好的使用体验,请启用此功能。';window.onload=function(){1==navigator.cookieEnabled||(document.body.insertAdjacentHTML("beforeend",ck_html),window.onscroll=function(i){console.log(i),document.body.setAttribute("style","position:fixed")})}
1. Overlapping Edge Unfoldings for Archimedean Solids and (Anti)prisms NSTL国家科技图书文献中心
Takumi Shiota | Toshiki Saitoh - 《WALCOM: Algorithms and Computation: 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023), March 22-24, 2023, Hsinchu, Taiwan》 - International Conference and Workshops on Algorithms and Computation - 2023, - 36~48 - 共13页
2. Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs NSTL国家科技图书文献中心
Jun Kawahara | Toshiki Saitoh... - 《WALCOM: Algorithms and Computation: 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023), March 22-24, 2023, Hsinchu, Taiwan》 - International Conference and Workshops on Algorithms and Computation - 2023, - 151~163 - 共13页
3. Path Cover Problems with Length Cost NSTL国家科技图书文献中心
Kenya Kobayashi | Guohui Lin... - 《Algorithmica》 - 2023,85(11) - 3348~3375 - 共28页 - 被引量:3
4. Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes NSTL国家科技图书文献中心
Toshiki Saitoh | Ryo Yoshinaka... - 《WALCOM: Algorithms and Computation: 15th International Conference and Workshops on Algorithms and Computation (WALCOM 2021), February 28 – March 2, 2021, Yangon, Myanmar》 - International Conference and Workshops on Algorithms and Computation - 2021, - 142~153 - 共12页
5. Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs NSTL国家科技图书文献中心
Jun Kawahara | Toshiki Saitoh... - 《Analysis of Experimental Algorithms: Special Event, SEA² 2019, Kalamata, Greece, June 24-29, 2019, Revised Selected Papers》 - Special Event on Analysis of Experimental Algorithms - 2019, - 125~141 - 共17页
6. Max-Min 3-Dispersion Problems NSTL国家科技图书文献中心
Takashi Horiyama | Shin-ichi Nakano... - 《Computing and Combinatorics: 25th International Computing and Combinatorics Conference (COCOON 2019), 29–31 July 2019, Xi an, China》 - International Computing and Combinatorics Conference - 2019, - 291~300 - 共10页
7. Shortest Universal Sequences of Adjacent Transpositions NSTL国家科技图书文献中心
Takehiro ITO | Jun KAWAHARA... - 《電子情報通信学会技術研究報告. 情報システムソサイエティ各誌》 - 2019,119(191) - 1~5 - 共5页
8. Computational Complexity of Robot Arm Simulation Problems NSTL国家科技图书文献中心
Tianfeng Feng | Takashi Horiyama... - 《Combinatorial Algorithms: 29th International Workshop, IWOCA 2018, Singapore, July 16–19, 2018, Proceedings》 - International Workshop on Combinatorial Algorithms - 2018, - 177~188 - 共12页
9. Computational Complexity of Robot Arm Simulation Problems NSTL国家科技图书文献中心
Tianfeng Feng | Takashi Horiyama... - 《Combinatorial algorithms: 28th international workshop on combinatorial algorithms (IWOCA 2018), July 17-21 2017, Newcastle, NSW, Australia》 - International workshop on combinatorial algorithms - 2018, - 177~188 - 共12页
10. Exact Algorithms for the Max-Min Dispersion Problem NSTL国家科技图书文献中心
Toshihiro Akagi | Tetsuya Araki... - 《Frontiers in Algorithmics: 12th International Workshop, FAW 2018, Guangzhou, China, May 8-10, 2018, Proceedings》 - International Frontiers of Algorithmics Workshop - 2018, - 263~272 - 共10页
服务站
成员单位
友情链接