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 -
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 -
A graph minor condition for graphs to be k-linked
Shun-ichi MaezawaEuropean Journal of Combinatorics, Vol. 116, Article 103874, 2024 -
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 -
Approximability of the distance independent set problem on regular graphs and planar graphs
Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji MiyanoIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E105-A, pp. 1211-1222, 2022 -
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 -
Extended MSO model checking via small vertex integrity
Tatsuya Gima, Yota OtachiProc. of 33rd International Symposium on Algorithms and Computation (ISAAC 2022), Leibniz International Proceedings in Informatics, Vol. 248, pp. 20:1-20:15, 2022 -
On reachable assignments under dichotomous preferences
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta OzekiProc. 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 -
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 -
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 -
Special case of Rota's basis conjecture on graphic matroids
Shun-ichi Maezawa, Akiko YazawaThe Electronic Journal of Combinatorics, Vol. 29, Article P3.63, 2022DOI: 10.37236/10835 -
Characterization of (m,n)-linked planar graphs
Kengo Enami, Shun-ichi MaezawaGraphs and Combinatorics, Vol. 38, pp. 131, 2022 -
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 -
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 -
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 -
Pareto efficient matchings with pairwise preferences
Naoyuki KamiyamaTheoretical Computer Science, Vol. 948, Article 113707, 2023 -
An even 2-factor in the line graph of a cubic graph
SeungJae Eom, Kenta OzekiTheory and Applications of Graphs, Vol. 9, Article 7, 2022 -
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 -
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 VerdonschotJournal of Computational Geometry, Vol. 13, Article 44573, 2022 -
A parameterized view to the robust recoverable base problem of matroids under structural uncertainty
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio OkamotoOperations Research Letters, Vol. 50, pp. 370-375, 2022 -
An improved deterministic parameterized algorithm for cactus vertex deletion
Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota OtachiTheory of Computing Systems, Vol. 66, pp. 502-515, 2022 -
Parameterized complexity of non-separating and non-disconnecting paths and sets
Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, Saket SaurabhProc. 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 -
Algorithmic meta-theorems for combinatorial reconfiguration revisited
Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota OtachiProc. of 30th Annual European Symposium on Algorithms (ESA 2022), Leibniz International Proceedings in Informatics, Vol. 244, pp. 61:1-61:15, 2022 -
Polynomial-delay and polynomial-space enumeration of large maximal matchings
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro WasaProc. of 48th edition of the International Workshop on Graph-Theoretic Concepts in Computer Science (WG2022), Vol. 13453, pp. 342-355, 2022 -
Linear-delay enumeration for minimal Steiner problems
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro WasaProc. of 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS 2022), pp. 301-313, 2022 -
Constant amortized time enumeration of Eulerian trails
Kazuhiro Kurita, Kuniihiro WasaTheoretical Computer Science, Vol. 923, Article 44573, 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 -
Shortest reconfiguration of perfect matchings via alternating cycles
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio OkamotoSIAM Journal on Discrete Mathematics, Vol. 36, pp. 1102-1123, 2022DOI: 10.1137/20M1364370 -
Reconstructing phylogenetic trees from multipartite quartet systems
Hiroshi Hirai, Yuni IwamasaAlgorithmica, Vol. 84, pp. 1875-1896, 2022 -
Quantaloidal approach to constraint satisfaction
Soichiro Fujii, Yuni Iwamasa, Kei KimuraProc. of 4th International Conference on Applied Category Theory (ACT 2021), Electronic Proceedings in Theoretical Computer Science, Vol. 372, pp. 289-305, 2022DOI: 10.4204/EPTCS.372.21 -
Parameterized complexity of graph burning
Yasuaki Kobayashi, Yota OtachiAlgorithmica, Vol. 84, pp. 2379-2393, 2022 -
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 SlotProc. of 38th International Symposium on Computational Geometry (SoCG 2022), Leibniz International Proceedings in Informatics, Vol. 224, pp. 12:1-12:16, 2022 -
On the kernel of the surgery map restricted to the 1-loop part
Yuta Nozaki, Masatoshi Sato, Masaaki SuzukiJournal of Topology, Vol. 15, pp. 587-619, 2022DOI: 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 OzekiProc. of Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022), pp. 1342-1355, 2022 -
Linear-time recognition of double-threshold graphs
Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi UnoAlgorithmica, Vol. 84, pp. 1163-1181, 2022 -
Reforming an envy-free matching
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta OzekiProc. of 36th AAAI Conference on Artificial Intelligence (AAAI 2022), Vol. 36, pp. 5084-5091, 2022 -
Online task assignment problems with reusable resources
Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi KawarabayashiProc. of 36th AAAI Conference on Artificial Intelligence (AAAI 2022), Vol. 36, pp. 5199-5207, 2021 -
Computing diverse shortest paths efficiently: A theoretical and experimental study
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, See Woo Lee, Yota OtachiProc. of 36th AAAI Conference on Artificial Intelligence (AAAI 2022), Vol. 36, pp. 3758-3766, 2022 -
Maximum properly colored trees in edge-colored graphs
Jie Hu, Hao Li, Shun-ichi MaezawaJournal of Combinatorial Optimization, Vol. 44, pp. 154-171, 2022 -
Kempe equivalence classes of cubic graphs embedded on the projective plane
-
Decrease and reset for power-down
James Andro-Vasko, Wolfgang Bein, Hiro Ito, Shoji Kasahara, Jun KawaharaEnergy Systems, Vol. 14, pp. 445-471, 2021 -
A combinatorial algorithm for computing the rank of a generic partitioned matrix with $2 \times 2$ submatrices
Hiroshi Hirai, Yuni IwamasaMathematical Programming, Series A, Vol. 195, pp. 1-37, 2022 -
Finding diverse trees, paths, and more
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota OtachiProc. of the AAAI Conference on Artificial Intelligence (AAAI 2021), Vol. 35, pp. 3778-3786, 2021 -
Optimal matroid bases with intersection constraints: Valuated matroids, M-convex functions, and their applications
Yuni Iwamasa, Kenjiro TakazawaMathematical Programming, Series A, Vol. 194, pp. 229-256, 2022 -
Submodular reassignment problem for reallocating agents to tasks with synergy effects
Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio OkamotoDiscrete Optimization, Vol. 44, pp. 100631, 2022 -
The Alon-Tarsi number of K5-minor-free graphs
Toshiki Abe, Seog-Jin Kim, Kenta OzekiDiscrete Mathematics, Vol. 345, pp. 112764, 2022 -
Covering projective planar graphs with three forests
Raiji Mukae, Kenta Ozeki, Terukazu Sano, Ryuji TazumeDiscrete Mathematics, Vol. 345, pp. 112748, 2022 -
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 OtachiAlgorithmica, Vol. 84, pp. 871-895, 2022 -
Approximability of monotone submodular function maximization under cardinality and matroid constraints in the streaming model
Chien-Chung Huang, Naonori Kakimura, Simon Mauras, Yuichi YoshidaSIAM Journal on Discrete Mathematics, Vol. 36, pp. 355-382, 2022DOI: 10.1137/20M1357317 -
A forbidden pair for connected graphs to have spanning k-trees
Shun-ichi Maezawa, Kenta OzekiJournal of Graph Theory, Vol. 99, pp. 509-519, 2022DOI: 10.1002/jgt.22752 -
Reconfiguration of regular induced subgraphs
Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro WasaProc. of 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022), Lecture Notes in Computer Science, Vol. 13174, pp. 35-46, 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 -
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 YamanakaIEICE Transactions on Information and Systems, Vol. E105-D, pp. 503-507, 2022 -
Multi-pass streaming algorithms for monotone submodular function maximization
Chien-Chung Huang, Naonori KakimuraTheory of Computing Systems, Vol. 66, pp. 354-394, 2022 -
On the security number of the Cartesian product of graphs
Marko Jakovac, Yota OtachiDiscrete Applied Mathematics, Vol. 304, pp. 119-128, 2021 -
Distributed reconfiguration of spanning trees
Yukiko Yamauchi, Naoyuki Kamiyama, Yota OtachiProc. 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 -
Efficient enumeration of dominating sets for sparse graphs
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki UnoDiscrete Applied Mathematics, Vol. 303, pp. 283-295, 2021 -
Low-congestion shortcut and graph parameters
Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke IzumiDistributed Computing, Vol. 34, pp. 349-365, 2021 -
Computational complexity of jumping block puzzles
Masaaki Kanzaki, Yota Otachi, Ryuhei UeharaProc. of 27th International Computing and Combinatorics Conference (COCOON 2021), Lecture Notes in Computer Science, Vol. 13025, pp. 655-667, 2021 -
Reconfiguring directed trees in a digraph
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro WasaProc. of 27th International Computing and Combinatorics Conference (COCOON 2021), Lecture Notes in Computer Science, Vol. 13025, pp. 343-354, 2021 -
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 -
Proper colorings of plane quadrangulations without rainbow faces
Kengo Enami, Kenta Ozeki, Tomoki YamaguchiGraphs and Combinatorics, Vol. 37, pp. 1873-1890, 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 -
Dynamic bipartite matching market with arrivals and departures
Naonori Kakimura, Donghao ZhuProc. of 17th Conference on Web and Internet Economics (WINE 2021), Lecture Notes in Computer Science, Vol. 13112, pp. 544, 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 -
On the complexity of fair house allocation
Naoyuki Kamiyama, Pasin Manurangsi, Warut SuksompongOperations Research Letters, Vol. 49, pp. 572-577, 2021 -
On 3-polytopes with non-Hamiltonian prisms
Daiki Ikegami, Shun-ichi Maezawa, Carol T. ZamfirescuJournal of Graph Theory, Vol. 97, pp. 569-577, 2021DOI: 10.1002/jgt.22672 -
Color number of cubic graphs having spanning tree with bounded number of leaves
Analen A. Malnegro, Gina A. Malacas, Kenta OzekiTheory and Applications of Graphs, Vol. 8, pp. Article 1, 2021 -
2-Factors of cubic bipartite graphs
Nastaran Haghparast, Kenta OzekiDiscrete Mathematics, Vol. 344, pp. 112357, 2021 -
Longest common subsequence in sublinear space
Masashi Kiyomi, Takashi Horiyama, Yota OtachiInformation Processing Letters, Vol. 168, pp. 106084, 2021 -
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 WolffComputer Graphics Forum, Vol. 40, pp. 471-481, 2021DOI: 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 ArimuraTheoretical Computer Science, Vol. 874, pp. 32-41, 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 -
A (probably) optimal algorithm for bisection on bounded-treewidth graphs
Tesshu Hanaka, Yasuaki Kobayashi, Taiga SoneTheoretical Computer Science, Vol. 873, pp. 38-46, 2021 -
Finding diverse trees, paths, and more
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yota OtachiProc. of the AAAI Conference on Artificial Intelligence (AAAI 2021), Vol. 35, pp. 3778-3786, 2021DOI: -
Algorithms for gerrymandering over graphs
Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio OkamotoTheoretical Computer Science, Vol. 868, pp. 30-45, 2021 -
A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with $2 \time 2$ submatrices
Yuni IwamasaProc. of 22nd Conference on Integer Programming and Combinatorial Optimization (IPCO 2021), Lecture Notes in Computer Science, Vol. 12707, pp. 119-133, 2021 -
Exploring the gap between treedepth and vertex cover through vertex integrity
Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota OtachiProc. of 12th International Conference on Algorithms and Complexity (CIAC 2021), Lecture Notes in Computer Science, Vol. 12701, pp. 271-285, 2021 -
Finding a maximum minimal separator: Graph classes and fixed-parameter tractability
Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi YagitaTheoretical Computer Science, Vol. 865, pp. 131-140, 2021 -
Optimal reconfiguration of optimal ladder lotteries
Katsuhisa Yamanaka, Takashi Horiyama, Kunihiro WasaTheoretical Computer Science, Vol. 859, pp. 57-69, 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 -
Market pricing for matroid rank valuations
Kristof Berczi, Naonori Kakimura, Yusuke KobayashiSIAM Journal on Discrete Mathematics, Vol. 35, pp. 2662-2678, 2021DOI: 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. SouzaAlgorithmica, Vol. 83, pp. 1421-1458, 2021 -
Approximability of the independent feedback vertex set problem for bipartite graphs
Yuma Tamura, Takehiro Ito, Xiao ZhouTheoretical Computer Science, Vol. 849, pp. 227-236, 2021