Publications and Awards
-
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 -
Reconfiguration of colorings in triangulations of the sphere
Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta OzekiProc. of 39th International Symposium on Computational Geometry (SoCG 2023), Leibniz International Proceedings in Informatics, Vol. 258, pp. 43:1-43:16, 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 -
A spanning tree with at most $k$ leaves in a $K_{1,p}$-free graph
Kenta Ozeki, Masao TsugakiThe Electronic Journal of Combinatorics, Vol. 30, Article 4.29, 2023DOI: 10.37236/11698 -
Note on fair game edge-connectivity of graphs
Michitaka Furuya, Naoki Matsumoto, Yumiko Ohno, Kenta OzekiDiscrete Applied Mathematics, Vol. 333, pp. 132-135, 2023 -
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 -
Reconfiguration of the union of arborescences
Yusuke Kobayashi, Ryoga Mahara, Tamás SchwarczProc. of 34th International Symposium on Algorithms and Computation (ISAAC 2023), Leibniz International Proceedings in Informatics, Vol. 283, pp. 48:1-48:14, 2023 -
Algorithmic theory of qubit routing
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio OkamotoProc. of 18th Algorithms and Data Structures Symposium (WADS 2023), Lecture Notes in Computer Science, Vol. 14079, pp. 533–546, 2023 -
On reachable assignments under dichotomous preferences
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta OzekiTheoretical Computer Science, Vol. 979, Article 114196, 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 and enumeration of optimal cyclic ladder lotteries
Yuta Nozaki, Katsuhisa Yamanaka, Kunihiro WasaProc. of 34th International Workshop on Combinatorial Algorithms (IWOCA 2023), Lecture Notes in Computer Science, Vol. 13889, pp. 331-342, 2023 -
Rerouting planar curves and disjoint paths
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta OzekiProc. 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 -
Polynomial-delay enumeration of large maximal common independent sets in two matroids
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro WasaProc. of 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023), Leibniz International Proceedings in Informatics, Vol. 272, pp. 58:1-58:14, 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 -
Reconfiguration of vertex-disjoint shortest paths on graphs
Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei UeharaProc. of 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023), Lecture Notes in Computer Science, Vol. 13973, pp. 191-201, 2023 -
Reconfiguration of cliques in a graph
Takehiro Ito, Hirotaka Ono, Yota OtachiDiscrete Applied Mathematics, Vol. 333, pp. 43-58, 2023 -
Sequentially swapping tokens: Further on graph classes
Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota OtachiProc. of 48th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2023), Lecture Notes in Computer Science, Vol. 13878, pp. 222-235, 2023 -
Graphs with large total angular resolution
Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, André van Renssen, Birgit VogtenhuberTheoretical Computer Science, Vol. 943, pp. 73-88, 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 -
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 -
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 -
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta OzekiACM Transactions on Algorithms, Vol. 19, Article 6, 2023DOI: 10.1145/3561302 -
A 2-bisection with small number of monochromatic edges of a claw-free cubic graph
Seungjae Eom, Kenta OzekiGraphs and Combinatorics, Vol. 39, Article 44944, 2023 -
Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings
Yaping Mao, Kenta Ozeki, Aaron Robertson, Zhao WangJournal of Combinatorial Theory, Series A, Vol. 193, Article 105672, 2023 -
A framework to design approximation algorithms for finding diverse solutions in combinatorial problems
Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota OtachiProc. of 37th AAAI Conference on Artificial Intelligence (AAAI 2023), AAAI-23 Technical Tracks 4, Vol. 37, pp. 3968-3976, 2023 -
Reconfiguring (non-spanning) arborescences
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro WasaTheoretical Computer Science, Vol. 943, pp. 131-141, 2023 -
Pareto efficient matchings with pairwise preferences
Naoyuki KamiyamaTheoretical Computer Science, Vol. 948, Article 113707, 2023 -
2023 Incentive Award, Minoru Ishida Foundation
SUZUKI, Akira (Tohoku U.)
October 27, 2023 -
13th Research Award, the Operations Research Society of Japan
KOBAYASHI, Yusuke (Kyoto U.)
Sepetember 14, 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 -
IPSJ Yamashita SIG Research Award for FY2022
WASA, Kunihiro (Hosei U.)"Constant Amortized Time Enumeration of Eulerian trails (2021-AL-183)"March 2, 2023