Kunihiro Wasa

发表

Exact Algorithms for the Max-Min Dispersion Problem

Yota Otachi, Toshihiro Akagi, Tetsuya Araki, 2018, FAW.

Reconfiguration of Spanning Trees with Many or Few Leaves

Takehiro Ito, Kunihiro Wasa, Nicolas Bousquet, 2020, ESA.

Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs

Takeaki Uno, Kunihiro Wasa, Alessio Conte, 2017, COCOA.

On Maximal Cliques with Connectivity Constraints in Directed Graphs

Takeaki Uno, Kunihiro Wasa, Alessio Conte, 2017, ISAAC.

Constant Amortized Time Enumeration of Independent Sets for Graphs with Forbidden Subgraphs on Fixed Number of Vertices pdf

Hiroki Arimura, Takeaki Uno, Kunihiro Wasa, 2019, ArXiv.

Faster Algorithms for Tree Similarity Based on Compressed Enumeration of Bounded-Sized Ordered Subtrees

Hiroki Arimura, Kouichi Hirata, Takeaki Uno, 2013, SISAP.

CompRet: a comprehensive recommendation framework for chemical synthesis planning with algorithmic enumeration

Kunihiro Wasa, Yasushi Okuno, Kazuki Yoshizoe, 2020, Journal of Cheminformatics.

Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs

Roberto Grossi, Takeaki Uno, Kunihiro Wasa, 2019, MFCS.

Finding the Anticover of a String

Roberto Grossi, Kunihiro Wasa, Costas S. Iliopoulos, 2020, CPM.

Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Cardinality Constraints pdf

Kunihiro Wasa, Kazuhiro Kurita, Yasuaki Kobayashi, 2020, ArXiv.

The Perfect Matching Reconfiguration Problem pdf

Marthe Bonamy, Takehiro Ito, Kunihiro Wasa, 2019, MFCS.

Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph

Yota Otachi, Takeaki Uno, Kunihiro Wasa, 2020, Theor. Comput. Sci..

Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four

Hiroki Arimura, Takeaki Uno, Kunihiro Wasa, 2018, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

Efficient Enumeration of Dominating Sets for Sparse Graphs pdf

Hiroki Arimura, Takeaki Uno, Kunihiro Wasa, 2018, ISAAC.

Constant Time Enumeration of Subtrees with Exactly k Nodes in a Tree

Hiroki Arimura, Takeaki Uno, Kunihiro Wasa, 2014, IEICE Trans. Inf. Syst..

Efficient Enumeration of Bipartite Subgraphs in Graphs pdf

Takeaki Uno, Kunihiro Wasa, 2018, COCOON.

Shortest Reconfiguration of Colorings Under Kempe Changes

Marthe Bonamy, Takehiro Ito, Kunihiro Wasa, 2020, STACS.

Enumeration of Enumeration Algorithms pdf

Kunihiro Wasa, Kunihiro Wasa, 2016, ArXiv.

Ladder-Lottery Realization

Takashi Horiyama, Takeaki Uno, Kunihiro Wasa, 2018, CCCG.

Diameter of colorings under Kempe changes

Marthe Bonamy, Takehiro Ito, Kunihiro Wasa, 2020, Theor. Comput. Sci..

An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs

Hiroki Arimura, Takeaki Uno, Kunihiro Wasa, 2019, IWOCA.

An Efficient Algorithm for Enumerating Induced Subgraphs with Bounded Degeneracy

Takeaki Uno, Kunihiro Wasa, 2018, COCOA.

Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application

Hiroki Arimura, Takeaki Uno, Kunihiro Wasa, 2012, COCOON.

Diameter of Colorings Under Kempe Changes

Marthe Bonamy, Takehiro Ito, Kunihiro Wasa, 2019, COCOON.

Max-Min 3-Dispersion Problems

Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, 2019, COCOON.

Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth

Hiroki Arimura, Takeaki Uno, Kunihiro Wasa, 2018, IWOCA.

The Complexity of Induced Tree Reconfiguration Problems

Hiroki Arimura, Kunihiro Wasa, Katsuhisa Yamanaka, 2016, LATA.

The Complexity of Induced Tree Reconfiguration Problems

Hiroki Arimura, Kunihiro Wasa, Katsuhisa Yamanaka, 2019 .

Polynomial Delay Enumeration for Minimal Steiner Problems pdf

Kunihiro Wasa, Kazuhiro Kurita, Yasuaki Kobayashi, 2020, ArXiv.

Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph pdf

Hiroki Arimura, Takeaki Uno, Kunihiro Wasa, 2014, ISAAC.

Polynomial Delay and Space Discovery of Connected and Acyclic Sub-hypergraphs in a Hypergraph

Hiroki Arimura, Kouichi Hirata, Takeaki Uno, 2013, Discovery Science.

Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph

Yota Otachi, Takeaki Uno, Kunihiro Wasa, 2017, COCOON.

An Approximation Algorithm for $K$-best Enumeration of Minimal Connected Edge Dominating Sets with Cardinality Constraints

Kunihiro Wasa, Kazuhiro Kurita, 2022 .

Reconfiguring Directed Trees in a Digraph pdf

Yota Otachi, Takehiro Ito, Kunihiro Wasa, 2021, COCOON.

Max-Min 3-dispersion Problems

Takashi Horiyama, Toshiki Saitoh, Ryuhei Uehara, 2021 .

Efficient enumeration of dominating sets for sparse graphs

Hiroki Arimura, Takeaki Uno, Kunihiro Wasa, 2021, Discret. Appl. Math..

Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints

Takehiro Ito, Kunihiro Wasa, Akira Suzuki, 2022, Algorithmica.

Maximal strongly connected cliques in directed graphs: Algorithms and bounds

Takeaki Uno, Kunihiro Wasa, Alessio Conte, 2020, Discret. Appl. Math..

A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number

Hiroki Arimura, Takeaki Uno, Kunihiro Wasa, 2021, Theor. Comput. Sci..

Optimal reconfiguration of optimal ladder lotteries

Takashi Horiyama, Kunihiro Wasa, Katsuhisa Yamanaka, 2021, Theor. Comput. Sci..

Polynomial-Delay Enumeration of Large Maximal Matchings pdf

Kunihiro Wasa, Kazuhiro Kurita, Yasuaki Kobayashi, 2021, ArXiv.