27 citations · 68 across the 17 of their papers we have counts for
18 papers
Computing Optimal Leaf Roots of Chordal Cographs in Linear Time
Van Bang Le, Christian Rosenke
A graph G is a k-leaf power, for an integer k >= 2, if there is a tree T with leaf set V(G) such that, for all vertices x, y in V(G), the edge xy exists in G if and only if the dis…
Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles
Hoang-Oanh Le, Van Bang Le
In a graph, a (perfect) matching cut is an edge cut that is a (perfect) matching. Matching Cut (MC), respectively, Perfect Matching Cut (PMC), is the problem of deciding whether a…
On the -Claw Vertex Deletion Problem
Sun-Yuan Hsieh, Hoang-Oanh Le, Van Bang Le +1
Let -claw (or -star) stand for , the complete bipartite graph with 1 and vertices on each part. The -claw vertex deletion problem, -CLAW-VD, asks for…
-factors for Velocity-dependent Dark Matter
Bradly Boucher, Jason Kumar, Van B. Le +1
If dark matter annihilates with a velocity-dependent cross section within a subhalo, then the magnitude and angular distribution of the resulting photon signal will change. These e…
The Perfect Matching Cut Problem Revisited
Van Bang Le, Jan Arne Telle
In a graph, a perfect matching cut is an edge cut that is a perfect matching. Perfect Matching Cut (PMC) is the problem of deciding whether a given graph has a perfect matching cut…
Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration
Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch +1
An enumeration kernel as defined by Creignou et al. [Theory Comput. Syst. 2017] for a parameterized enumeration problem consists of an algorithm that transforms each instance into…