
On the period collapse of a family of Ehrhart quasipolynomials
A graph whose nodes have degree 1 or 3 is called a {1,3}graph. Liu and ...
read it

Leafy Spanning Arborescences in DAGs
Broadcasting in a computer network is a method of transferring a message...
read it

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...
read it

Cubic graphs, their Ehrhart quasipolynomials, and a scissors congruence phenomenon
The scissors congruence conjecture for the unimodular group is an analog...
read it

Transversals of Longest Paths
Let (G) be the minimum cardinality of a set of vertices that intersects ...
read it

Approximating the Minimum kSection Width in BoundedDegree Trees with Linear Diameter
Minimum kSection denotes the NPhard problem to partition the vertex se...
read it

On Minimum Bisection and Related Cut Problems in Trees and TreeLike Graphs
Minimum Bisection denotes the NPhard problem to partition the vertex se...
read it

Prices of anarchy of selfish 2D bin packing games
We consider a gametheoretical problem called selfish 2dimensional bin ...
read it
Cristina G. Fernandes
is this you? claim profile