
PolynomialDelay Enumeration of Large Maximal Matchings
Enumerating matchings is a classical problem in the field of enumeration...
read it

Constant Amortized Time Enumeration of Eulerian trails
In this paper, we consider enumeration problems for edgedistinct and ve...
read it

An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion
A cactus is a connected graph that does not contain K_4  e as a minor. ...
read it

Polynomial Delay Enumeration for Minimal Steiner Problems
Let G = (V, E) be a undirected graph and let W ⊆ V be a set of terminals...
read it

Efficient ConstantFactor Approximate Enumeration of Minimal Subsets for Monotone Properties with Cardinality Constraints
A property Π on a finite set U is monotone if for every X ⊆ U satisfying...
read it

Finding Diverse Trees, Paths, and More
Mathematical modeling is a standard approach to solve many realworld pr...
read it

Efficient Enumerations for Minimal Multicuts and Multiway Cuts
Let G = (V, E) be an undirected graph and let B ⊆ V × V be a set of term...
read it

Constant Amortized Time Enumeration of Independent Sets for Graphs with Bounded Clique Number
In this study, we address the independent set enumeration problem. Altho...
read it

Constant Amortized Time Enumeration of Independent Sets for Graphs with Forbidden Subgraphs on Fixed Number of Vertices
In this paper, we address the independent set enumeration problem. Altho...
read it

An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs
In this paper, we propose a characterization of chordal bipartite graphs...
read it

Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth
The girth of a graph is the length of its shortest cycle. Due to its rel...
read it

Efficient Enumeration of Dominating Sets for Sparse Graphs
Dominating sets are fundamental graph structures. However, enumeration o...
read it
Kazuhiro Kurita
is this you? claim profile