C. Fernandes

activity

20032026

most citedA MILP model for an extended version of the Flexible Job Shop Problem

85 citations · 144 across the 27 of their papers we have counts for

collaborators

Showing 2017 · math.COShow all

3 papers · 2 filters

math.CO2017

Approximating the Minimum $k$ -Section Width in Bounded-Degree Trees with Linear Diameter

Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz

Minimum $k$ -Section denotes the NP-hard problem to partition the vertex set of a graph into $k$ sets of sizes as equal as possible while minimizing the cut width, which is the numb…

math.CO2017

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…

math.CO2017

Edge-magic labelings for constellations and armies of caterpillars

Márcia R. Cerioli, Cristina G. Fernandes, Orlando Lee +3

Let $G = (V, E)$ be an $n$ -vertex graph with $m$ edges. A function $f : V \cup E \to {1, \dots, n + m}$ is an edge-magic labeling of $G$ if $f$ is bijective and, for some int…

Approximating the Minimum k-Section Width in Bounded-Degree Trees with Linear Diameter

On Minimum Bisection and Related Cut Problems in Trees and Tree-Like Graphs

Edge-magic labelings for constellations and armies of caterpillars

Approximating the Minimum $k$ -Section Width in Bounded-Degree Trees with Linear Diameter