Tohoku University · Graduate School of Information Science · 准教授

Research keywordsグラフアルゴリズム・パラメータ化計算量・組合せ遷移

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

• On the complexity of list $\mathcal H$-packing for sparse graph classesTatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
• On the complexity of list H-packing for sparse graph classesTatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
• Approximability of the independent feedback vertex set problem for bipartite graphsYuma Tamura, Takehiro Ito, Xiao Zhou
• Changing induced subgraph isomorphisms under extended reconfiguration rulesTatsuhiro Suga, Akira Suzuki, Yuma Tamura, Xiao Zhou

• グラフの構造的パラメータに基づく汎用的アルゴリズムの構築田村 祐馬
• 幅パラメータ定数グラフの構造解析とメタアルゴリズムの限界探究田村 祐馬
• 擬似独立性を持つフィードバック点集合問題の提唱とアルゴリズムの開発田村 祐馬

• Official profile