Hokkaido University · Graduate School of Information Science and Technology / Faculty of Information Science and Technology

Research keywordsgraph algorithms・enumeration algorithms・reconfiguration problems・vertex cover・minimum spanning tree・directed graphs

This is a public-data preview. Personalized fit, contact angles, and saved workflows require sign-in.

• Finding Order-Preserving Subgraphs2026 · Proceedings of WALCOM 2026, Lecture Notes in Computer Science, 16444, 157, 171, 2026年,
• Forcing a Unique Minimum Spanning Tree and a Unique Shortest Path2026 · Proceedings of WALCOM 2026, Lecture Notes in Computer Science, 16444, 371, 385, 2026年,
• Finding One Local Optimum Is Easy - but What About Two?2026 · AAAI 2026, 40, 43, 37009, 37017, 2026年,
• Reconfiguration of Time-Respecting Arborescences.2026 · Algorithmica, 88, 1, 15, 15, 2026年02月,

• Official profile