Takahiro Suzuki

According to our database, Takahiro Suzuki authored at least 7 papers between 2024 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2026

Distance-Constrained Unlabeled Multi-Agent Pathfinding.

Takahiro Suzuki, Yuma Tamura, Keisuke Okumura

CoRR, May, 2026

Finding Shortest Reconfiguration Sequences on Independent Set Polytopes.

Jean Cardinal, Kevin Mann, Akira Suzuki, Takahiro Suzuki, Yuma Tamura, Xiao Zhou

CoRR, April, 2026

Solution Discovery for Vertex Cover, Independent Set, Dominating Set, and Feedback Vertex Set.

Rin Saito, Anouk Sommer, Tatsuhiro Suga, Takahiro Suzuki, Yuma Tamura

Proceedings of the SOFSEM 2026: Theory and Practice of Computer Science, 2026

Spanning Trees with a Small Vertex Cover: The Complexity on Specific Graph Classes.

Toranosuke Kokai, Akira Suzuki, Takahiro Suzuki, Yuma Tamura, Xiao Zhou

Proceedings of the SOFSEM 2026: Theory and Practice of Computer Science, 2026

2025

Polynomial-time Configuration Generator for Connected Unlabeled Multi-Agent Pathfinding.

Takahiro Suzuki, Keisuke Okumura

CoRR, October, 2025

Coloring Reconfiguration Under Color Swapping.

Janosch Fuchs, Rin Saito, Tatsuhiro Suga, Takahiro Suzuki, Yuma Tamura

Proceedings of the 36th International Symposium on Algorithms and Computation, 2025

2024

Parameterized Complexity of Weighted Target Set Selection.

Takahiro Suzuki, Kei Kimura, Akira Suzuki, Yuma Tamura, Xiao Zhou

Proceedings of the Theory and Applications of Models of Computation, 2024