Publications and Awards
-
Reallocation problems with minimum completion time
Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka OnoProc. of 28th International Computing and Combinatorics Conference (COCOON 2022), Lecture Notes in Computer Science, Vol. 13595, pp. 292-304, 2022 -
DAG-pathwidth: Graph algorithmic Analyses of DAG-type blockchain networks
Shoji Kasahara, Jun Kawahara, Shin-ichi Minato, Jumpei MoriIEICE Transactions on Information and Systems, Vol. E106.D, pp. 272-283, 2023 -
Path cover problems with length cost
Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi YagitaAlgorithmica, Vol. 85, pp. 3348-3375, 2023 -
On computing a center persistence diagram
Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai ZhuProc. of 24th International Symposium on Fundamentals of Computation Theory (FCT 2023), Lecture Notes in Computer Science, Vol. 14292, pp. 262-275, 2023 -
Sorting balls and water: Equivalence and computational complexity
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo YoshinakaTheoretical Computer Science, Vol. 978, Article 114158, 2023DOI: j.tcs.2023.114158 -
Hamiltonian cycle reconfiguration with answer set programming
Takahiro Hirate, Mutsunori Banbara, Katsumi Inoue, Xiao-Nan Lu, Hidetomo Nabeshima, Torsten Schaub, Takehide Soh, Naoyuki TamuraProc. of 18th European Conference on Logics in Artificial Intelligence (JELIA 2023), Lecture Notes in Artificial Intelligence, Vol. 14238, pp. 262-277, 2023 -
SAF: SAT-based attractor finder in asynchronous automata networks
Takehide Soh, Morgan Magnin, Daniel Le Berre, Mutsunori Banbara, Naoyuki TamuraProc. of 21st International Conference on Computational Methods in Systems Biology (CMSB 2023), Lecture Notes in Bioinformatics, Vol. 14173, pp. 175-183, 2023 -
Feedback vertex set reconfiguration in planar graphs
Nicolas Bousquet, Felix Hommelsheim, Yusuke Kobayashi, Moritz Mühlenthaler, Akira SuzukiTheoretical Computer Science, Vol. 979, Article 114188, 2023 -
Reconfiguration of spanning trees with degree constraints or diameter constraints
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro WasaAlgorithmica, Vol. 85, pp. 2779–2816, 2023 -
Fixed-parameter algorithms for graph constraint logic
Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira SuzukiTheoretical Computer Science, Vol. 959, Article 113863, 2023 -
Reconfiguration of time-respecting arborescences
Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira SuzukiProc. of 18th Algorithms and Data Structures Symposium (WADS 2023), Lecture Notes in Computer Science, Vol. 14079, pp. 521-532, 2023 -
Parameterized complexity of optimizing list vertex-coloring through reconfiguration
Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura, Xiao ZhouProc. of 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023), Lecture Notes in Computer Science, Vol. 13973, pp. 279-290, 2023 -
Decremental optimization of vertex-coloring under the reconfiguration framework
Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura, Xiao ZhouInternational Journal of Computer Mathematics: Computer Systems Theory, Vol. 8, pp. 80-92, 2023 -
Happy set problem on subclasses of co-comparability graphs
Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma TamuraAlgorithmica, Vol. 85, Article 44947, 2023 -
ZDD-based algorithmic framework for solving shortest reconfiguration problems
Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa TodaProc. of 20th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2023), Lecture Notes in Computer Science, Vol. 13884, pp. 167-183, 2023 -
On robustness against evacuees' unexpected movement in automatic evacuation guiding
Jun Kawahara, Takanori Hara, Masahiro SasabeComputers and Electrical Engineering, Vol. 105, Article 108531, 2022 -
Efficient non-isomorphic graph enumeration algorithms for subclasses of perfect graphs
Jun Kawahara, Toshiki Saitoh, Hirokazu Takeda, Ryo Yoshinaka, Yui YoshiokaProc. of 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023), Lecture Notes in Computer Science, Vol. 13973, pp. 151-163, 2023 -
A satisfiability algorithm for deterministic width-2 branching programs
Tomu Makita, Atsuki Nagao, Tatsuki Okada, Kazuhisa Seto, Junichi TeruyamaIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E105-A, pp. 1298-1308, 2022 -
SAT-based method for finding attractors in asynchronous multi-valued networks
Takehide Soh, Morgan Magnin, Daniel Le Berre, Mutsunori Banbara, Naoyuki TamuraProc. of 16th International Joint Conference on Biomedical Enginnering Systems and Technologies, Vol. hal-03964870, 2023 -
Algorithms for coloring reconfiguration under recolorability digraphs
Soichiro Fujii, Yuni Iwamasa, Kei Kimura, Akira SuzukiProc. of 33rd International Symposium on Algorithms and Computation (ISAAC 2022), Leibniz International Proceedings in Informatics, Vol. 248, pp. 4:1–4:19, 2022 -
Reconfiguring (non-spanning) arborescences
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro WasaTheoretical Computer Science, Vol. 943, pp. 131-141, 2023 -
Sorting balls and water: Equivalence and computational complexity
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo YoshinakaProc. of 11th International Conference on Fun with Algorithms (FUN 2022), Leibniz International Proceedings in Informatics, Vol. 226, pp. 16:1-16:17, 2022 -
Reconfiguring k-path vertex covers
Duc A. Hoang, Akira Suzuki, Tsuyoshi YagitaIEICE Transactions on Information and Systems, Vol. E105-D, pp. 1258-1272, 2022 -
Independent set reconfiguration on directed graphs
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro WasaProc. of 47th International Symposium on Mathematical Foundations of Computer Science, Leibniz International Proceedings in Informatics, Vol. 241, pp. 58:1-58:15, 2022 -
Decrease and reset for power-down
James Andro-Vasko, Wolfgang Bein, Hiro Ito, Shoji Kasahara, Jun KawaharaEnergy Systems, Vol. 14, pp. 445-471, 2021 -
2023 Incentive Award, Minoru Ishida Foundation
SUZUKI, Akira (Tohoku U.)
October 27, 2023 -
XCSP3 Competition 2023, 2nd place of the Main CSP track
SOH, Takehide (Kobe U.), LE BERRE, Daniel (CRIL-CNRS), NABESHIMA, Hidetomo (Yamanashi U.), BANBARA, Mutsunori (Nagoya U.), TAMURA, Naoyuki (Kobe U.)
August 31, 2023 -
XCSP3 Competition 2022, 2nd place of the Main CSP track
SOH, Takehide (Kobe U.), LE BERRE, Daniel (CRIL-CNRS), NABESHIMA, Hidetomo (Yamanashi U.), BANBARA, Mutsunori (Nagoya U.), TAMURA, Naoyuki (Kobe U.)
August 3, 2022 -
Path cover problems with length cost
Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi YagitaProc. of 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022), Lecture Notes in Computer Science, Vol. 13174, pp. 396-408, 2022 -
Happy set problem on subclasses of co-comparability graphs
Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma TamuraProc. of 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022), Lecture Notes in Computer Science, Vol. 13174, pp. 149-160, 2022 -
Reconfiguration of spanning trees with degree constraint or diameter constraint
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro WasaProc. of 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), Leibniz International Proceedings in Informatics, Vol. 219, pp. 15:1-15:21, 2022 -
Decremental optimization of vertex-coloring under the reconfiguration framework
Yusuke Yanagisawa, Yuma Tamura, Akira Suzuki, Xiao ZhouProc. of 27th International Computing and Combinatorics Conference (COCOON 2021), Lecture Notes in Computer Science, Vol. 13025, pp. 355-366, 2021 -
Locating evacuation centers optimally in path and cycle networks
Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh, Junichi TeruyamaProc. of 21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021), Open Access Series in Informatics, Vol. 96, pp. 13:1-13:19, 2021 -
Max-min 3-dispersion problems
Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro WasaIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E104-A, pp. 1101-1107, 2021 -
Almost linear time algorithms for minsum k-sink problems on dynamic flow path networks
Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Koji WataseTheoretical Computer Science, Vol. 873, pp. 87-113, 2021 -
Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights
Tetsuya Fujie, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki TokuniProc. of 15th International Conference and Workshops on Algorithms and Computation (WALCOM 2021), Lecture Notes in Computer Science, Vol. 12635, pp. 52-64, 2021 -
Trichotomy for the reconfiguration problem of integer linear systems
Kei Kimura, Akira SuzukiTheoretical Computer Science, Vol. 856, pp. 88-109, 2021 -
20th LA/EATCS-Japan Presentation Award
KAWAHARA, Jun (Kyoto U.)"On an efficient solver for combinatorial reconfiguration problems using ZDDs"Authors: ITO, Takehiro (Tohoku U.), KAWAHARA, Jun (Kyoto U.), SOH, Takehide (Kobe U.), SUZUKI, Akira (Tohoku U.), TERUYAMA, Junichi (U. Hyogo), TODA, Takahisa (U. Electro-Communications)February 3, 2022