Yasuaki Kobayashi

5 papers · 2021–2026 · 1 venue · across top CS/AI venues

Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.

Achievements

Jump to papers ↓

🏃 Academic Marathon · Sprint 🌉 Interdisciplinary Bridge · Bronze ❓ The Questioner

Venues

AAAI (5)

Top co-authors

Kazuhiro Kurita (4) Yota Otachi (3) Tesshu Hanaka (3) Kazuhisa Seto (1) Yutaro Yamaguchi (1) See Woo Lee (1) Yusuke Kobayashi (1) Ryu Suzuki (1) Masashi Kiyomi (1) Takashi Horiyama (1)

Research topics

Mathematics & Optimization (5) Optimization (5) Computer Science (3) Foundations (3) Mathematics (3) Machine Learning (1) Optimization & Theory (1)

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