Kunihiro Wasa

Most-cited papers

Enumeration of Enumeration Algorithms
Kunihiro Wasa
2016arXiv.org44 citations
Semantic Scholar
CompRet: a comprehensive recommendation framework for chemical synthesis planning with algorithmic enumeration
Ryosuke Shibukawa, Shoichi Ishida, Kazuki Yoshizoe, Kunihiro Wasa +4 more
2020Journal of Cheminformatics31 citations Open access
Semantic Scholar
The Perfect Matching Reconfiguration Problem
Marthe Bonamy, N. Bousquet, Marc Heinrich, Takehiro Ito +4 more
2019International Symposium on Mathematical Foundations of Computer Science30 citations Open access
Semantic Scholar
Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph
Kunihiro Wasa, Hiroki Arimura, T. Uno
2014International Symposium on Algorithms and Computation22 citations Open access
Semantic Scholar
Diameter of Colorings Under Kempe Changes
Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi +4 more
2019International Computing and Combinatorics Conference21 citations
Semantic Scholar
Exact Algorithms for the Max-Min Dispersion Problem
Toshihiro Akagi, Tetsu Araki, Takashi Horiyama, Shin-Ichi Nakano +6 more
2018Frontiers in Algorithmics20 citations Open access
Semantic Scholar
Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application
Kunihiro Wasa, Yusaku Kaneta, T. Uno, Hiroki Arimura
2012International Computing and Combinatorics Conference12 citations
Semantic Scholar
Reconfiguration of Spanning Trees with Many or Few Leaves
N. Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta +3 more
2020Embedded Systems and Applications11 citations
Semantic Scholar
Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph
Alessio Conte, M. Kanté, Y. Otachi, T. Uno +1 more
2017International Computing and Combinatorics Conference11 citations
Semantic Scholar
Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints
N. Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta +3 more
2022Algorithmica10 citations Open access
Semantic Scholar
Linear-Delay Enumeration for Minimal Steiner Problems
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
2020ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems10 citations Open access
Semantic Scholar
Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs
Alessio Conte, R. Grossi, M. Kanté, Andrea Marino +2 more
2019International Symposium on Mathematical Foundations of Computer Science9 citations Open access
Semantic Scholar
On the hardness of inclusion-wise minimal separators enumeration
Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, V. Limouzy +2 more
2023Information Processing Letters8 citations Open access
Semantic Scholar
Reconfiguring (non-spanning) arborescences
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata +2 more
2021Theoretical Computer Science8 citations Open access
Semantic Scholar
Max-Min 3-Dispersion Problems
Takashi Horiyama, Shin-Ichi Nakano, Toshiki Saitoh, K. Suetsugu +4 more
2019International Computing and Combinatorics Conference8 citations
Semantic Scholar
Efficient Enumeration of Bipartite Subgraphs in Graphs
Kunihiro Wasa, T. Uno
2018International Computing and Combinatorics Conference8 citations Open access
Semantic Scholar
Efficient Enumeration of Dominating Sets for Sparse Graphs
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, T. Uno
2018International Symposium on Algorithms and Computation8 citations Open access
Semantic Scholar
Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four
Kazuhiro Kurita, Kunihiro Wasa, T. Uno, Hiroki Arimura
2017IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences8 citations Open access
Semantic Scholar
Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
2022International Workshop on Graph-Theoretic Concepts in Computer Science7 citations
Semantic Scholar
Independent set reconfiguration on directed graphs
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata +3 more
2022International Symposium on Mathematical Foundations of Computer Science7 citations Open access
Semantic Scholar
Polynomial-delay enumeration of large maximal common independent sets in two matroids and beyond
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
2025Information and Computation6 citations Open access
Semantic Scholar
Hardness of Braided Quantum Circuit Optimization in the Surface Code
Kunihiro Wasa, S. Nishio, K. Suetsugu, M. Hanks +3 more
2023IEEE Transactions on Quantum Engineering6 citations Open access
Semantic Scholar
Shortest Reconfiguration of Colorings Under Kempe Changes
Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi +4 more
2020Symposium on Theoretical Aspects of Computer Science6 citations Open access
Semantic Scholar
Constant Amortized Time Enumeration of Eulerian trails
Kazuhiro Kurita, Kunihiro Wasa
2021Theoretical Computer Science5 citations Open access
Semantic Scholar
Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph
Alessio Conte, M. Kanté, Y. Otachi, T. Uno +1 more
2020Theoretical Computer Science5 citations Open access
Semantic Scholar
A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number
Kazuhiro Kurita, Kunihiro Wasa, T. Uno, Hiroki Arimura
2019Theoretical Computer Science5 citations Open access
Semantic Scholar
On Maximal Cliques with Connectivity Constraints in Directed Graphs
Alessio Conte, M. Kanté, T. Uno, Kunihiro Wasa
2017International Symposium on Algorithms and Computation5 citations Open access
Semantic Scholar
The Complexity of Induced Tree Reconfiguration Problems
Kunihiro Wasa, Katsuhisa Yamanaka, Hiroki Arimura
2016Language and Automata Theory and Applications5 citations Open access
Semantic Scholar
Constant Time Enumeration of Subtrees with Exactly k Nodes in a Tree
Kunihiro Wasa, Yusaku Kaneta, T. Uno, Hiroki Arimura
2014IEICE Trans. Inf. Syst.5 citations Open access
Semantic Scholar
Polynomial-Delay Enumeration of Large Maximal Matchings
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
2021arXiv.org3 citations
Semantic Scholar
Reconfiguring Directed Trees in a Digraph
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata +2 more
2021International Computing and Combinatorics Conference3 citations
Semantic Scholar
Reconfiguration of Regular Induced Subgraphs
Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Y. Otachi +1 more
2021arXiv.org3 citations
Semantic Scholar
Finding the Anticover of a String
Mai Alzamel, Alessio Conte, Shuhei Denzumi, R. Grossi +3 more
2020Annual Symposium on Combinatorial Pattern Matching3 citations Open access
Semantic Scholar
Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Cardinality Constraints
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
2020arXiv.org3 citations
Semantic Scholar
Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
2020Discrete Applied Mathematics3 citations Open access
Semantic Scholar
Ladder-Lottery Realization
Katsuhisa Yamanaka, Takashi Horiyama, T. Uno, Kunihiro Wasa
2018Canadian Conference on Computational Geometry3 citations
Semantic Scholar
Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs
Alessio Conte, Kazuhiro Kurita, Kunihiro Wasa, T. Uno
2017International Conference on Combinatorial Optimization and Applications3 citations
Semantic Scholar
Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
2023International Symposium on Mathematical Foundations of Computer Science2 citations Open access
Semantic Scholar
Optimal reconfiguration of optimal ladder lotteries
Katsuhisa Yamanaka, Takashi Horiyama, Kunihiro Wasa
2021Theoretical Computer Science2 citations Open access
Semantic Scholar
Polynomial Delay Enumeration for Minimal Steiner Problems
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
2020arXiv.org2 citations
Semantic Scholar
Maximal strongly connected cliques in directed graphs: Algorithms and bounds
Alessio Conte, M. Kanté, T. Uno, Kunihiro Wasa
2020Discrete Applied Mathematics2 citations Open access
Semantic Scholar
An Efficient Algorithm for Enumerating Induced Subgraphs with Bounded Degeneracy
Kunihiro Wasa, T. Uno
2018International Conference on Combinatorial Optimization and Applications2 citations
Semantic Scholar
Polynomial Delay and Space Discovery of Connected and Acyclic Sub-hypergraphs in a Hypergraph
Kunihiro Wasa, T. Uno, Kouichi Hirata, Hiroki Arimura
2013IFIP Working Conference on Database Semantics2 citations
Semantic Scholar
Disjunctive Minimal Separators Enumeration
Benjamin Bergougnoux, M. Kanté, Kunihiro Wasa
2 citations
Semantic Scholar
An ETH-based quasipolynomial lower bound for Dualization
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
20261 citations
Semantic Scholar
Reconfiguration and enumeration of optimal cyclic ladder lotteries
Yuta Nozaki, Kunihiro Wasa, Katsuhisa Yamanaka
2025Theoretical Computer Science1 citations Open access
Semantic Scholar
Designing Output Sensitive Algorithms for Subgraph Enumeration
Alessio Conte, Kazuhiro Kurita, Andrea Marino, G. Punzi +2 more
2025From Strings to Graphs, and Back Again1 citations
Semantic Scholar
An Approximation Algorithm for K-best Enumeration of Minimal Connected Edge Dominating Sets with Cardinality Constraints
Kazuhiro Kurita, Kunihiro Wasa
2022Theoretical Computer Science1 citations Open access
Semantic Scholar
Reconfiguration of Regular Induced Subgraphs
Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Y. Otachi +1 more
2022Workshop on Algorithms and Computation1 citations Open access
Semantic Scholar
Constant Amortized Time Enumeration of Independent Sets for Graphs with Forbidden Subgraphs on Fixed Number of Vertices
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, T. Uno
2019arXiv.org1 citations
Semantic Scholar