Hanna Furmaǹczyk

activity

20122026

most citedScheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines

8 citations · 18 across the 9 of their papers we have counts for

collaborators

Showing 2015Show all

2 papers · 1 filter

cs.DM2015

Equitable total coloring of corona of cubic graphs

Hanna Furmańczyk, Rita Zuazua

The minimum number of total independent partition sets of $V \cup E$ of a graph $G = (V, E)$ is called the \emph{total chromatic number} of $G$ , denoted by $χ^{''} (G)$ . If the difference…

cs.DM2015★ 3 cited

Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines

H. Furmańczyk, M. Kubale

In the paper we consider the problem of scheduling $n$ identical jobs on 3 uniform machines with speeds $s_{1}, s_{2},$ and $s_{3}$ to minimize the schedule length. We assume that jobs a…