85 citations · 144 across the 27 of their papers we have counts for
11 papers · 1 filter
Independent dominating sets in planar triangulations
Fábio Botler, Cristina G. Fernandes, Juan Gutiérrez
In 1996, Matheson and Tarjan proved that every near planar triangulation on vertices contains a dominating set of size at most , and conjectured that this upper bound can…
On the period collapse of a family of Ehrhart quasi-polynomials
Cristina G. Fernandes, José C. de Pina, Jorge L. Ramírez Alfonsín +1
A graph whose nodes have degree 1 or 3 is called a -graph. Liu and Osserman associated a polytope to each -graph and studied the Ehrhart quasi-polynomials of thes…
On Tuza's conjecture for triangulations and graphs with small treewidth
Fábio Botler, Cristina G. Fernandes, Juan Gutiérrez
Tuza (1981) conjectured that the size of a minimum set of edges that intersects every triangle of a graph is at most twice the size of a maximum set of edge-disjo…
Cubic graphs, their Ehrhart quasi-polynomials, and a scissors congruence phenomenon
Cristina G. Fernandes, José C. de Pina, Jorge Luis Ramírez Alfonsín +1
The scissors congruence conjecture for the unimodular group is an analogue of Hilbert's third problem, for the equidecomposability of polytopes. Liu and Osserman studied the Ehrhar…
Approximating the Minimum -Section Width in Bounded-Degree Trees with Linear Diameter
Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz
Minimum -Section denotes the NP-hard problem to partition the vertex set of a graph into sets of sizes as equal as possible while minimizing the cut width, which is the numb…
On Minimum Bisection and Related Cut Problems in Trees and Tree-Like Graphs
Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz
Minimum Bisection denotes the NP-hard problem to partition the vertex set of a graph into two sets of equal sizes while minimizing the width of the bisection, which is defined as t…