Kunihiro Wasa

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