Clik here to view.
A Fixed-Parameter Algorithm for Max Edge Domination.
Tesshu Hanaka, Hirotaka Ono: A Fixed-Parameter Algorithm for Max Edge Domination. SOFSEM (Student Research Forum Papers / Posters) 2015: 31-40
View ArticleClik here to view.
On the Maximum Weight Minimal Separator.
Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono: On the Maximum Weight Minimal Separator. TAMC 2017: 304-318
View ArticleClik here to view.
On Directed Covering and Domination Problems.
Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono: On Directed Covering and Domination Problems. ISAAC 2017: 45:1-45:12
View ArticleClik here to view.
Optimal Partition of a Tree with Social Distance.
Masahiro Okubo, Tesshu Hanaka, Hirotaka Ono: Optimal Partition of a Tree with Social Distance. CoRR abs/1809.03392 (2018)
View ArticleClik here to view.
Parameterized Orientable Deletion.
Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora: Parameterized Orientable Deletion. CoRR abs/1807.11518 (2018)
View ArticleClik here to view.
Reconfiguring spanning and induced subgraphs.
Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan: Reconfiguring spanning and induced subgraphs. CoRR abs/1803.06074...
View ArticleClik here to view.
Parameterized Orientable Deletion.
Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora: Parameterized Orientable Deletion. SWAT 2018: 24:1-24:13
View ArticleClik here to view.
New Results on Directed Edge Dominating Set.
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis: New Results on Directed Edge Dominating Set. MFCS 2018: 67:1-67:16
View ArticleClik here to view.
Reconfiguring Spanning and Induced Subgraphs.
Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan: Reconfiguring Spanning and Induced Subgraphs. COCOON 2018: 428-440
View ArticleClik here to view.
Computational Complexity of Hedonic Games on Sparse Graphs.
Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono: Computational Complexity of Hedonic Games on Sparse Graphs. CoRR abs/1908.11554 (2019)
View ArticleClik here to view.
Parameterized Algorithms for Maximum Cut with Connectivity Constraints.
Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi: Parameterized Algorithms for Maximum Cut with Connectivity Constraints. CoRR abs/1908.03389 (2019)
View ArticleClik here to view.
Subgraph Isomorphism on Graph Classes that Exclude a Substructure.
Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden: Subgraph Isomorphism on Graph Classes that Exclude a Substructure. CoRR...
View ArticleClik here to view.
Independent Set Reconfiguration Parameterized by Modular-Width.
Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi: Independent Set Reconfiguration Parameterized by Modular-Width. CoRR abs/1905.00340 (2019)
View ArticleClik here to view.
New Results on Directed Edge Dominating Set.
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis: New Results on Directed Edge Dominating Set. CoRR abs/1902.04919 (2019)
View ArticleClik here to view.
Parameterized Complexity of Safe Set.
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi: Parameterized Complexity of Safe Set. CoRR abs/1901.09434 (2019)
View ArticleClik here to view.
Independent Set Reconfiguration Parameterized by Modular-Width.
Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi: Independent Set Reconfiguration Parameterized by Modular-Width. WG 2019: 285-297
View ArticleClik here to view.
Optimal Partition of a Tree with Social Distance.
Masahiro Okubo, Tesshu Hanaka, Hirotaka Ono: Optimal Partition of a Tree with Social Distance. WALCOM 2019: 121-132
View ArticleClik here to view.
Computational Complexity of Hedonic Games on Sparse Graphs.
Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono: Computational Complexity of Hedonic Games on Sparse Graphs. PRIMA 2019: 576-584
View ArticleClik here to view.
Parameterized Algorithms for Maximum Cut with Connectivity Constraints.
Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi: Parameterized Algorithms for Maximum Cut with Connectivity Constraints. IPEC 2019: 13:1-13:15
View ArticleClik here to view.
Subgraph Isomorphism on Graph Classes that Exclude a Substructure.
Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden: Subgraph Isomorphism on Graph Classes that Exclude a Substructure. CIAC 2019: 87-98
View Article
