査読有

• Reallocation problems with minimum completion time

  Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono

  Proc. of 28th International Computing and Combinatorics Conference (COCOON 2022), Lecture Notes in Computer Science, Vol. 13595, pp. 292-304, 2022

  DOI: 10.1007/978-3-031-22105-7_26

• DAG-pathwidth: Graph algorithmic Analyses of DAG-type blockchain networks

  Shoji Kasahara, Jun Kawahara, Shin-ichi Minato, Jumpei Mori

  IEICE Transactions on Information and Systems, Vol. E106.D, pp. 272-283, 2023

  DOI: 10.1587/transinf.2022FCP0007

• Reconfiguration of colorings in triangulations of the sphere

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

  Proc. of 39th International Symposium on Computational Geometry (SoCG 2023), Leibniz International Proceedings in Informatics, Vol. 258, pp. 43:1-43:16, 2023

  DOI: 10.4230/LIPIcs.SoCG.2023.43

• Path cover problems with length cost

  Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita

  Algorithmica, Vol. 85, pp. 3348-3375, 2023

  DOI: 10.1007/s00453-023-01106-2

• On computing a center persistence diagram

  Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu

  Proc. of 24th International Symposium on Fundamentals of Computation Theory (FCT 2023), Lecture Notes in Computer Science, Vol. 14292, pp. 262-275, 2023

  DOI: 10.1007/978-3-031-43587-4_19

• 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 Yoshinaka

  Theoretical Computer Science, Vol. 978, Article 114158, 2023

  DOI: j.tcs.2023.114158

• A spanning tree with at most $k$ leaves in a $K_{1,p}$-free graph

  Kenta Ozeki, Masao Tsugaki

  The Electronic Journal of Combinatorics, Vol. 30, Article 4.29, 2023

  DOI: 10.37236/11698

• Note on fair game edge-connectivity of graphs

  Michitaka Furuya, Naoki Matsumoto, Yumiko Ohno, Kenta Ozeki

  Discrete Applied Mathematics, Vol. 333, pp. 132-135, 2023

  DOI: 10.1016/j.dam.2023.03.024

• A graph minor condition for graphs to be k-linked

  Shun-ichi Maezawa

  European Journal of Combinatorics, Vol. 116, Article 103874, 2024

  DOI: 10.1016/j.ejc.2023.103874

• 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

• Polynomial-delay enumeration of large maximal common independent sets in two matroids

  Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa

  Proc. 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

  DOI: 10.4230/LIPIcs.MFCS.2023.58

• Reconfiguration of time-respecting arborescences

  Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki

  Proc. of 18th Algorithms and Data Structures Symposium (WADS 2023), Lecture Notes in Computer Science, Vol. 14079, pp. 521-532, 2023

  DOI: 10.1007/978-3-031-38906-1_34

• Reconfiguration of vertex-disjoint shortest paths on graphs

  Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara

  Proc. of 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023), Lecture Notes in Computer Science, Vol. 13973, pp. 191-201, 2023

  DOI: 10.1007/978-3-031-27051-2_17

• Approximability of the distance independent set problem on regular graphs and planar graphs

  Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano

  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E105-A, pp. 1211-1222, 2022

  DOI: 10.1587/transfun.2021DMP0017

• Reconfiguration of cliques in a graph

  Takehiro Ito, Hirotaka Ono, Yota Otachi

  Discrete Applied Mathematics, Vol. 333, pp. 43-58, 2023

  DOI: 10.1016/j.dam.2023.01.026

• Sequentially swapping tokens: Further on graph classes

  Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi

  Proc. 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

  DOI: 10.1007/978-3-031-23101-8_15

• Extended MSO model checking via small vertex integrity

  Tatsuya Gima, Yota Otachi

  Proc. of 33rd International Symposium on Algorithms and Computation (ISAAC 2022), Leibniz International Proceedings in Informatics, Vol. 248, pp. 20:1-20:15, 2022

  DOI: 10.4230/LIPIcs.ISAAC.2022.20

• On reachable assignments under dichotomous preferences

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

  Proc. of 24th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2022), Lecture Notes in Computer Science, Vol. 13753, pp. 650-658, 2022

  DOI: 10.1007/978-3-031-21203-1_43

• Graphs with large total angular resolution

  Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, André van Renssen, Birgit Vogtenhuber

  Theoretical Computer Science, Vol. 943, pp. 73-88, 2023

  DOI: 10.1016/j.tcs.2022.12.010

• Parameterized complexity of optimizing list vertex-coloring through reconfiguration

  Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura, Xiao Zhou

  Proc. of 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023), Lecture Notes in Computer Science, Vol. 13973, pp. 279-290, 2023

  DOI: 10.1007/978-3-031-27051-2_24

• Decremental optimization of vertex-coloring under the reconfiguration framework

  Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura, Xiao Zhou

  International Journal of Computer Mathematics: Computer Systems Theory, Vol. 8, pp. 80-92, 2023

  DOI: 10.1080/23799927.2023.2185543

• Happy set problem on subclasses of co-comparability graphs

  Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura

  Algorithmica, Vol. 85, Article 44947, 2023

  DOI: 10.1007/s00453-022-01081-0

• ZDD-based algorithmic framework for solving shortest reconfiguration problems

  Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda

  Proc. 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

  DOI: 10.1007/978-3-031-33271-5_12

• On robustness against evacuees' unexpected movement in automatic evacuation guiding

  Jun Kawahara, Takanori Hara, Masahiro Sasabe

  Computers and Electrical Engineering, Vol. 105, Article 108531, 2022

  DOI: 10.1016/j.compeleceng.2022.108531

• Efficient non-isomorphic graph enumeration algorithms for subclasses of perfect graphs

  Jun Kawahara, Toshiki Saitoh, Hirokazu Takeda, Ryo Yoshinaka, Yui Yoshioka

  Proc. of 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023), Lecture Notes in Computer Science, Vol. 13973, pp. 151-163, 2023

  DOI: 10.1007/978-3-031-27051-2_14

• Special case of Rota's basis conjecture on graphic matroids

  Shun-ichi Maezawa, Akiko Yazawa

  The Electronic Journal of Combinatorics, Vol. 29, Article P3.63, 2022

  DOI: 10.37236/10835

• Characterization of (m,n)-linked planar graphs

  Kengo Enami, Shun-ichi Maezawa

  Graphs and Combinatorics, Vol. 38, pp. 131, 2022

  DOI: 10.1007/s00373-022-02537-4

• A satisfiability algorithm for deterministic width-2 branching programs

  Tomu Makita, Atsuki Nagao, Tatsuki Okada, Kazuhisa Seto, Junichi Teruyama

  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E105-A, pp. 1298-1308, 2022

  DOI: 10.1587/transfun.2021EAP1120

• SAT-based method for finding attractors in asynchronous multi-valued networks

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

  Proc. of 16th International Joint Conference on Biomedical Enginnering Systems and Technologies, Vol. hal-03964870, 2023

  DOI: 10.5281/zenodo.7460388

• 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 Ozeki

  ACM Transactions on Algorithms, Vol. 19, Article 6, 2023

  DOI: 10.1145/3561302

• A 2-bisection with small number of monochromatic edges of a claw-free cubic graph

  Seungjae Eom, Kenta Ozeki

  Graphs and Combinatorics, Vol. 39, Article 44944, 2023

  DOI: 10.1007/s00373-023-02611-5

• Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings

  Yaping Mao, Kenta Ozeki, Aaron Robertson, Zhao Wang

  Journal of Combinatorial Theory, Series A, Vol. 193, Article 105672, 2023

  DOI: 10.1016/j.jcta.2022.105672

• A framework to design approximation algorithms for finding diverse solutions in combinatorial problems

  Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi

  Proc. of 37th AAAI Conference on Artificial Intelligence (AAAI 2023), AAAI-23 Technical Tracks 4, Vol. 37, pp. 3968-3976, 2023

  DOI: 10.1609/aaai.v37i4.25511

• Algorithms for coloring reconfiguration under recolorability digraphs

  Soichiro Fujii, Yuni Iwamasa, Kei Kimura, Akira Suzuki

  Proc. of 33rd International Symposium on Algorithms and Computation (ISAAC 2022), Leibniz International Proceedings in Informatics, Vol. 248, pp. 4:1–4:19, 2022

  DOI: 10.4230/LIPIcs.ISAAC.2022.4

• Reconfiguring (non-spanning) arborescences

  Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa

  Theoretical Computer Science, Vol. 943, pp. 131-141, 2023

  DOI: 10.1016/j.tcs.2022.12.007

• Pareto efficient matchings with pairwise preferences

  Naoyuki Kamiyama

  Theoretical Computer Science, Vol. 948, Article 113707, 2023

  DOI: 10.1016/j.tcs.2023.113707

• An even 2-factor in the line graph of a cubic graph

  SeungJae Eom, Kenta Ozeki

  Theory and Applications of Graphs, Vol. 9, Article 7, 2022

  DOI: 10.20429/tag.2022.090107

• 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 Yoshinaka

  Proc. of 11th International Conference on Fun with Algorithms (FUN 2022), Leibniz International Proceedings in Informatics, Vol. 226, pp. 16:1-16:17, 2022

  DOI: 10.4230/LIPIcs.FUN.2022.16

• Reconfiguring k-path vertex covers

  Duc A. Hoang, Akira Suzuki, Tsuyoshi Yagita

  IEICE Transactions on Information and Systems, Vol. E105-D, pp. 1258-1272, 2022

  DOI: 10.1587/transinf.2021EDP7177

• Weight balancing on boundaries

  Luis Barba, Otfried Cheong, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot

  Journal of Computational Geometry, Vol. 13, Article 44573, 2022

  DOI: 10.20382/jocg.v13i1a1

• A parameterized view to the robust recoverable base problem of matroids under structural uncertainty

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

  Operations Research Letters, Vol. 50, pp. 370-375, 2022

  DOI: 10.1016/j.orl.2022.05.001

• An improved deterministic parameterized algorithm for cactus vertex deletion

  Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi

  Theory of Computing Systems, Vol. 66, pp. 502-515, 2022

  DOI: 10.1007/s00224-022-10076-x

• Parameterized complexity of non-separating and non-disconnecting paths and sets

  Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, Saket Saurabh

  Proc. of 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), Leibniz International Proceedings in Informatics, Vol. 241, pp. 6:1-6:15, 2022

  DOI: 10.4230/LIPIcs.MFCS.2022.6

• Algorithmic meta-theorems for combinatorial reconfiguration revisited

  Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi

  Proc. of 30th Annual European Symposium on Algorithms (ESA 2022), Leibniz International Proceedings in Informatics, Vol. 244, pp. 61:1-61:15, 2022

  DOI: 10.4230/LIPIcs.ESA.2022.61

• Polynomial-delay and polynomial-space enumeration of large maximal matchings

  Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa

  Proc. of 48th edition of the International Workshop on Graph-Theoretic Concepts in Computer Science (WG2022), Vol. 13453, pp. 342-355, 2022

  DOI: 10.1007/978-3-031-15914-5_25

• Linear-delay enumeration for minimal Steiner problems

  Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa

  Proc. of 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS 2022), pp. 301-313, 2022

  DOI: 10.1145/3517804.3524148

• Constant amortized time enumeration of Eulerian trails

  Kazuhiro Kurita, Kuniihiro Wasa

  Theoretical Computer Science, Vol. 923, Article 44573, 2022

  DOI: 10.1016/j.tcs.2022.04.048

• Independent set reconfiguration on directed graphs

  Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa

  Proc. of 47th International Symposium on Mathematical Foundations of Computer Science, Leibniz International Proceedings in Informatics, Vol. 241, pp. 58:1-58:15, 2022

  DOI: 10.4230/LIPIcs.MFCS.2022.58

• Shortest reconfiguration of perfect matchings via alternating cycles

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

  SIAM Journal on Discrete Mathematics, Vol. 36, pp. 1102-1123, 2022

  DOI: 10.1137/20M1364370

• Reconstructing phylogenetic trees from multipartite quartet systems

  Hiroshi Hirai, Yuni Iwamasa

  Algorithmica, Vol. 84, pp. 1875-1896, 2022

  DOI: 10.1007/s00453-022-00945-9

• Quantaloidal approach to constraint satisfaction

  Soichiro Fujii, Yuni Iwamasa, Kei Kimura

  Proc. of 4th International Conference on Applied Category Theory (ACT 2021), Electronic Proceedings in Theoretical Computer Science, Vol. 372, pp. 289-305, 2022

  DOI: 10.4204/EPTCS.372.21

• Parameterized complexity of graph burning

  Yasuaki Kobayashi, Yota Otachi

  Algorithmica, Vol. 84, pp. 2379-2393, 2022

  DOI: 10.1007/s00453-022-00962-8

• Unlabeled multi-robot motion planning with tighter separation bounds

  Bahareh Banyassady, Mark de Berg, Karl Bringmann, Kevin Buchin, Henning Fernau, Dan Halperin, Irina Kostitsyna, Yoshio Okamoto, Stijn Slot

  Proc. of 38th International Symposium on Computational Geometry (SoCG 2022), Leibniz International Proceedings in Informatics, Vol. 224, pp. 12:1-12:16, 2022

  DOI: 10.4230/LIPIcs.SoCG.2022.12

• On the kernel of the surgery map restricted to the 1-loop part

  Yuta Nozaki, Masatoshi Sato, Masaaki Suzuki

  Journal of Topology, Vol. 15, pp. 587-619, 2022

  DOI: 10.1112/topo.12233

• 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 Ozeki

  Proc. of Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022), pp. 1342-1355, 2022

  DOI: 10.1137/1.9781611977073.56

• Linear-time recognition of double-threshold graphs

  Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno

  Algorithmica, Vol. 84, pp. 1163-1181, 2022

  DOI: 10.1007/s00453-021-00921-9

• Reforming an envy-free matching

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

  Proc. of 36th AAAI Conference on Artificial Intelligence (AAAI 2022), Vol. 36, pp. 5084-5091, 2022

  DOI: 10.1609/aaai.v36i5.20441

• Online task assignment problems with reusable resources

  Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi

  Proc. of 36th AAAI Conference on Artificial Intelligence (AAAI 2022), Vol. 36, pp. 5199-5207, 2021

  DOI: 10.1609/aaai.v36i5.20455

• Computing diverse shortest paths efficiently: A theoretical and experimental study

  Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota Otachi

  Proc. of 36th AAAI Conference on Artificial Intelligence (AAAI 2022), Vol. 36, pp. 3758-3766, 2022

  DOI: 10.1609/aaai.v36i4.20290

• Maximum properly colored trees in edge-colored graphs

  Jie Hu, Hao Li, Shun-ichi Maezawa

  Journal of Combinatorial Optimization, Vol. 44, pp. 154-171, 2022

  DOI: 10.1007/s10878-021-00824-z

• Kempe equivalence classes of cubic graphs embedded on the projective plane

  Kenta Ozeki

  Combinatorica, Vol. 42, pp. 1451-1480, 2022

  DOI: 10.1007/s00493-021-4330-2

• Decrease and reset for power-down

  James Andro-Vasko, Wolfgang Bein, Hiro Ito, Shoji Kasahara, Jun Kawahara

  Energy Systems, Vol. 14, pp. 445-471, 2021

  DOI: 10.1007/s12667-021-00475-3

• A combinatorial algorithm for computing the rank of a generic partitioned matrix with $2 \times 2$ submatrices

  Hiroshi Hirai, Yuni Iwamasa

  Mathematical Programming, Series A, Vol. 195, pp. 1-37, 2022

  DOI: 10.1007/s10107-021-01676-5

• Finding diverse trees, paths, and more

  Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi

  Proc. of the AAAI Conference on Artificial Intelligence (AAAI 2021), Vol. 35, pp. 3778-3786, 2021

  DOI: 10.1609/aaai.v35i5.16495

• Optimal matroid bases with intersection constraints: Valuated matroids, M-convex functions, and their applications

  Yuni Iwamasa, Kenjiro Takazawa

  Mathematical Programming, Series A, Vol. 194, pp. 229-256, 2022

  DOI: 10.1007/s10107-021-01625-2

• Submodular reassignment problem for reallocating agents to tasks with synergy effects

  Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto

  Discrete Optimization, Vol. 44, pp. 100631, 2022

  DOI: 10.1016/j.disopt.2021.100631

• The Alon-Tarsi number of K5-minor-free graphs

  Toshiki Abe, Seog-Jin Kim, Kenta Ozeki

  Discrete Mathematics, Vol. 345, pp. 112764, 2022

  DOI: 10.1016/j.disc.2021.112764

• Covering projective planar graphs with three forests

  Raiji Mukae, Kenta Ozeki, Terukazu Sano, Ryuji Tazume

  Discrete Mathematics, Vol. 345, pp. 112748, 2022

  DOI: 10.1016/j.disc.2021.112748

• Parameterized complexity of (A, l)-path packing

  Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi

  Algorithmica, Vol. 84, pp. 871-895, 2022

  DOI: 10.1007/s00453-021-00875-y

• Approximability of monotone submodular function maximization under cardinality and matroid constraints in the streaming model

  Chien-Chung Huang, Naonori Kakimura, Simon Mauras, Yuichi Yoshida

  SIAM Journal on Discrete Mathematics, Vol. 36, pp. 355-382, 2022

  DOI: 10.1137/20M1357317

• A forbidden pair for connected graphs to have spanning k-trees

  Shun-ichi Maezawa, Kenta Ozeki

  Journal of Graph Theory, Vol. 99, pp. 509-519, 2022

  DOI: 10.1002/jgt.22752

• Reconfiguration of regular induced subgraphs

  Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa

  Proc. of 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022), Lecture Notes in Computer Science, Vol. 13174, pp. 35-46, 2022

  DOI: 10.1007/978-3-030-96731-4_4

• Path cover problems with length cost

  Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita

  Proc. of 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022), Lecture Notes in Computer Science, Vol. 13174, pp. 396-408, 2022

  DOI: 10.1007/978-3-030-96731-4_32

• Happy set problem on subclasses of co-comparability graphs

  Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura

  Proc. of 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022), Lecture Notes in Computer Science, Vol. 13174, pp. 149-160, 2022

  DOI: 10.1007/978-3-030-96731-4_13

• Reconfiguration of spanning trees with degree constraint or diameter constraint

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

  Proc. 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

  DOI: 10.4230/LIPIcs.STACS.2022.15

• An O(n^2)-time algorithm for computing a max-min 3-dispersion on a point set in convex position

  Yasuaki Kobayashi, Shin-Ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, Katsuhisa Yamanaka

  IEICE Transactions on Information and Systems, Vol. E105-D, pp. 503-507, 2022

  DOI: 10.1587/transinf.2021FCP0013

• Multi-pass streaming algorithms for monotone submodular function maximization

  Chien-Chung Huang, Naonori Kakimura

  Theory of Computing Systems, Vol. 66, pp. 354-394, 2022

  DOI: 10.1007/s00224-021-10065-6

• On the security number of the Cartesian product of graphs

  Marko Jakovac, Yota Otachi

  Discrete Applied Mathematics, Vol. 304, pp. 119-128, 2021

  DOI: 10.1016/j.dam.2021.07.030

• Distributed reconfiguration of spanning trees

  Yukiko Yamauchi, Naoyuki Kamiyama, Yota Otachi

  Proc. of 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2021), Lecture Notes in Computer Science, Vol. 13046, pp. 516-520, 2021

  DOI: 10.1007/978-3-030-91081-5_40

• Efficient enumeration of dominating sets for sparse graphs

  Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno

  Discrete Applied Mathematics, Vol. 303, pp. 283-295, 2021

  DOI: 10.1016/j.dam.2021.06.004

• Low-congestion shortcut and graph parameters

  Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi

  Distributed Computing, Vol. 34, pp. 349-365, 2021

  DOI: 10.1007/s00446-021-00401-x

• Computational complexity of jumping block puzzles

  Masaaki Kanzaki, Yota Otachi, Ryuhei Uehara

  Proc. of 27th International Computing and Combinatorics Conference (COCOON 2021), Lecture Notes in Computer Science, Vol. 13025, pp. 655-667, 2021

  DOI: 10.1007/978-3-030-89543-3_54

• Reconfiguring directed trees in a digraph

  Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa

  Proc. of 27th International Computing and Combinatorics Conference (COCOON 2021), Lecture Notes in Computer Science, Vol. 13025, pp. 343-354, 2021

  DOI: 10.1007/978-3-030-89543-3_29

• Decremental optimization of vertex-coloring under the reconfiguration framework

  Yusuke Yanagisawa, Yuma Tamura, Akira Suzuki, Xiao Zhou

  Proc. of 27th International Computing and Combinatorics Conference (COCOON 2021), Lecture Notes in Computer Science, Vol. 13025, pp. 355-366, 2021

  DOI: 10.1007/978-3-030-89543-3_30

• Proper colorings of plane quadrangulations without rainbow faces

  Kengo Enami, Kenta Ozeki, Tomoki Yamaguchi

  Graphs and Combinatorics, Vol. 37, pp. 1873-1890, 2021

  DOI: 10.1007/s00373-021-02350-5

• Locating evacuation centers optimally in path and cycle networks

  Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh, Junichi Teruyama

  Proc. 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

  DOI: 10.4230/OASIcs.ATMOS.2021.13

• Dynamic bipartite matching market with arrivals and departures

  Naonori Kakimura, Donghao Zhu

  Proc. of 17th Conference on Web and Internet Economics (WINE 2021), Lecture Notes in Computer Science, Vol. 13112, pp. 544, 2021

  DOI: 10.1007/978-3-030-94676-0

• Max-min 3-dispersion problems

  Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa

  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E104-A, pp. 1101-1107, 2021

  DOI: 10.1587/transfun.2020DMP0003

• On the complexity of fair house allocation

  Naoyuki Kamiyama, Pasin Manurangsi, Warut Suksompong

  Operations Research Letters, Vol. 49, pp. 572-577, 2021

  DOI: 10.1016/j.orl.2021.06.006

• On 3-polytopes with non-Hamiltonian prisms

  Daiki Ikegami, Shun-ichi Maezawa, Carol T. Zamfirescu

  Journal of Graph Theory, Vol. 97, pp. 569-577, 2021

  DOI: 10.1002/jgt.22672

• Color number of cubic graphs having spanning tree with bounded number of leaves

  Analen A. Malnegro, Gina A. Malacas, Kenta Ozeki

  Theory and Applications of Graphs, Vol. 8, pp. Article 1, 2021

  DOI: 10.20429/tag.2021.080201

• 2-Factors of cubic bipartite graphs

  Nastaran Haghparast, Kenta Ozeki

  Discrete Mathematics, Vol. 344, pp. 112357, 2021

  DOI: 10.1016/j.disc.2021.112357

• Longest common subsequence in sublinear space

  Masashi Kiyomi, Takashi Horiyama, Yota Otachi

  Information Processing Letters, Vol. 168, pp. 106084, 2021

  DOI: 10.1016/j.ipl.2020.106084

• ClusterSets: Optimizing planar clusters in categorical point data

  Jakob Geiger, Sabine Cornelsen, Jan-Henrik Haunert, Philipp Kindermann, Tamara Mchedlidze, Martin Nöllenburg, Yoshio Okamoto, Alexander Wolff

  Computer Graphics Forum, Vol. 40, pp. 471-481, 2021

  DOI: 10.1111/cgf.14322

• A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number

  Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura

  Theoretical Computer Science, Vol. 874, pp. 32-41, 2021

  DOI: 10.1016/j.tcs.2021.05.008

• Almost linear time algorithms for minsum k-sink problems on dynamic flow path networks

  Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Koji Watase

  Theoretical Computer Science, Vol. 873, pp. 87-113, 2021

  DOI: 10.1016/j.tcs.2021.05.003

• A (probably) optimal algorithm for bisection on bounded-treewidth graphs

  Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone

  Theoretical Computer Science, Vol. 873, pp. 38-46, 2021

  DOI: 10.1016/j.tcs.2021.04.023

• Finding diverse trees, paths, and more

  Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi

  Proc. of the AAAI Conference on Artificial Intelligence (AAAI 2021), Vol. 35, pp. 3778-3786, 2021

  DOI: 

• Algorithms for gerrymandering over graphs

  Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto

  Theoretical Computer Science, Vol. 868, pp. 30-45, 2021

  DOI: 10.1016/j.tcs.2021.03.037

• A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with $2 \time 2$ submatrices

  Yuni Iwamasa

  Proc. of 22nd Conference on Integer Programming and Combinatorial Optimization (IPCO 2021), Lecture Notes in Computer Science, Vol. 12707, pp. 119-133, 2021

  DOI: 10.1007/978-3-030-73879-2_9

• Exploring the gap between treedepth and vertex cover through vertex integrity

  Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi

  Proc. of 12th International Conference on Algorithms and Complexity (CIAC 2021), Lecture Notes in Computer Science, Vol. 12701, pp. 271-285, 2021

  DOI: 10.1007/978-3-030-75242-2_19

• Finding a maximum minimal separator: Graph classes and fixed-parameter tractability

  Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita

  Theoretical Computer Science, Vol. 865, pp. 131-140, 2021

  DOI: 10.1016/j.tcs.2021.03.006

• Optimal reconfiguration of optimal ladder lotteries

  Katsuhisa Yamanaka, Takashi Horiyama, Kunihiro Wasa

  Theoretical Computer Science, Vol. 859, pp. 57-69, 2021

  DOI: 10.1016/j.tcs.2021.01.009

• Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights

  Tetsuya Fujie, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni

  Proc. of 15th International Conference and Workshops on Algorithms and Computation (WALCOM 2021), Lecture Notes in Computer Science, Vol. 12635, pp. 52-64, 2021

  DOI: 10.1007/978-3-030-68211-8_5

• Trichotomy for the reconfiguration problem of integer linear systems

  Kei Kimura, Akira Suzuki

  Theoretical Computer Science, Vol. 856, pp. 88-109, 2021

  DOI: 10.1016/j.tcs.2020.12.025

• Market pricing for matroid rank valuations

  Kristof Berczi, Naonori Kakimura, Yusuke Kobayashi

  SIAM Journal on Discrete Mathematics, Vol. 35, pp. 2662-2678, 2021

  DOI: 10.1137/20M1386335

• Computing the largest bond and the maximum connected cut of a graph

  Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza

  Algorithmica, Vol. 83, pp. 1421-1458, 2021

  DOI: 10.1007/s00453-020-00789-1

• Approximability of the independent feedback vertex set problem for bipartite graphs

  Yuma Tamura, Takehiro Ito, Xiao Zhou

  Theoretical Computer Science, Vol. 849, pp. 227-236, 2021

  DOI: 10.1016/j.tcs.2020.10.026