3 citations · 3 across the 1 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
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 identical jobs on 3 uniform machines with speeds and to minimize the schedule length. We assume that jobs a…
cs.DM2012
Equitable Colorings of Corona Multiproducts of Graphs
Hanna Furmañczyk, Marek Kubale, Vahan V. Mkrtchyan
A graph is equitably -colorable if its vertices can be partitioned into independent sets in such a way that the number of vertices in any two sets differ by at most one. The…