3 citations · 3 across the 2 of their papers we have counts for
4 papers
Scheduling on uniform and unrelated machines with bipartite incompatibility graphs
Tytus Pikies, Hanna Furmańczyk
In this paper the problem of scheduling of jobs on parallel machines under incompatibility relation is considered. In this model a binary relation between jobs is given and no two…
Equitable -degenerate choosability of graphs
E. Drgas-Burchardt, H. Furmańczyk, E. Sidorowicz
Let be the class of -degenerate graphs and let be a list assignment for a graph . A colouring of such that every vertex receives a colour from its li…
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…
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…