Scholar
Yota Otachi
Google Scholar ID: iCYwDnkAAAAJ
Nagoya University
Citations & Impact
Citations
1,100
H-index
19
i10-index
38
Publications
20
Co-authors
91
list available
Contact
No contact links provided.
Publications
Resume (English only)
Academic Achievements
- 1. Three papers including 'Forcing a unique minimum spanning tree and a unique shortest path' accepted by WALCOM 2026.
- 2. 'Independent set reconfiguration on directed graphs' accepted by SIAM Journal on Discrete Mathematics.
- 3. 'Hitting geodesic intervals in structurally restricted graphs' accepted by IPEC 2025.
- 4. 'Sequentially swapping tokens: Further on graph classes' accepted by Journal of Computer and System Sciences.
- 5. Two papers including 'Parameterized spanning tree congestion' and 'Broadcasting under structural restrictions' accepted by MFCS 2025.
- 6. 'On the complexity of List H-Packing for sparse graph classes' accepted by Theoretical Computer Science.
- 7. 'Hedonic seat arrangement problems' accepted by Autonomous Agents and Multi-Agent Systems.
- 8. 'Orientable burning number of graphs' accepted by Discrete Applied Mathematics.
- 9. 'Dichotomies for Tree Minor Containment with structural parameters' accepted by Theoretical Computer Science.
- 10. 'Structural parameterizations of vertex integrity' accepted by Theoretical Computer Science.
- 11. 'An improved spectral lower bound of treewidth' accepted by Information Processing Letters.
- 12. 'Algorithmic meta-theorems for combinatorial reconfiguration revisited' accepted by Algorithmica.
- 13. 'Finding induced subgraphs from graphs with small mim-width' accepted by SWAT 2024.
- 14. 'Grouped domination parameterized by vertex cover, twin cover, and beyond' accepted by Theoretical Computer Science.
Research Experience
- Research experience at Nagoya University.
Background
- Research Interests: Graph Theory, Algorithm Complexity, Combinatorial Optimization. Professional Field: Computer Science.
