研究室メンバーによる発表論文
2021年
論文誌
- Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, T. P. Sandhya: “Graph Orientation with Edge Modifications”, Int. J. Found. Comput. Sci. 32(2), 209–233, World Scientific Publishing Co., 2021.
- Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru: “Complexity and approximability of the happy set problem”, Theoretical Computer Science, 866, pp. 123–144, Elsevier, 2021.
- Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita: “Finding a Maximum Minimal Separator: Graph Classes and Fixed-Parameter Tractability”, Theoretical Computer Science, 865, pp. 131–140, Elsevier, 2021.
- Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza: “Computing the Largest Bond and the Maximum Connected Cut of a Graph”, Algorithmica, 83, pp. 1421–1458, Springer, 2021
2020年
論文誌
- Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom van der Zanden: “Subgraph Isomorphism on Graph Classes that Exclude a Substructure”, Algorithmica, 82, pp. 3566–3587, Springer, 2020.
- Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi: “Independent Set Reconfiguration Parameterized by Modular-Width”, Algorithmica, 82, pp. 2586–2605, Springer, 2020.
- Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora: “Parameterized Orientable Deletion”, Algorithmica, 82, pp. 1909–1938, Springer, 2020.
- Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi: “Parameterized Complexity of Safe Set”, Journal of Graph Algorithms and Applications, 24(3), pp. 215–245, 2020.
- Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan: “Reconfiguring spanning and induced subgraphs”, Theoretical Computer Science, 806, pp. 553–566, Elsevier, 2020.
2019年
論文誌
- Tesshu Hanaka, Hans L. Bodlaender, Tom van der Zanden, Hirotaka Ono: “On the Maximum Weight Minimal Separator”, Theoretical Computer Science, 796, pp. 294–308, Elsevier, 2019.
- Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono: “On Directed Covering and Domination Problems”, Discrete Applied Mathematics, 259, pp. 76–99, Elsevier, 2019.
- Keiichiro Kanemoto, Tesshu Hanaka, Shigemi Kagawa, Keisuke Nansai: Industrial clusters with substantial carbon-reduction potential, Economic Systems Research, 31(2), pp. 248–266, Routledge, 2019.
2018年
論文誌
- Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Hirotaka Ono, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu:
Safe sets in graphs: Graph classes and structural parameters. J. Comb. Optim.36(4): 1221-1242 (2018) - Hans L. Bodlaender, Hirotaka Ono, Yota Otachi:
A faster parameterized algorithm for Pseudoforest Deletion. Discrete Applied Mathematics236: 42-56 (2018)
2017年
論文誌
- Tesshu Hanaka, Shigemi Kagawa, Hirotaka Ono, Keiichiro Kanemoto: Finding environmentally critical transmission sectors, transactions, and paths in global supply chain networks. Energy Economics 68, 44-52 (2017)
国際会議会議録
Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono:
On Directed Covering and Domination Problems. ISAAC 2017: 45:1-45:12
On Directed Covering and Domination Problems. ISAAC 2017: 45:1-45:12
Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
Settlement Fund Circulation Problem. ISAAC 2017: 46:1-46:13
Settlement Fund Circulation Problem. ISAAC 2017: 46:1-46:13
Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono:
On the Maximum Weight Minimal Separator. TAMC 2017: 304-318
On the Maximum Weight Minimal Separator. TAMC 2017: 304-318
小野廣隆の業績はこちらをご覧ください．
