Scholar
Yasuaki Kobayashi
Google Scholar ID: s5kUz8UAAAAJ
Hokkaido University
Algorithms and Complexity
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
681
H-index
13
i10-index
18
Publications
20
Co-authors
58
list available
Contact
No contact links provided.
Publications
13 items
Fast and Practical Single-Exponential Algorithms for Branchwidth
2026
Cited
0
Forcing a unique minimum spanning tree and a unique shortest path
2025
Cited
0
Hitting Geodesic Intervals in Structurally Restricted Graphs
2025
Cited
0
2-Layer Fan-Planarity in Polynomial Time
2025
Cited
0
Finding Order-Preserving Subgraphs
2025
Cited
0
Finding One Local Optimum Is Easy -- But What about Two?
2025
Cited
0
A polynomial delay algorithm generating all potential maximal cliques in triconnected planar graphs
2025
Cited
0
Structural Parameterizations of $k$-Planarity
2025
Cited
0
Load more
Resume (English only)
Co-authors
58 total
Yota Otachi
Nagoya University
Tesshu Hanaka 土中哲秀
Kyushu University
Co-author 3
Hisao Tamaki
Visiting Researcher, Meiji University
Co-author 5
Co-author 6
Tatsuya Gima
Hokkaido University
Masashi Kiyomi
Seikei University
×
Welcome back
Sign in to Agora
Welcome back! Please sign in to continue.
Email address
Password
Forgot password?
Continue
Do not have an account?
Sign up