Kunihiro Wasa

activity

20142024

most citedEnumeration of Enumeration Algorithms

21 citations · 62 across the 20 of their papers we have counts for

collaborators

Showing 2020Show all

3 papers · 1 filter

cs.DS2020

Linear-Delay Enumeration for Minimal Steiner Problems

Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa

Kimelfeld and Sagiv [Kimelfeld and Sagiv, PODS 2006], [Kimelfeld and Sagiv, Inf. Syst. 2008] pointed out the problem of enumerating $K$ -fragments is of great importance in a keywor…

cs.DS2020

Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Weight Constraints

Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa

A property $Π$ on a finite set $U$ is \emph{monotone} if for every $X \subseteq U$ satisfying $Π$ , every superset $Y \subseteq U$ of $X$ also satisfies $Π$ . Many combinatorial prop…

cs.DS2020

Reconfiguration of Spanning Trees with Many or Few Leaves

Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi +4

Let $G$ be a graph and $T_{1}, T_{2}$ be two spanning trees of $G$ . We say that $T_{1}$ can be transformed into $T_{2}$ via an edge flip if there exist two edges $e \in T_{1}$ and $f$ in $T_2…