Kunihiro Wasa

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 64

Top Topics

Independent Set

Top Venues

Theor. Comput. Sci.

Publications

Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa
On the hardness of inclusion-wise minimal separators enumeration. Inf. Process. Lett. 185 (2024)
Kazuhiro Kurita, Kunihiro Wasa
An approximation algorithm for K-best enumeration of minimal connected edge dominating sets with cardinality constraints. Theor. Comput. Sci. 1005 (2024)
Alessio Conte, Roberto Grossi, Yasuaki Kobayashi, Kazuhiro Kurita, Davide Rucci, Takeaki Uno, Kunihiro Wasa
Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size. CoRR (2024)
Yuta Nozaki, Kunihiro Wasa, Katsuhisa Yamanaka
Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries. CoRR (2024)
Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa
On the hardness of inclusion-wise minimal separators enumeration. CoRR (2023)
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints. Algorithmica 85 (9) (2023)
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids. MFCS (2023)
Kunihiro Wasa, Shin Nishio, Koki Suetsugu, Michael Hanks, Ashley Stephens, Yu Yokoi, Kae Nemoto
Hardness of braided quantum circuit optimization in the surface code. CoRR (2023)
Yuta Nozaki, Kunihiro Wasa, Katsuhisa Yamanaka
Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries. IWOCA (2023)
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids. CoRR (2023)
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
Reconfiguring (non-spanning) arborescences. Theor. Comput. Sci. 943 (2023)
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
Independent set reconfiguration on directed graphs. CoRR (2022)
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint. CoRR (2022)
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
Independent Set Reconfiguration on Directed Graphs. MFCS (2022)
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
Linear-Delay Enumeration for Minimal Steiner Problems. PODS (2022)
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings. WG (2022)
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint. STACS (2022)
Kazuhiro Kurita, Kunihiro Wasa
Constant amortized time enumeration of Eulerian trails. Theor. Comput. Sci. 923 (2022)
Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
Reconfiguration of Regular Induced Subgraphs. WALCOM (2022)
Kazuhiro Kurita, Kunihiro Wasa
An Approximation Algorithm for K-best Enumeration of Minimal Connected Edge Dominating Sets with Cardinality Constraints. CoRR (2022)
Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
Reconfiguration of Regular Induced Subgraphs. CoRR (2021)
Kazuhiro Kurita, Kunihiro Wasa
Constant Amortized Time Enumeration of Eulerian trails. CoRR (2021)
Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
Max-Min 3-Dispersion Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2021)
Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number. Theor. Comput. Sci. 874 (2021)
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
Polynomial-Delay Enumeration of Large Maximal Matchings. CoRR (2021)
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
Reconfiguring Directed Trees in a Digraph. CoRR (2021)
Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa
Maximal strongly connected cliques in directed graphs: Algorithms and bounds. Discret. Appl. Math. 303 (2021)
Katsuhisa Yamanaka, Takashi Horiyama, Kunihiro Wasa
Optimal reconfiguration of optimal ladder lotteries. Theor. Comput. Sci. 859 (2021)
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
Efficient enumeration of dominating sets for sparse graphs. Discret. Appl. Math. 303 (2021)
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
Reconfiguring Directed Trees in a Digraph. COCOON (2021)
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
Reconfiguration of Spanning Trees with Many or Few Leaves. ESA (2020)
Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa
-degenerate induced subgraphs of a chordal graph. Theor. Comput. Sci. 818 (2020)
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
Reconfiguration of Spanning Trees with Many or Few Leaves. CoRR (2020)
Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa
Diameter of colorings under Kempe changes. Theor. Comput. Sci. 838 (2020)
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Cardinality Constraints. CoRR (2020)
Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa
Shortest Reconfiguration of Colorings Under Kempe Changes. STACS (2020)
Ryosuke Shibukawa, Shoichi Ishida, Kazuki Yoshizoe, Kunihiro Wasa, Kiyosei Takasu, Yasushi Okuno, Kei Terayama, Koji Tsuda
CompRet: a comprehensive recommendation framework for chemical synthesis planning with algorithmic enumeration. J. Cheminformatics 12 (1) (2020)
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
Polynomial Delay Enumeration for Minimal Steiner Problems. CoRR (2020)
Mai Alzamel, Alessio Conte, Shuhei Denzumi, Roberto Grossi, Costas S. Iliopoulos, Kazuhiro Kurita, Kunihiro Wasa
Finding the Anticover of a String. CPM (2020)
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs. CoRR (2019)
Alessio Conte, Roberto Grossi, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno, Kunihiro Wasa
Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs. MFCS (2019)
Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
Max-Min 3-Dispersion Problems. COCOON (2019)
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
Constant Amortized Time Enumeration of Independent Sets for Graphs with Forbidden Subgraphs on Fixed Number of Vertices. CoRR (2019)
Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa
Diameter of Colorings Under Kempe Changes. COCOON (2019)
Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa
The Perfect Matching Reconfiguration Problem. MFCS (2019)
Kunihiro Wasa, Katsuhisa Yamanaka, Hiroki Arimura
The Complexity of Induced Tree Reconfiguration Problems. IEICE Trans. Inf. Syst. (3) (2019)
Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa
The Perfect Matching Reconfiguration Problem. CoRR (2019)
Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs. IWOCA (2019)
Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Hiroki Arimura, Takeaki Uno
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. CoRR (2018)
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
Efficient Enumeration of Dominating Sets for Sparse Graphs. ISAAC (2018)
Kunihiro Wasa, Takeaki Uno
Efficient Enumeration of Bipartite Subgraphs in Graphs. CoRR (2018)
Kunihiro Wasa, Takeaki Uno
An Efficient Algorithm for Enumerating Induced Subgraphs with Bounded Degeneracy. COCOA (2018)
Kunihiro Wasa, Takeaki Uno
Efficient Enumeration of Bipartite Subgraphs in Graphs. COCOON (2018)
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
Efficient Enumeration of Dominating Sets for Sparse Graphs. CoRR (2018)
Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
Exact Algorithms for the Max-Min Dispersion Problem. FAW (2018)
Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno, Hiroki Arimura
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. IWOCA (2018)
Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2018)
Katsuhisa Yamanaka, Takashi Horiyama, Takeaki Uno, Kunihiro Wasa
Ladder-Lottery Realization. CCCG (2018)
Alessio Conte, Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno
Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs. COCOA (2) (2017)
Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura
Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four. CoRR (2017)
Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa
Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph. COCOON (2017)
Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa
On Maximal Cliques with Connectivity Constraints in Directed Graphs. ISAAC (2017)
Kunihiro Wasa
Enumeration of Enumeration Algorithms. CoRR (2016)
Kunihiro Wasa, Katsuhisa Yamanaka, Hiroki Arimura
The Complexity of Induced Tree Reconfiguration Problems. LATA (2016)
Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph. ISAAC (2014)
Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph. CoRR (2014)
Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, Hiroki Arimura
Nodes in a Tree. IEICE Trans. Inf. Syst. (3) (2014)
Kunihiro Wasa, Kouichi Hirata, Takeaki Uno, Hiroki Arimura
Faster Algorithms for Tree Similarity Based on Compressed Enumeration of Bounded-Sized Ordered Subtrees. SISAP (2013)
Kunihiro Wasa, Takeaki Uno, Kouichi Hirata, Hiroki Arimura
Polynomial Delay and Space Discovery of Connected and Acyclic Sub-hypergraphs in a Hypergraph. Discovery Science (2013)
Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, Hiroki Arimura
Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application. COCOON (2012)