
Reconfiguring Directed Trees in a Digraph
In this paper, we investigate the computational complexity of subgraph r...
read it

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

Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity
For intractable problems on graphs of bounded treewidth, two graph param...
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

A Note on ExponentialTime Algorithms for Linearwidth
In this note, we give an algorithm that computes the linearwidth of inpu...
read it

Finding a Maximum Minimal Separator: Graph Classes and FixedParameter Tractability
We study the problem of finding a maximum cardinality minimal separator ...
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

Parameterized Complexity of (A,ℓ)Path Packing
Given a graph G = (V,E), A ⊆ V, and integers k and ℓ, the (A,ℓ)Path Pac...
read it

Parameterized Complexity of Graph Burning
Graph Burning asks, given a graph G = (V,E) and an integer k, whether th...
read it

Computing the Largest Bond and the Maximum Connected Cut of a Graph
The cutset ∂(S) of a graph G=(V,E) is the set of edges that have one en...
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

On Structural Parameterizations of Node Kayles
Node Kayles is a wellknown twoplayer impartial game on graphs: Given a...
read it

Metric Learning for Ordered Labeled Trees with pqgrams
Computing the similarity between two data points plays a vital role in m...
read it

An optimal algorithm for Bisection for boundedtreewidth graphs
The maximum/minimum bisection problems are, given an edgeweighted graph...
read it

Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem
The Balanced Connected Subgraph problem (BCS) was recently introduced by...
read it

Parameterized Algorithms for Maximum Cut with Connectivity Constraints
We study two variants of Maximum Cut, which we call Connected Maximum Cu...
read it

Automatic Source Code Summarization with Extended TreeLSTM
Neural machine translation models are used to automatically generate a d...
read it

Subgraph Isomorphism on Graph Classes that Exclude a Substructure
We study Subgraph Isomorphism on graph classes defined by a fixed forbid...
read it

An FPT Algorithm for MaxCut Parameterized by Crossing Number
The MaxCut problem is known to be NPhard on general graphs, while it c...
read it
Yasuaki Kobayashi
is this you? claim profile