EDBT 2026 Demo / reviewers in the wild / expert
Yuuho Tanaka
dblp:317/7554
· DBLP profile ↗
4ranked-venue papers
2as first author
4since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 4 · 2 first-author · 4 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Number of spanning trees in a wheel graph with two identified vertices via hitting times
Shunya Tamura, Yuuho Tanaka |
Discret. Appl. Math. | 2 |
| 2026 | Spanning trees in directed square cyclesabstractWe classify weakly connected spanning closed (WCSC) subgraphs of C n 2 ⃗ , the square of a directed n -vertex cycle. Then we show that every spanning tree of C n 2 ⃗ is contained in a unique nontrivial WCSC subgraph of C n 2 ⃗ . As a result, we obtain a purely combinatorial derivation of the formula for the number of directed spanning trees of C n 2 ⃗ . Moreover, we obtain the formula for the number of directed spanning trees of C n 2 ⃗ , which is a Jacobsthal number. Yuuho Tanaka |
Discret. Appl. Math. | 1 |
| 2024 | On the average hitting times of Cay(ZN,{+1,+2})
Yuuho Tanaka |
Discret. Appl. Math. | 1 |
| 2022 | On the average hitting times of the squares of cycles
Yoshiaki Doi, Norio Konno, Tomoki Nakamigawa, Tadashi Sakuma, Etsuo Segawa, Hidehiro Shinohara, Shunya Tamura, Yuuho Tanaka, Kosuke Toyota |
Discret. Appl. Math. | 8 |