M. Kubale

activity

20122020

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

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

collaborators

Showing 2016Show all

2 papers · 1 filter

math.CO2016★ 5 cited

Tight Bounds on the Complexity of Semi-Equitable Coloring of Cubic and Subcubic Graphs

H. Furmańczyk, M. Kubale

A $k$ -coloring of a graph $G = (V, E)$ is called semi-equitable if there exists a partition of its vertex set into independent subsets $V_{1}, \dots, V_{k}$ in such a way that $|V_1| \noti…

cs.DS2016★ 8 cited

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

H. Furmanczyk, M. Kubale

In the paper we consider the problem of scheduling $n$ identical jobs on 4 uniform machines with speeds $s_{1} \geq s_{2} \geq s_{3} \geq s_{4},$ respectively. Our aim is to find a schedul…