21 citations · 62 across the 20 of their papers we have counts for
24 papers
Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries
Yuta Nozaki, Kunihiro Wasa, Katsuhisa Yamanaka
A ladder lottery, known as ``Amidakuji'' in Japan, is a common way to decide an assignment at random. In this paper, we investigate reconfiguration and enumeration problems of cycl…
Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size
Alessio Conte, Roberto Grossi, Yasuaki Kobayashi +4
Graphlets of order in a graph are connected subgraphs induced by nodes (called -graphlets) or by edges (called edge -graphlets). They are among the interestin…
On the hardness of inclusion-wise minimal separators enumeration
Caroline Brosse, Oscar Defrain, Kazuhiro Kurita +3
Enumeration problems are often encountered as key subroutines in the exact computation of graph parameters such as chromatic number, treewidth, or treedepth. In the case of treedep…
Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids and Beyond
Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa
Finding a maximum cardinality common independent set in two matroids (also known as \textsc{Matroid Intersection}) is a classical combinatorial optimization problem, which generali…
Hardness of braided quantum circuit optimization in the surface code
Kunihiro Wasa, Shin Nishio, Koki Suetsugu +4
Large-scale quantum information processing requires the use of quantum error correcting codes to mitigate the effects of noise in quantum devices. Topological error-correcting code…
Independent set reconfiguration on directed graphs
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi +4
\textsc{Directed Token Sliding} asks, given a directed graph and two sets of pairwise nonadjacent vertices, whether one can reach from one set to the other by repeatedly applying a…