Yasuaki Kobayashi
5 papers · 2021–2026 · 1 conference · across top CS/AI conferences
Achievements
Jump to papers ↓+1 more ↓ Show less ↑
🏃 Academic Marathon (5) 🌉 Interdisciplinary Bridge 🧭 Keyword Pioneer 🐝 Cross-Pollinator (15) 🏆 Keyword Champion (3)
❓
The Questioner
Conferences
AAAI (5)
Top co-authors
Keywords
diverse solution
(3)
combinatorial optimization
(3)
fixed-parameter tractability
(2)
hamming distance
(2)
vertex cover
(1)
bipartite graph
(1)
spanning tree
(1)
approximation algorithm
(1)
shortest path
(1)
graph algorithm
(1)
fixed-parameter tractable
(1)
local optimum
(1)
maximum independent set
(1)
unique solution
(1)
fixed-parameter tractable algorithm
(1)
max cut
(1)
polynomial local search
(1)
graph theory
(1)
computational complexity
(1)
algorithm design
(1)
Papers
Finding One Local Optimum Is Easy—but What About Two?
AAAI 2026
Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover
AAAI 2024
A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems
AAAI 2023
Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study
AAAI 2022
Finding Diverse Trees, Paths, and More
AAAI 2021