Kunihiro Wasa
TitoloCitata daAnno
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
222014
Enumeration of enumeration algorithms
K Wasa
arXiv preprint arXiv:1605.05102, 2016
202016
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
142012
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
72017
The complexity of induced tree reconfiguration problems
K Wasa, K Yamanaka, H Arimura
Language and Automata Theory and Applications, 330-342, 2016
52016
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
42018
Efficient enumeration of dominating sets for sparse graphs
K Kurita, K Wasa, H Arimura, T Uno
arXiv preprint arXiv:1802.07863, 2018
42018
Efficient enumeration of bipartite subgraphs in graphs
K Wasa, T Uno
International Computing and Combinatorics Conference, 454-466, 2018
32018
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
32017
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
32013
The Perfect Matching Reconfiguration Problem
M Bonamy, N Bousquet, M Heinrich, T Ito, Y Kobayashi, A Mary, ...
arXiv preprint arXiv:1904.06184, 2019
22019
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
22018
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, 2018
22018
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
22017
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
22014
Reconfiguring optimal ladder lotteries
T Horiyama, K Wasa, K Yamanaka
10th Japanese-Hungarian Symposium on Discrete Mathematics and Itsá…, 2017
12017
Efficient enumeration of induced matchings in graphs without short cycles
K Kurita, K Wasa, T Uno, H Arimura
Japan Conference on Discrete and Computational Geometry, Graphs, and Games, 2016
12016
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
12013
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
2019
Diameter of Colorings Under Kempe Changes
M Bonamy, M Heinrich, T Ito, Y Kobayashi, H Mizuta, M MŘhlenthaler, ...
International Computing and Combinatorics Conference, 52-64, 2019
2019
Il sistema al momento non pu˛ eseguire l'operazione. Riprova pi¨ tardi.
Articoli 1–20