Follow
Kunihiro Wasa
Title
Cited by
Cited by
Year
Enumeration of enumeration algorithms
K Wasa
arXiv preprint arXiv:1605.05102, 2016
312016
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
282014
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
182018
CompRet: a comprehensive recommendation framework for chemical synthesis planning with algorithmic enumeration
R Shibukawa, S Ishida, K Yoshizoe, K Wasa, K Takasu, Y Okuno, ...
Journal of cheminformatics 12 (1), 1-14, 2020
172020
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
172012
The perfect matching reconfiguration problem
M Bonamy, N Bousquet, M Heinrich, T Ito, Y Kobayashi, A Mary, ...
arXiv preprint arXiv:1904.06184, 2019
152019
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
112017
Diameter of colorings under Kempe changes
M Bonamy, M Heinrich, T Ito, Y Kobayashi, H Mizuta, M MŘhlenthaler, ...
Theoretical Computer Science 838, 45-57, 2020
92020
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
82018
Efficient enumeration of dominating sets for sparse graphs
K Kurita, K Wasa, H Arimura, T Uno
Discrete Applied Mathematics 303, 283-295, 2021
72021
Efficient enumeration of bipartite subgraphs in graphs
K Wasa, T Uno
International Computing and Combinatorics Conference, 454-466, 2018
62018
Max-min 3-dispersion problems
T Horiyama, S Nakano, T Saitoh, K Suetsugu, A Suzuki, R Uehara, T Uno, ...
IEICE Transactions on Fundamentals of Electronics, Communications andá…, 2021
52021
The complexity of induced tree reconfiguration problems
K Wasa, K Yamanaka, H Arimura
Language and Automata Theory and Applications, 330-342, 2016
52016
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
52013
Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with cardinality constraints
Y Kobayashi, K Kurita, K Wasa
CoRR, abs/2009.08830, 2020
42020
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
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
42014
Reconfiguration of spanning trees with many or few leaves
N Bousquet, T Ito, Y Kobayashi, H Mizuta, P Ouvrard, A Suzuki, K Wasa
arXiv preprint arXiv:2006.14309, 2020
32020
Polynomial-delay enumeration of large maximal matchings
Y Kobayashi, K Kurita, K Wasa
arXiv preprint arXiv:2105.04146, 2021
22021
The system can't perform the operation now. Try again later.
Articles 1–20