論文・受賞| 組合せ遷移＠学術変革領域研究(B)

Hamiltonian cycle reconfiguration with answer set programming

Takahiro Hirate, Mutsunori Banbara, Katsumi Inoue, Xiao-Nan Lu, Hidetomo Nabeshima, Torsten Schaub, Takehide Soh, Naoyuki Tamura

Proc. of 18th European Conference on Logics in Artificial Intelligence (JELIA 2023), Lecture Notes in Artificial Intelligence, Vol. 14238, pp. 262-277, 2023

DOI: 10.1007/978-3-031-43619-2_19
SAF: SAT-based attractor finder in asynchronous automata networks

Takehide Soh, Morgan Magnin, Daniel Le Berre, Mutsunori Banbara, Naoyuki Tamura

Proc. of 21st International Conference on Computational Methods in Systems Biology (CMSB 2023), Lecture Notes in Bioinformatics, Vol. 14173, pp. 175-183, 2023

DOI: 10.1007/978-3-031-42697-1_12
Reconfiguration of the union of arborescences

Yusuke Kobayashi, Ryoga Mahara, Tamás Schwarcz

Proc. of 34th International Symposium on Algorithms and Computation (ISAAC 2023), Leibniz International Proceedings in Informatics, Vol. 283, pp. 48:1-48:14, 2023

DOI: 10.4230/LIPIcs.ISAAC.2023.48
Algorithmic theory of qubit routing

Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto

Proc. of 18th Algorithms and Data Structures Symposium (WADS 2023), Lecture Notes in Computer Science, Vol. 14079, pp. 533–546, 2023

DOI: 10.1007/978-3-031-38906-1_35
On reachable assignments under dichotomous preferences

Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki

Theoretical Computer Science, Vol. 979, Article 114196, 2023

DOI: 10.1016/j.tcs.2023.114196
Feedback vertex set reconfiguration in planar graphs

Nicolas Bousquet, Felix Hommelsheim, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki

Theoretical Computer Science, Vol. 979, Article 114188, 2023

DOI: 10.1016/j.tcs.2023.114188
Reconfiguration of spanning trees with degree constraints or diameter constraints

Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa

Algorithmica, Vol. 85, pp. 2779–2816, 2023

DOI: 10.1007/s00453-023-01117-z
Fixed-parameter algorithms for graph constraint logic

Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki

Theoretical Computer Science, Vol. 959, Article 113863, 2023

DOI: 10.1016/j.tcs.2023.113863
Reconfiguration and enumeration of optimal cyclic ladder lotteries

Yuta Nozaki, Katsuhisa Yamanaka, Kunihiro Wasa

Proc. of 34th International Workshop on Combinatorial Algorithms (IWOCA 2023), Lecture Notes in Computer Science, Vol. 13889, pp. 331-342, 2023

DOI: 10.1007/978-3-031-34347-6_28
Rerouting planar curves and disjoint paths

Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki

Proc. of 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023), Leibniz International Proceedings in Informatics, Vol. 261, pp. 81:1-81:19, 2023

DOI: 10.4230/LIPIcs.ICALP.2023.81

論文・受賞

Hamiltonian cycle reconfiguration with answer set programming

SAF: SAT-based attractor finder in asynchronous automata networks

Reconfiguration of the union of arborescences

Algorithmic theory of qubit routing

On reachable assignments under dichotomous preferences

Feedback vertex set reconfiguration in planar graphs

Reconfiguration of spanning trees with degree constraints or diameter constraints

Fixed-parameter algorithms for graph constraint logic

Reconfiguration and enumeration of optimal cyclic ladder lotteries

Rerouting planar curves and disjoint paths