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
Publications
15 items
An ETH-based quasipolynomial lower bound for Dualization
2026
Cited
0
On the Complexity of Forcing and Anti-Forcing Minimum Cuts
2026
Cited
0
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
Load more
Co-authors
13 total
Yota Otachi
Nagoya University
Tesshu Hanaka 土中哲秀
Kyushu University
Hisao Tamaki
Visiting Researcher, Meiji University
Tatsuya Gima
Hokkaido University
Masashi Kiyomi
Seikei University
Yuni Iwamasa
Kobe University
Hirotaka Ono
Nagoya University, Japan
Takeaki Uno
National Institute of Informatics, Japan
