Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application. - Kunihiro Wasa; Yusaku Kaneta; Takeaki Uno; Hiroki Arimura (COCOON, 2012)

Polynomial Delay and Space Discovery of Connected and Acyclic Sub-hypergraphs in a Hypergraph. - Kunihiro Wasa; Takeaki Uno; Kouichi Hirata; Hiroki Arimura (Discovery Science, 2013)

Faster Algorithms for Tree Similarity Based on Compressed Enumeration of Bounded-Sized Ordered Subtrees. - Kunihiro Wasa; Kouichi Hirata; Takeaki Uno; Hiroki Arimura (SISAP, 2013)

Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph. - Kunihiro Wasa; Hiroki Arimura; Takeaki Uno (ISAAC, 2014)

Constant Time Enumeration of Subtrees with Exactly k Nodes in a Tree. - Kunihiro Wasa; Yusaku Kaneta; Takeaki Uno; Hiroki Arimura (IEICE Trans. Inf. Syst., 2014)

Enumeration of Enumeration Algorithms. - Kunihiro Wasa (CoRR, 2016)

Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs. - Alessio Conte; Kazuhiro Kurita; Kunihiro Wasa; Takeaki Uno (COCOA (2), 2017)

Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph. - Alessio Conte; Mamadou Moustapha Kanté; Yota Otachi; Takeaki Uno; Kunihiro Wasa (COCOON, 2017)

On Maximal Cliques with Connectivity Constraints in Directed Graphs. - Alessio Conte; Mamadou Moustapha Kanté; Takeaki Uno; Kunihiro Wasa (ISAAC, 2017)

Ladder-Lottery Realization. - Katsuhisa Yamanaka; Takashi Horiyama; Takeaki Uno; Kunihiro Wasa (CCCG, 2018)

An Efficient Algorithm for Enumerating Induced Subgraphs with Bounded Degeneracy. - Kunihiro Wasa; Takeaki Uno (COCOA, 2018)

Efficient Enumeration of Bipartite Subgraphs in Graphs. - Kunihiro Wasa; Takeaki Uno (COCOON, 2018)

Exact Algorithms for the Max-Min Dispersion Problem. - Toshihiro Akagi; Tetsuya Araki; Takashi Horiyama; Shin-Ichi Nakano; Yoshio Okamoto; Yota Otachi; Toshiki Saitoh; Ryuhei Uehara; Takeaki Uno; Kunihiro Wasa (FAW, 2018)

Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. - Kazuhiro Kurita; Kunihiro Wasa; Alessio Conte; Takeaki Uno; Hiroki Arimura (IWOCA, 2018)

Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four. - Kazuhiro Kurita; Kunihiro Wasa; Takeaki Uno; Hiroki Arimura (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs. - Kazuhiro Kurita; Kunihiro Wasa; Takeaki Uno; Hiroki Arimura (IWOCA, 2019)

The Perfect Matching Reconfiguration Problem. - Marthe Bonamy; Nicolas Bousquet 001; Marc Heinrich; Takehiro Ito; Yusuke Kobayashi 001; Arnaud Mary; Moritz Mühlenthaler; Kunihiro Wasa (MFCS, 2019)

Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs. - Alessio Conte; Roberto Grossi; Mamadou Moustapha Kanté; Andrea Marino 001; Takeaki Uno; Kunihiro Wasa (MFCS, 2019)

Constant Amortized Time Enumeration of Independent Sets for Graphs with Forbidden Subgraphs on Fixed Number of Vertices. - Kazuhiro Kurita; Kunihiro Wasa; Hiroki Arimura; Takeaki Uno (CoRR, 2019)

The Complexity of Induced Tree Reconfiguration Problems. - Kunihiro Wasa; Katsuhisa Yamanaka; Hiroki Arimura (IEICE Trans. Inf. Syst., 2019)

Finding the Anticover of a String. - Mai Alzamel; Alessio Conte; Shuhei Denzumi; Roberto Grossi; Costas S. Iliopoulos; Kazuhiro Kurita; Kunihiro Wasa (CPM, 2020)

Reconfiguration of Spanning Trees with Many or Few Leaves. - Nicolas Bousquet 001; Takehiro Ito; Yusuke Kobayashi 001; Haruka Mizuta; Paul Ouvrard; Akira Suzuki 001; Kunihiro Wasa (ESA, 2020)

Shortest Reconfiguration of Colorings Under Kempe Changes. - Marthe Bonamy; Marc Heinrich; Takehiro Ito; Yusuke Kobayashi 001; Haruka Mizuta; Moritz Mühlenthaler; Akira Suzuki 001; Kunihiro Wasa (STACS, 2020)

Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Cardinality Constraints. - Yasuaki Kobayashi; Kazuhiro Kurita; Kunihiro Wasa (CoRR, 2020)

Polynomial Delay Enumeration for Minimal Steiner Problems. - Yasuaki Kobayashi; Kazuhiro Kurita; Kunihiro Wasa (CoRR, 2020)

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 (J. Cheminformatics, 2020)

Diameter of colorings under Kempe changes. - Marthe Bonamy; Marc Heinrich; Takehiro Ito; Yusuke Kobayashi 001; Haruka Mizuta; Moritz Mühlenthaler; Akira Suzuki 001; Kunihiro Wasa (Theor. Comput. Sci., 2020)

Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph. - Alessio Conte; Mamadou Moustapha Kanté; Yota Otachi; Takeaki Uno; Kunihiro Wasa (Theor. Comput. Sci., 2020)

Reconfiguring Directed Trees in a Digraph. - Takehiro Ito; Yuni Iwamasa; Yasuaki Kobayashi; Yu Nakahata; Yota Otachi; Kunihiro Wasa (COCOON, 2021)

Polynomial-Delay Enumeration of Large Maximal Matchings. - Yasuaki Kobayashi; Kazuhiro Kurita; Kunihiro Wasa (CoRR, 2021)

Maximal strongly connected cliques in directed graphs: Algorithms and bounds. - Alessio Conte; Mamadou Moustapha Kanté; Takeaki Uno; Kunihiro Wasa (Discret. Appl. Math., 2021)

Efficient enumeration of dominating sets for sparse graphs. - Kazuhiro Kurita; Kunihiro Wasa; Hiroki Arimura; Takeaki Uno (Discret. Appl. Math., 2021)

Max-Min 3-Dispersion Problems. - Takashi Horiyama; Shin-Ichi Nakano; Toshiki Saitoh; Koki Suetsugu; Akira Suzuki 001; Ryuhei Uehara; Takeaki Uno; Kunihiro Wasa (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021)

A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number. - Kazuhiro Kurita; Kunihiro Wasa; Takeaki Uno; Hiroki Arimura (Theor. Comput. Sci., 2021)

Optimal reconfiguration of optimal ladder lotteries. - Katsuhisa Yamanaka; Takashi Horiyama; Kunihiro Wasa (Theor. Comput. Sci., 2021)

Independent Set Reconfiguration on Directed Graphs. - Takehiro Ito; Yuni Iwamasa; Yasuaki Kobayashi; Yu Nakahata; Yota Otachi; Masahiro Takahashi; Kunihiro Wasa (MFCS, 2022)

Linear-Delay Enumeration for Minimal Steiner Problems. - Yasuaki Kobayashi; Kazuhiro Kurita; Kunihiro Wasa (PODS, 2022)

Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint. - Nicolas Bousquet 001; Takehiro Ito; Yusuke Kobayashi 001; Haruka Mizuta; Paul Ouvrard; Akira Suzuki 001; Kunihiro Wasa (STACS, 2022)

Reconfiguration of Regular Induced Subgraphs. - Hiroshi Eto; Takehiro Ito; Yasuaki Kobayashi; Yota Otachi; Kunihiro Wasa (WALCOM, 2022)

Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings. - Yasuaki Kobayashi; Kazuhiro Kurita; Kunihiro Wasa (WG, 2022)

Constant amortized time enumeration of Eulerian trails. - Kazuhiro Kurita; Kunihiro Wasa (Theor. Comput. Sci., 2022)

Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids. - Yasuaki Kobayashi; Kazuhiro Kurita; Kunihiro Wasa (MFCS, 2023)

Hardness of braided quantum circuit optimization in the surface code. - Kunihiro Wasa; Shin Nishio; Koki Suetsugu; Michael Hanks; Ashley Stephens; Yu Yokoi; Kae Nemoto (CoRR, 2023)

Reconfiguring (non-spanning) arborescences. - Takehiro Ito; Yuni Iwamasa; Yasuaki Kobayashi; Yu Nakahata; Yota Otachi; Kunihiro Wasa (Theor. Comput. Sci., 2023)

Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints. - Nicolas Bousquet 001; Takehiro Ito; Yusuke Kobayashi 001; Haruka Mizuta; Paul Ouvrard; Akira Suzuki 001; Kunihiro Wasa (Algorithmica, 2023)

An approximation algorithm for K-best enumeration of minimal connected edge dominating sets with cardinality constraints. - Kazuhiro Kurita; Kunihiro Wasa (Theor. Comput. Sci., 2024)

On the hardness of inclusion-wise minimal separators enumeration. - Caroline Brosse; Oscar Defrain; Kazuhiro Kurita; Vincent Limouzy; Takeaki Uno; Kunihiro Wasa (Inf. Process. Lett., 2024)

Designing Output Sensitive Algorithms for Subgraph Enumeration. - Alessio Conte; Kazuhiro Kurita; Andrea Marino 001; Giulia Punzi; Takeaki Uno; Kunihiro Wasa (From Strings to Graphs, and Back Again, 2025)

Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints. - Yasuaki Kobayashi; Kazuhiro Kurita; Kunihiro Wasa (Discret. Appl. Math., 2025)

Polynomial-delay enumeration of large maximal common independent sets in two matroids and beyond. - Yasuaki Kobayashi; Kazuhiro Kurita; Kunihiro Wasa (Inf. Comput., 2025)

Reconfiguration and enumeration of optimal cyclic ladder lotteries. - Yuta Nozaki; Kunihiro Wasa; Katsuhisa Yamanaka (Theor. Comput. Sci., 2025)

Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size. - Alessio Conte; Roberto Grossi; Yasuaki Kobayashi; Kazuhiro Kurita; Davide Rucci; Takeaki Uno; Kunihiro Wasa (Algorithmica, 2025)