Kunihiro Wasa
Title
Cited by
Cited by
Year
Efficient enumeration of induced subtrees in a K-degenerate graph
K Wasa, H Arimura, T Uno
International Symposium on Algorithms and Computation, 94-102, 2014
272014
Enumeration of enumeration algorithms
K Wasa
arXiv preprint arXiv:1605.05102, 2016
242016
Constant time enumeration of bounded-size subtrees in trees and its application
K Wasa, Y Kaneta, T Uno, H Arimura
International Computing and Combinatorics Conference, 347-359, 2012
182012
Efficient enumeration of maximal k-degenerate subgraphs in a chordal graph
A Conte, MM Kanté, Y Otachi, T Uno, K Wasa
International Computing and Combinatorics Conference, 150-161, 2017
92017
Exact algorithms for the max-min dispersion problem
T Akagi, T Araki, T Horiyama, S Nakano, Y Okamoto, Y Otachi, T Saitoh, ...
International Workshop on Frontiers in Algorithmics, 263-272, 2018
72018
Efficient enumeration of bipartite subgraphs in graphs
K Wasa, T Uno
International Computing and Combinatorics Conference, 454-466, 2018
52018
Efficient enumeration of dominating sets for sparse graphs
K Kurita, K Wasa, H Arimura, T Uno
arXiv preprint arXiv:1802.07863, 2018
52018
The complexity of induced tree reconfiguration problems
K Wasa, K Yamanaka, H Arimura
Language and Automata Theory and Applications, 330-342, 2016
52016
The perfect matching reconfiguration problem
M Bonamy, N Bousquet, M Heinrich, T Ito, Y Kobayashi, A Mary, ...
arXiv preprint arXiv:1904.06184, 2019
42019
Efficient enumeration of induced matchings in a graph without cycles with length four
K Kurita, K Wasa, T Uno, H Arimura
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and …, 2018
42018
Listing acyclic subgraphs and subgraphs of bounded girth in directed graphs
A Conte, K Kurita, K Wasa, T Uno
International Conference on Combinatorial Optimization and Applications, 169-181, 2017
42017
On maximal cliques with connectivity constraints in directed graphs
A Conte, MM Kanté, T Uno, K Wasa
28th International Symposium on Algorithms and Computation (ISAAC 2017), 2017
42017
Polynomial delay and space discovery of connected and acyclic sub-hypergraphs in a hypergraph
K Wasa, T Uno, K Hirata, H Arimura
International Conference on Discovery Science, 308-323, 2013
42013
Constant Time Enumeration of Subtrees with Exactly k Nodes in a Tree
K Wasa, Y Kaneta, T Uno, H Arimura
IEICE TRANSACTIONS on Information and Systems 97 (3), 421-430, 2014
32014
Faster Algorithms for Tree Similarity Based on Compressed Enumeration of Bounded-Sized Ordered Subtrees
K Wasa, K Hirata, T Uno, H Arimura
International Conference on Similarity Search and Applications, 73-84, 2013
22013
Diameter of colorings under Kempe changes
M Bonamy, M Heinrich, T Ito, Y Kobayashi, H Mizuta, M Mühlenthaler, ...
Theoretical Computer Science, 2020
12020
Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph
A Conte, MM Kanté, Y Otachi, T Uno, K Wasa
Theoretical Computer Science 818, 2-11, 2020
12020
Finding the Anticover of a String
M Alzamel, A Conte, S Denzumi, R Grossi, CS Iliopoulos, K Kurita, ...
31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020), 2020
12020
Max-Min 3-Dispersion Problems
T Horiyama, S Nakano, T Saitoh, K Suetsugu, A Suzuki, R Uehara, T Uno, ...
International Computing and Combinatorics Conference, 291-300, 2019
12019
Max-Min 3-Dispersion Problems
A Suzuki, R Uehara, T Uno, K Wasa
Computing and Combinatorics: 25th International Conference, COCOON 2019, Xi …, 2019
12019
The system can't perform the operation now. Try again later.
Articles 1–20