research
∙
08/14/2023
Approximations for the Steiner Multicycle Problem
The Steiner Multicycle problem consists of, given a complete graph, a we...
share
research
∙
08/05/2023
Independent dominating sets in planar triangulations
In 1996, Matheson and Tarjan proved that every near planar triangulation...
research
∙
11/26/2021
How heavy independent sets help to find arborescences with many leaves in DAGs
Trees with many leaves have applications on broadcasting, which is a met...
research
∙
04/22/2021
On the period collapse of a family of Ehrhart quasi-polynomials
A graph whose nodes have degree 1 or 3 is called a {1,3}-graph. Liu and ...
research
∙
07/15/2020
Leafy Spanning Arborescences in DAGs
Broadcasting in a computer network is a method of transferring a message...
research
∙
02/18/2020
On Tuza's conjecture for triangulations and graphs with small treewidth
Tuza (1981) conjectured that the size Ï„(G) of a minimum set of edges tha...
research
∙
02/20/2018
Cubic graphs, their Ehrhart quasi-polynomials, and a scissors congruence phenomenon
The scissors congruence conjecture for the unimodular group is an analog...
research
∙
12/19/2017
Transversals of Longest Paths
Let (G) be the minimum cardinality of a set of vertices that intersects ...
research
∙
08/21/2017
Approximating the Minimum k-Section Width in Bounded-Degree Trees with Linear Diameter
Minimum k-Section denotes the NP-hard problem to partition the vertex se...
research
∙
08/21/2017
On Minimum Bisection and Related Cut Problems in Trees and Tree-Like Graphs
Minimum Bisection denotes the NP-hard problem to partition the vertex se...
research
∙
07/25/2017
