SEARCH
Search Details
WASA Kunihiro
Faculty of Science and Engineering Department of Applied Informatics
Associate Professor
Researchmap URL
https://researchmap.jp/wasaProfile
Enumeration of enumeration algorithm:
https://arxiv.org/abs/1605.05102
Career
■ Career
- Apr. 2023 - Present
Hosei University, Faculty of Science and Engineering Faculty of Science and Engineering, Associate Professor - Apr. 2022 - Mar. 2023
Hosei University, Faculty of Science and Engineering Faculty of Science and Engineering, Lecturer - Apr. 2020 - Mar. 2022
Toyohashi University of Technology, Faculty of Engineering Department of Computer Science and Engineering, Assistant professor - Oct. 2019 - Mar. 2020
Tokai University, 非常勤講師 - Apr. 2018 - Mar. 2020
National Institute of Informatics, Principles of Informatics Research Division, Assistant Professor by Special Appointment - Apr. 2016 - Mar. 2018
National Institute of Informatics, Principles of Informatics Research Division, Researcher by Special Appointment - Apr. 2017 - Sep. 2017
Seikei University, 非常勤講師
- Apr. 2013 - Mar. 2016, Hokkaido University, Graduate School of Information Science and Technology, Division of Computer Science
- Apr. 2011 - Mar. 2013, Hokkaido University, Graduate School of Information Science and Technology, Division of Computer Science
- Apr. 2007 - Mar. 2011, Hokkaido University, School of Engineering, Department of Electronics and Information Engineering
- Apr. 2002 - Mar. 2005, 北海道立手稲高等学校
Research activity information
■ Award
- Mar. 2023
Information Processing Society of Japan, IPSJ Yamashita SIG Research Award
Constant Amortized Time Enumeration of Eulerian trails
和佐州洋 - Mar. 2017
The Institute of Electronics, Information and Communication Engineers, Sponsor Award of I-Scover Utilization Competition
あなたの師匠は誰？
Kunihiro WASA;Tetsuya ARAKI - Jul. 2016
情報処理学会, 2016年度コンピュータサイエンス領域奨励賞
和佐州洋 - Mar. 2016
北海道大学, 北海道大学大学院 情報科学研究科 研究科長賞
和佐州洋 - Jul. 2015
情報処理学会, 2015年度コンピュータサイエンス領域奨励賞
和佐州洋 - Jun. 2013
人工知能学会, 2012年度研究会優秀賞
和佐州洋;有村博紀;宇野毅明;平田耕一 - May 2013
日本学生支援機構, 特に優れた業績による返還免除（全額）
和佐州洋 - Mar. 2013
北海道大学, 北海道大学大学院 情報科学研究科 専攻長賞
和佐州洋 - Mar. 2012
DEIM2012, 学生奨励賞
和佐州洋;金田悠作;宇野毅明;有村博紀
- Polynomial-delay enumeration of large maximal common independent sets in two matroids and beyond.
Yasuaki Kobayashi; Kazuhiro Kurita; Kunihiro Wasa
Inf. Comput., 2025 - Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints
Yasuaki Kobayashi; Kazuhiro Kurita; Kunihiro Wasa
Discrete Applied Mathematics, Jan. 2025 - On the hardness of inclusion-wise minimal separators enumeration
Caroline Brosse; Oscar Defrain; Kazuhiro Kurita; Vincent Limouzy; Takeaki Uno; Kunihiro Wasa
Information Processing Letters, Mar. 2024, [Reviewed] - An approximation algorithm for K-best enumeration of minimal connected edge dominating sets with cardinality constraints.
Kazuhiro Kurita; Kunihiro Wasa
Theor. Comput. Sci., 2024 - Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size.
Alessio Conte; Roberto Grossi; Yasuaki Kobayashi; Kazuhiro Kurita; Davide Rucci; Takeaki Uno; Kunihiro Wasa
CoRR, 2024 - Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries
Yuta Nozaki; Kunihiro Wasa; Katsuhisa Yamanaka
Lecture Notes in Computer Science, 03 Jun. 2023, [Reviewed] - Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints
Nicolas Bousquet; Takehiro Ito; Yusuke Kobayashi; Haruka Mizuta; Paul Ouvrard; Akira Suzuki; Kunihiro Wasa
Algorithmica, 10 Apr. 2023, [Reviewed] - Hardness of braided quantum circuit optimization in the surface code
Kunihiro Wasa; Shin Nishio; Koki Suetsugu; Michael Hanks; Ashley Stephens; Yu Yokoi; Kae Nemoto
IEEE Transactions on Quantum Engineering, 02 Mar. 2023, [Reviewed] - Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids.
Yasuaki Kobayashi; Kazuhiro Kurita; Kunihiro Wasa
48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023), 2023, [Reviewed] - Reconfiguring (non-spanning) arborescences
Takehiro Ito; Yuni Iwamasa; Yasuaki Kobayashi; Yu Nakahata; Yota Otachi; Kunihiro Wasa
Theoretical Computer Science, Dec. 2022, [Reviewed] - Linear-Delay Enumeration for Minimal Steiner Problems
Yasuaki Kobayashi; Kazuhiro Kurita; Kunihiro Wasa
Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 12 Jun. 2022, [Reviewed] - Constant amortized time enumeration of Eulerian trails
Kazuhiro Kurita; Kunihiro Wasa
Theoretical Computer Science, Jun. 2022, [Reviewed]
Lead, Corresponding - Reconfiguration of Regular Induced Subgraphs
Hiroshi Eto; Takehiro Ito; Yasuaki Kobayashi; Yota Otachi; Kunihiro Wasa
WALCOM: Algorithms and Computation, 24 Mar. 2022 - Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint.
Nicolas Bousquet; Takehiro Ito; Yusuke Kobayash; Haruka Mizuta; Paul Ouvrard; Akira Suzuki; Kunihiro Wasa
39th International Symposium on Theoretical Aspects of Computer Science(STACS), 09 Mar. 2022, [Reviewed] - Independent set reconfiguration on directed graphs.
Takehiro Ito; Yuni Iwamasa; Yasuaki Kobayashi; Yu Nakahata; Yota Otachi; Masahiro Takahashi; Kunihiro Wasa
CoRR, 2022 - Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings
Yasuaki Kobayashi; Kazuhiro Kurita; Kunihiro Wasa
Graph-Theoretic Concepts in Computer Science, 2022, [Reviewed] - Independent Set Reconfiguration on Directed Graphs.
Takehiro Ito; Yuni Iwamasa; Yasuaki Kobayashi; Yu Nakahata; Yota Otachi; Masahiro Takahashi; Kunihiro Wasa
Proc. of 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), 2022 - Reconfiguring Directed Trees in a Digraph
Takehiro Ito; Yuni Iwamasa; Yasuaki Kobayashi; Yu Nakahata; Yota Otachi; Kunihiro Wasa
Lecture Notes in Computer Science, Oct. 2021 - Max-Min 3-Dispersion Problems
Takashi HORIYAMA; Shin-ichi NAKANO; Toshiki SAITOH; Koki SUETSUGU; Akira SUZUKI; Ryuhei UEHARA; Takeaki UNO; Kunihiro WASA
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 01 Sep. 2021, [Reviewed] - A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number
Kazuhiro Kurita; Kunihiro Wasa; Takeaki Uno; Hiroki Arimura
Theoretical Computer Science, May 2021, [Reviewed] - Efficient enumeration of dominating sets for sparse graphs.
Kazuhiro Kurita; Kunihiro Wasa; Hiroki Arimura; Takeaki Uno
Discrete Applied Mathematics, 2021 - Reconfiguring Directed Trees in a Digraph.
Takehiro Ito; Yuni Iwamasa; Yasuaki Kobayashi; Yu Nakahata; Yota Otachi; Kunihiro Wasa
CoRR, 2021 - Polynomial-Delay Enumeration of Large Maximal Matchings.
Yasuaki Kobayashi; Kazuhiro Kurita; Kunihiro Wasa
CoRR, 2021 - Optimal reconfiguration of optimal ladder lotteries
Katsuhisa Yamanaka; Takashi Horiyama; Kunihiro Wasa
Theoretical Computer Science, Jan. 2021, [Reviewed] - CompRet: a comprehensive recommendation framework for chemical synthesis planning with algorithmic enumeration
Ryosuke Shibukawa; Shoichi Ishida; Kazuki Yoshizoe; Kunihiro Wasa; Kiyosei Takasu; Yasushi Okuno; Kei Terayama; Koji Tsuda
Journal of Cheminformatics, Dec. 2020, [Reviewed] - Diameter of colorings under Kempe changes
Marthe Bonamy; Marc Heinrich; Takehiro Ito; Yusuke Kobayashi; Haruka Mizuta; Moritz Mühlenthaler; Akira Suzuki; Kunihiro Wasa
Theoretical Computer Science, Oct. 2020, [Reviewed] - Reconfiguration of Spanning Trees with Many or Few Leaves
Nicolas Bousquet; Takehiro Ito; Yusuke Kobayashi; Haruka Mizuta; Paul Ouvrard; Akira Suzuki; Kunihiro Wasa
The proceedings of the 28th Annual European Symposium on Algorithms (ESA 2020), Aug. 2020, [Reviewed] - Maximal strongly connected cliques in directed graphs: Algorithms and bounds
Alessio Conte; Mamadou Moustapha Kanté; Takeaki Uno; Kunihiro Wasa
Discrete Applied Mathematics, Jun. 2020, [Reviewed] - Finding the Anticover of a String
Mai Alzamel; Alessio Conte; Shuhei Denzumi; Roberto Grossi; Costas S. Iliopoulos; Kazuhiro Kurita; Kunihiro Wasa
The proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020), Jun. 2020, [Reviewed] - Efficient Enumeration of Maximal k-Degenerate Induced Subgraphs of a Chordal Graph
Alessio Conte; Mamadou M. Kanté; Yota Otachi; Takeaki Uno; Kunihiro Wasa
Theoretical Computer Science, May 2020, [Reviewed] - Shortest Reconfiguration of Colorings Under Kempe Changes
Marthe Bonamy; Marc Heinrich; Takehiro Ito; Yusuke Kobayashi; Haruka Mizuta; Moritz Mühlenthaler; Akira Suzuki; Kunihiro Wasa
The proceedings of The 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), Mar. 2020, [Reviewed] - Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Cardinality Constraints.
Yasuaki Kobayashi; Kazuhiro Kurita; Kunihiro Wasa
CoRR, 2020 - The Perfect Matching Reconfiguration Problem
Marthe Bonamy; Nicolas Bousquet; Marc Heinrich; Takehiro Ito; Yusuke Kobayashi; Arnaud Mary; Moritz Mühlenthaler; Kunihiro Wasa
The proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), Aug. 2019, [Reviewed] - Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs
Alessio Conte; Roberto Grossi; Mamadou Moustapha Kanté; Andrea Marino; Takeaki Uno; Kunihiro Wasa
The proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany., Aug. 2019, [Reviewed] - An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs.
Kazuhiro Kurita; Kunihiro Wasa; Takeaki Uno; Hiroki Arimura
The proceedings of the 30th International Workshop on Combinatorial Algorithms (IWOCA 2019), Jul. 2019, [Reviewed] - Max-Min 3-Dispersion Problems.
Takashi Horiyama; Shin-Ichi Nakano; Toshiki Saitoh; Koki Suetsugu; Akira Suzuki; Ryuhei Uehara; Takeaki Uno; Kunihiro Wasa
The proceedings of the 25th International Conference on Computing and Combinatorics (COCOON 2019), Jul. 2019, [Reviewed] - Diameter of Colorings Under Kempe Changes
Marthe Bonamy; Marc Heinrich; Takehiro Ito; Yusuke Kobayashi; Haruka Mizuta; Moritz Mühlenthaler; Akira Suzuki; Kunihiro Wasa
The proceedings of the 25th International Conference on Computing and Combinatorics (COCOON 2019), Jul. 2019, [Reviewed] - The Complexity of Induced Tree Reconfiguration Problems
WASA Kunihiro; YAMANAKA Katsuhisa; ARIMURA Hiroki
IEICE Transactions on Information and Systems, 2019, [Reviewed] - Efficient Enumeration of Dominating Sets for Sparse Graphs
Kazuhiro Kurita; Kunihiro Wasa; Hiroki Arimura; Takeaki Uno
The proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC 2018), Dec. 2018, [Reviewed] - An Efficient Algorithm for Enumerating Induced Subgraphs with Bounded Degeneracy.
Kunihiro Wasa; Takeaki Uno
The proceedings of the 12th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2018), Dec. 2018, [Reviewed] - Ladder-Lottery Realization
Katsuhisa Yamanaka; Takashi Horiyama; Takeaki Uno; Kunihiro Wasa
The proceedings of the 30th Canadian Conference on Computational Geometry (CCCG 2018), Aug. 2018, [Reviewed] - Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth.
Kazuhiro Kurita; Kunihiro Wasa; Alessio Conte; Takeaki Uno; Hiroki Arimura
The proceedings of the 29th International Workshop on Combinatorial Algorithms (IWOCA 2018), Jul. 2018, [Reviewed] - Efficient Enumeration of Bipartite Subgraphs in Graphs.
Kunihiro Wasa; Takeaki Uno
The proceedings of the 24th International Conference on Combinatorial Optimization and Applications (COCOA 2018), Jul. 2018, [Reviewed] - Exact Algorithms for the Max-Min Dispersion Problem
Akagi Toshihiro; Araki Tetsuya; Horiyama Takashi; Nakano Shin-Ichi; Okamoto Yoshio; Otachi Yota; Saitoh Toshiki; Uehara Ryuhei; Uno Takeaki; Wasa Kunihiro
Lecture Notes in Computer Science, 21 Mar. 2018, [Reviewed] - The Current Situation of Subgraph Enumeration Algorithms
和佐 州洋
電子情報通信学会誌 = The journal of the Institute of Electronics, Information and Communication Engineers, Mar. 2018 - Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four
KURITA Kazuhiro; WASA Kunihiro; UNO Takeaki; ARIMURA Hiroki
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2018 - On Maximal Cliques with Connectivity Constraints in Directed Graphs.
Alessio Conte; Mamadou Moustapha Kanté; Takeaki Uno; Kunihiro Wasa
The proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC 2017), Dec. 2017, [Reviewed] - Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs.
Alessio Conte; Kazuhiro Kurita; Kunihiro Wasa; Takeaki Uno
The proceedings of the 11th International Conference on Combinatorial Optimization and Applications (COCOA 2017), Dec. 2017, [Reviewed] - Efficient enumeration of maximal k-degenerate subgraphs in a chordal graph
Alessio Conte; Mamadou Moustapha Kanté; Yota Otachi; Takeaki Uno; Kunihiro Wasa
The proceedings of the 23rd International Computing and Combinatorics Conference (COCOON 2017), Aug. 2017, [Reviewed] - The Complexity of Induced Tree Reconfiguration Problems
Kunihiro Wasa; Katsuhisa Yamanaka; Hiroki Arimura
The proceedings of the 10th International Conference on Language and Automata Theory and Applications (LATA 2016), Mar. 2016, [Reviewed] - Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph
Kunihiro Wasa; Hiroki Arimura; Takeaki Uno
The proceedings of the 25th International Symposium on Algorithms and Computation (ISAAC 2014), Dec. 2014, [Reviewed] - Constant Time Enumeration of Subtrees with Exactly k Nodes in a Tree
WASA Kunihiro; KANETA Yusaku; UNO Takeaki; ARIMURA Hiroki
IEICE Transactions on Information and Systems, 2014, [Reviewed] - Faster Algorithms for Tree Similarity Based on Compressed Enumeration of Bounded-Sized Ordered Subtrees
Kunihiro Wasa; Kouichi Hirata; Takeaki Uno; Hiroki Arimura
The proceedings of the 6th International Conference on Similarity Search and Applications (SISAP 2013), Oct. 2013, [Reviewed] - Polynomial Delay and Space Discovery of Connected and Acyclic Sub-hypergraphs in a Hypergraph
Kunihiro Wasa; Takeaki Uno; Kouichi Hirata; Hiroki Arimura
The proceedings of the 16th International Conference on Discovery Science (DS 2013), Oct. 2013, [Reviewed] - Constant time enumeration of bounded-size subtrees in trees and its application
Kunihiro Wasa; Yusaku Kaneta; Takeaki Uno; Hiroki Arimura
The proceedings of 18th Annual International Conference on Computing and Combinatorics (COCOON 2012), Aug. 2012, [Reviewed]
- Efficient Enumeration of Spanning Subgraphs in Planar Graphs with Edge Connectivity Constraints
KOBAYASHI Yasuaki; KURITA Kazuhiro; WASA Kunihiro
電子情報通信学会技術研究報告(Web), 2022 - Constant Amortized Time Enumeration of Eulerian trails
Kazuhiro Kurita; Kunihiro Wasa
研究報告アルゴリズム（AL）, Apr. 2021
Corresponding - Polynomial Delay Enumeration for Steiner Problems
Yasuaki Kobayashi; Kazuhiro Kurita; Kunihiro Wasa
信学技報, 23 Oct. 2020 - 最大クリークサイズが定数であるグラフに対する独立点集合のならし定数時間列挙
栗田 和宏; 和佐 州洋; 宇野 毅明; 有村 博紀
電子情報通信学会コンピューテーション研究会, Nov. 2019 - An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Graphs
Kazuhiro Kurita; Kunihiro Wasa; Takeaki Uno; Hiroki Arimura
研究報告アルゴリズム（AL）, 22 Jan. 2019 - The Complexity of Ladder-Lottery Realization Problem
Katsuhisa Yamanaka; Takashi Horiyama; Takeaki Uno; Kunihiro Wasa
電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 12 Nov. 2018 - Subgraph Enumeration: Efficient Algorithms and Empirical Studies
Kazuhiro Kurita; Kunihiro Wasa; Takeaki Uno; Hiroki Arimura
The 2nd International Workshop on Enumeration Problems & Application, 06 Nov. 2018 - Efficient Enumeration Algorithm for Dominating Sets in Bounded Degenerate Graphs (Foundations and Applications of Algorithms and Computation)
Kurita Kazuhiro; Wasa Kunihiro; Arimura Hiroki; Uno Takeaki
数理解析研究所講究録, Aug. 2018 - Efficient Enumeration of Subgraphs with Large Girth
栗田 和宏; Alessio Conte; 和佐 州洋; 宇野 毅明; 有村 博紀
第80回全国大会講演論文集, 13 Mar. 2018 - Efficient Enumeration of Dominating Sets in k-degenerate Graphs (コンピュテーション)
栗田 和宏; 和佐 州洋; 宇野 毅明; 有村 博紀
電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 21 Dec. 2017 - グラフ中に含まれる縮退部分グラフの列挙
和佐 州洋; 宇野 毅明
第161回アルゴリズム研究会, Jan. 2017 - Sampling Algorithms for Subgraphs Based on Enumeration Trees and MCMC
和佐州洋; 石畠正和; 宇野毅明; 湊真一
人工知能学会人工知能基本問題研究会資料, 07 Aug. 2016 - 二部グラフ中に含まれる弦二部誘導グラフの列挙
和佐 州洋; 有村 博紀; 宇野 毅明; 平田 耕一
第154回情報処理学会アルゴリズム研究会, Sep. 2015 - Reconfiguration Problem for Maximal Induced Trees
和佐 州洋; 山中 克久; 有村 博紀
電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 12 Jun. 2015 - Enumeration of Induced Subtrees in a K-Degenerate Graph
WASA KUNIHIRO; ARIMURA HIROKI; UNO TAKEAKI
IEICE technical report. Theoretical foundations of Computing, 06 Jun. 2014 - Enumeration of Induced Subtrees in a K-Degenerate Graph
Kunihiro Wasa; Hiroki Arimura; Takeaki Uno
第148回情報処理学会アルゴリズム研究会, Jun. 2014 - Efficient Enumeration of Acyclic Hyperedge-Contracted Sub-Hypergraphs in a Hypergraph
和佐 州洋; 有村 博紀; 宇野 毅明; 平田 耕一
研究報告アルゴリズム（AL）, 22 Feb. 2013 - Efficient Enumeration of Acyclic Sub-hypergraphs in Hypergraphs
和佐 州洋; 有村 博紀; 宇野 毅明
人工知能基本問題研究会, 24 Jan. 2013 - Constant Amortized Time Enumeration of Bounded-Size Subtrees in Trees
WASA KUNIHIRO; UNO TAKEAKI; ARIMURA HIROKI
IEICE technical report. Theoretical foundations of Computing, 07 May 2012 - 木に含まれる限定サイズ部分木の列挙
和佐 州洋; 宇野 毅明; 有村 博紀
第140回情報処理学会アルゴリズム研究会, May 2012 - G-024 Random Generation and Inductive Learning of Tree Structures
Wasa Kunihiro; Arimura Hiroki; Ito Kimihito
情報科学技術フォーラム講演論文集, 07 Sep. 2011
- 列挙アルゴリズム構築技法の紹介
和佐 州洋
第21回組合せ論若手研究集会, 17 Feb. 2025, [Invited] - 円筒阿弥陀籤に対する組合せ遷移と列挙
野崎 雄太; 和佐 州洋; 山中 克久
27 Feb. 2023, コンピューティング基盤CREST「学習/数理モデルに基づく時空間展開型アーキテクチャの創出と応用」(代表：本村真人(東工大))機械学習グループ - 組合せ遷移と列挙
和佐 州洋
学術変革領域研究(B)「組合せ遷移」最終報告会, 21 Feb. 2023, 学術変革領域研究(B)「組合せ遷移」 - Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries
Yuta Nozaki; Kunihiro Wasa; Katsuhisa Yamanaka
コンピュテーション研究会, 06 Dec. 2022 - Hardness of braided quantum circuit optimization in the surface code
Kunihiro Wasa; Shin Nishio; Koki Suetsugu; Michael Hanks; Ashley Stephens; Yu Yokoi; Kae Nemoto
The 4th International Workshop on QUANTUM RESOURCE ESTIMATION (QRE2022), 18 Jun. 2022 - 部分グラフを列挙する効率よいアルゴリズムについて
和佐州洋
ＲＩＭＳ共同研究（グループ型）「グラフの新たな局所変形の開発とその応用」, 05 Mar. 2019, [Invited] - 固定クリーク数グラフに対する誘導木のならし定数時間列挙
栗田 和宏; 和佐 州洋; 宇野 毅明; 有村 博紀
冬のLAシンポジウム, 05 Feb. 2019 - 簡単に列挙できる部分構造について
和佐州洋
基盤(S) 離散構造処理系プロジェクト 「2018年度 秋のワークショップ」, 25 Nov. 2018 - Efficient Enumeration of Dominating Sets in k-degenerate Graphs (コンピュテーション)
栗田 和宏; 和佐 州洋; 宇野 毅明; 有村 博紀
電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 21 Dec. 2017 - Efficient Enumeration Algorithms for Connected Induced Subgraphs with Large Girth
Kazuhiro Kurita; Alessio Conte; Kunihiro Wasa; Takeaki Uno; Hiroki Arimura
The 20th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC 2017), 25 Aug. 2017 - Fast Enumeration Algorithms for Induced Trees in Graphs
Kunihiro Wasa; Takeaki Uno; Hiroki Arimura
The 21st Conference of the International Federation of Operational Research Societies (IFORS2017), 16 Jul. 2017 - Enumerating all 2-edge-connected subgraphs
Katsuhisa Yamanaka; Takashi Hirayama; Hiroki Kaga; Naoki Katoh; Yasuaki Nishitani; Toshiki Saitoh; Kunihiro Wasa
The 21st Conference of the International Federation of Operational Research Societies (IFORS2017), 16 Jul. 2017 - Reconfiguring Optimal Ladder Lotteries
Takashi Horiyama; Kunihiro Wasa; Katsuhisa Yamanaka
The 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, 22 May 2017 - あなたの師匠は誰？
和佐州洋; 荒木 徹也
電子情報通信学会 総合大会,I-Scover企画セッション, 22 Mar. 2017 - Efficient Enumeration Algorithms for Bounded-size Degenerate Subgraphs in Graphs
Kunihiro Wasa; Takeaki Uno
WEPA 2016: First Workshop on Enumeration Problems and Applications, 21 Nov. 2016 - Efficient Enumeration of Induced Matchings in Graphs without Short Cycles
Kazuhiro Kurita; Kunihiro Wasa; Takeaki Uno; Hiroki Arimura
The 19th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^3 2016),, 02 Sep. 2016 - Enumeration Algorithm for Chordal Induced Bipartite Graphs of a Bipartite Graph
和佐州洋; 有村博紀; 宇野毅明; 平田耕一
情報処理学会研究報告(Web), 21 Sep. 2015 - 隠れマルコフモデルを用いた軌跡データに対するカーネルの設計
岩館 洸太; 和佐州洋; 有村 博紀
第7回データ工学と情報マネジメントに関するフォーラム（第13回日本データベース学会年次大会） (DEIM2015), 02 Mar. 2015 - Enumeration of Induced Subtrees in a K-Degenerate Graph
Kunihiro Wasa; Hiroki Arimura; Takeaki Uno
IPSJ SIG Notes, 06 Jun. 2014 - An Enumeration Problem of Connected and Acyclic Sub-hypergraphs in Hypergraphs
Kunihiro Wasa; Takeaki Uno; Kouichi Hirata; Hiroki Arimura
The 16th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2013), 12 Jul. 2013 - 超辺の縮約を許した非巡回部分超グラフの効率よい列挙
和佐 州洋; 有村 博紀; 宇野 毅明; 平田 耕一
第143回情報処理学会アルゴリズム研究会報告, Mar. 2013 - Efficient Enumeration of Acyclic Hyperedge-Contracted Sub-Hypergraphs in a Hypergraph
和佐 州洋; 有村 博紀; 宇野 毅明; 平田 耕一
研究報告アルゴリズム（AL）, 22 Feb. 2013 - 超グラフ中に含まれる非巡回部分超グラフの効率よい列挙,
和佐州洋; 有村博紀; 宇野毅明; 平田耕一
第88回人工知能基本問題研究会, Jan. 2013 - Constant Time Enumeration of Bounded-Sized Subtrees in Trees Based on Reverse Search
Kunihiro Wasa; Yusaku Kaneta; Takeaki Uno; Hiroki Arimura
The 15th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2012), 10 Jul. 2012 - Constant Amortized Time Enumeration of Bounded-Size Subtrees in Trees
WASA KUNIHIRO; UNO TAKEAKI; ARIMURA HIROKI
電子情報通信学会技術研究報告, 07 May 2012 - 半構造データに対する効率良い近接パターン照合アルゴリズム
和佐州洋; 金田悠作; 宇野毅明; 有村博紀
第4回データ工学と情報マネジメントに関するフォーラム (DEIM2012), 03 Mar. 2012 - G-024 Random Generation and Inductive Learning of Tree Structures
Wasa Kunihiro; Arimura Hiroki; Ito Kimihito
情報科学技術フォーラム講演論文集, 07 Sep. 2011
- Theoretical Computer Science 2
Sep. 2022 - Present
Hosei University - Experiments in information engineering III
Sep. 2022 - Present
Hosei University - Experiments in information engineering I
Sep. 2022 - Present
Hosei University - Programming Language C++
Sep. 2022 - Present
Hosei University - Programming language theory and design
Sep. 2022 - Present
Hosei University - Theoretical Computer Science 1
Apr. 2022 - Present
Hosei University - Seminar on information engineering
Apr. 2022 - Present
Hosei University - PBL
Apr. 2022 - Present
Hosei University - Introduction to information engineering
Apr. 2022 - Present
Hosei University - Compiler
Apr. 2022 - Present
Hosei University - Formal language theory and automata
Apr. 2022 - Present
Hosei University - Laboratory Experiments in Computer Science and Engineering
Apr. 2020 - Mar. 2022
Toyohashi University of Technology - 情報処理演習
Oct. 2019 - Mar. 2020
Tokai University - Apr. 2017 - Sep. 2017
成蹊大学
- Jun. 2015 - Present
THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS - Jun. 2015 - Present
INFORMATION PROCESSING SOCIETY OF JAPAN - May 2013 - Present
THE JAPANESE SOCIETY FOR ARTIFICIAL INTELLIGENCE
- Study on developing enumeration algorithms based on a supergraph technique
Grant-in-Aid for Early-Career Scientists
Hosei University
01 Apr. 2022 - 31 Mar. 2025 - 局所的重要性に着目した知識発見基盤技術の開発
Grant-in-Aid for Early-Career Scientists
National Institute of Informatics
01 Apr. 2019 - 31 Mar. 2022 - 色付き部分グラフの列挙アルゴリズムに関する研究
豊橋技術科学大学
Jul. 2020 - Mar. 2021 - グラフの縮退性に着目した列挙アルゴリズムの開発
Oct. 2017 - Mar. 2018 - 極大誘導グラフ列挙アルゴリズムに関する研究
Oct. 2016 - Mar. 2017 - 超高速列挙アルゴリズムを用いた構造データマイニングアルゴリズムの開発
Grant-in-Aid for JSPS Fellows
Hokkaido University
01 Apr. 2013 - 31 Mar. 2016
