Shun-ichi Maezawa

34 papers A* 4B 1Journal 29
YearRankTypeTitle / Venue / Authors
2026 J jnl
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra.
SIAM J. Discret. Math.
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
2026 J jnl
On DP-coloring of outerplanar graphs.
Discret. Math.
Tianjiao Dai, Jie Hu, Hao Li, Shun-ichi Maezawa
2026 J jnl
Preorder induced by rainbow forbidden subgraphs.
Discret. Math.
Shun-ichi Maezawa, Akira Saito
2026 J jnl
Reconfiguration of Time-Respecting Arborescences.
Algorithmica
Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
2026 J jnl
Sufficient conditions for edge-colored bipartite graphs to have rainbow and properly colored spanning trees.
Discret. Math.
Shinya Fujita, Mikio Kano, Shun-ichi Maezawa, Masao Tsugaki, Kiyoshi Yoshimoto
2025 J jnl
An odd 4-coloring of a maximal outerplanar graph.
Discret. Math.
Masaki Kashima, Shun-ichi Maezawa, Kakeru Osako, Kenta Ozeki, Shoichi Tsuchiya
2025 J jnl
Distribution of Vertices Required a High-Degree Condition on Partitions of Graphs Under Degree Constraints.
J. Graph Theory
Michitaka Furuya, Shun-ichi Maezawa
2025 J jnl
Reconfiguration of colorings in triangulations of the sphere.
J. Comput. Geom.
Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2025 J jnl
Rerouting Planar Curves and Disjoint Paths.
ACM Trans. Algorithms
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2025 J jnl
The Solitaire Clobber game and the correducibility of k-connected graphs.
Discret. Appl. Math.
Tatsuya Fujimori, Shun-ichi Maezawa, Yoshio Okamoto
2024 J jnl
A graph minor condition for graphs to be k-linked.
Eur. J. Comb.
Shun-ichi Maezawa
2023 A* conf
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra.
ICALP
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
2023 J jnl
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra.
CoRR
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
2023 J jnl
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams.
ACM Trans. Algorithms
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2023 A* conf
Reconfiguration of Colorings in Triangulations of the Sphere.
SoCG
Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2023 B conf
Reconfiguration of Time-Respecting Arborescences.
WADS
Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
2023 J jnl
Reconfiguration of Time-Respecting Arborescences.
CoRR
Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
2023 A* conf
Rerouting Planar Curves and Disjoint Paths.
ICALP
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022 J jnl
A forbidden pair for connected graphs to have spanning k-trees.
J. Graph Theory
Shun-ichi Maezawa, Kenta Ozeki
2022 J jnl
Characterization of (m, n)-Linked Planar Graphs.
Graphs Comb.
Kengo Enami, Shun-ichi Maezawa
2022 J jnl
Degree sum condition for the existence of spanning
Discuss. Math. Graph Theory
Michitaka Furuya, Shun-ichi Maezawa, Ryota Matsubara, Haruhide Matsuda, Shoichi Tsuchiya, Takamasa Yashima
2022 J jnl
Maximum properly colored trees in edge-colored graphs.
J. Comb. Optim.
Jie Hu, Hao Li, Shun-ichi Maezawa
2022 A* conf
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams.
SODA
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022 J jnl
Reconfiguration of colorings in triangulations of the sphere.
CoRR
Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022 J jnl
Rerouting Planar Curves and Disjoint Paths.
CoRR
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022 J jnl
Special Case of Rota's Basis Conjecture on Graphic Matroids.
Electron. J. Comb.
Shun-ichi Maezawa, Akiko Yazawa
2021 J jnl
A Fan-type condition for graphs to be k-leaf-connected.
Discret. Math.
Shun-ichi Maezawa, Ryota Matsubara, Haruhide Matsuda
2021 J jnl
Closure and Spanning Trees with Bounded Total Excess.
Graphs Comb.
Shun-ichi Maezawa, Masao Tsugaki, Takamasa Yashima
2021 J jnl
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams.
CoRR
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2021 J jnl
On 3-polytopes with non-Hamiltonian prisms.
J. Graph Theory
Daiki Ikegami, Shun-ichi Maezawa, Carol T. Zamfirescu
2020 J jnl
Color degree sum conditions for properly colored spanning trees in edge-colored graphs.
Discret. Math.
Mikio Kano, Shun-ichi Maezawa, Katsuhiro Ota, Masao Tsugaki, Takamasa Yashima
2020 J jnl
Long Paths in Bipartite Graphs and Path-Bistar Bipartite Ramsey Numbers.
Graphs Comb.
Michitaka Furuya, Shun-ichi Maezawa, Kenta Ozeki
2019 J jnl
Connected odd factors of graphs.
Australas. J Comb.
Nastaran Haghparast, Mikio Kano, Shun-ichi Maezawa, Kenta Ozeki
2019 J jnl
Degree Conditions for Graphs to Have Spanning Trees with Few Branch Vertices and Leaves.
Graphs Comb.
Shun-ichi Maezawa, Ryota Matsubara, Haruhide Matsuda