default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShun-ichi Maezawa
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j15]Tatsuya Fujimori, Shun-ichi Maezawa
, Yoshio Okamoto:
The Solitaire Clobber game and the correducibility of k-connected graphs. Discret. Appl. Math. 366: 16-22 (2025)- 2024
- [j14]Shun-ichi Maezawa:
A graph minor condition for graphs to be k-linked. Eur. J. Comb. 116: 103874 (2024) - 2023
- [j13]Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams. ACM Trans. Algorithms 19(1): 6:1-6:22 (2023) - [c5]Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Reconfiguration of Colorings in Triangulations of the Sphere. SoCG 2023: 43:1-43:16 - [c4]Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Rerouting Planar Curves and Disjoint Paths. ICALP 2023: 81:1-81:19 - [c3]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto:
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. ICALP 2023: 82:1-82:17 - [c2]Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki:
Reconfiguration of Time-Respecting Arborescences. WADS 2023: 521-532 - [i5]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto:
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. CoRR abs/2304.14782 (2023) - [i4]Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki:
Reconfiguration of Time-Respecting Arborescences. CoRR abs/2305.07262 (2023) - 2022
- [j12]Shun-ichi Maezawa, Akiko Yazawa:
Special Case of Rota's Basis Conjecture on Graphic Matroids. Electron. J. Comb. 29(3) (2022) - [j11]Michitaka Furuya, Shun-ichi Maezawa, Ryota Matsubara, Haruhide Matsuda, Shoichi Tsuchiya, Takamasa Yashima:
Degree sum condition for the existence of spanning k-trees in star-free graphs. Discuss. Math. Graph Theory 42(1): 5-13 (2022) - [j10]Kengo Enami, Shun-ichi Maezawa:
Characterization of (m, n)-Linked Planar Graphs. Graphs Comb. 38(4): 131 (2022) - [j9]Jie Hu, Hao Li, Shun-ichi Maezawa:
Maximum properly colored trees in edge-colored graphs. J. Comb. Optim. 44(1): 154-171 (2022) - [j8]Shun-ichi Maezawa, Kenta Ozeki:
A forbidden pair for connected graphs to have spanning k-trees. J. Graph Theory 99(3): 509-519 (2022) - [c1]Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. SODA 2022: 1342-1355 - [i3]Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Rerouting Planar Curves and Disjoint Paths. CoRR abs/2210.11778 (2022) - [i2]Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Reconfiguration of colorings in triangulations of the sphere. CoRR abs/2210.17105 (2022) - 2021
- [j7]Shun-ichi Maezawa, Ryota Matsubara, Haruhide Matsuda:
A Fan-type condition for graphs to be k-leaf-connected. Discret. Math. 344(4): 112260 (2021) - [j6]Shun-ichi Maezawa, Masao Tsugaki, Takamasa Yashima:
Closure and Spanning Trees with Bounded Total Excess. Graphs Comb. 37(3): 805-822 (2021) - [j5]Daiki Ikegami, Shun-ichi Maezawa, Carol T. Zamfirescu:
On 3-polytopes with non-Hamiltonian prisms. J. Graph Theory 97(4): 569-577 (2021) - [i1]Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. CoRR abs/2110.11585 (2021) - 2020
- [j4]Mikio Kano, Shun-ichi Maezawa, Katsuhiro Ota, Masao Tsugaki, Takamasa Yashima:
Color degree sum conditions for properly colored spanning trees in edge-colored graphs. Discret. Math. 343(11): 112042 (2020) - [j3]Michitaka Furuya, Shun-ichi Maezawa, Kenta Ozeki:
Long Paths in Bipartite Graphs and Path-Bistar Bipartite Ramsey Numbers. Graphs Comb. 36(1): 167-176 (2020)
2010 – 2019
- 2019
- [j2]Nastaran Haghparast, Mikio Kano, Shun-ichi Maezawa, Kenta Ozeki:
Connected odd factors of graphs. Australas. J Comb. 73: 200-206 (2019) - [j1]Shun-ichi Maezawa, Ryota Matsubara, Haruhide Matsuda:
Degree Conditions for Graphs to Have Spanning Trees with Few Branch Vertices and Leaves. Graphs Comb. 35(1): 231-238 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-10 20:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
