-
2
-
-
0037856870
-
Scheduling interviews for a job fair
-
J.J. Bartholdi, K.L. McCroan, Scheduling interviews for a job fair, Oper. Res. 38 (1990) 951-960.
-
(1990)
Oper. Res.
, vol.38
, pp. 951-960
-
-
Bartholdi, J.J.1
McCroan, K.L.2
-
3
-
-
0038873932
-
The complexity of consecutive delta sign-coloring of bipartite graphs: 4 is easy, 5 is hard
-
K. Giaro, The complexity of consecutive delta sign-coloring of bipartite graphs: 4 is easy, 5 is hard, Ars Combin., 47 (1997) 287-300.
-
(1997)
Ars Combin.
, vol.47
, pp. 287-300
-
-
Giaro, K.1
-
5
-
-
4944254259
-
No-wait open shop scheduling of zero-one time operations without inserted idle times
-
K. Giaro, M. Kubale, M. Małafiejski, No-wait open shop scheduling of zero-one time operations without inserted idle times (in Polish), Zesz. Nauk. Pol. Śl., Ser. Automat. 117 (1996) 29-36.
-
(1996)
Zesz. Nauk. Pol. Śl., Ser. Automat.
, vol.117
, pp. 29-36
-
-
Giaro, K.1
Kubale, M.2
Małafiejski, M.3
-
6
-
-
0039862754
-
A lower bound for interval colouring of bi-regular bipartite graphs
-
D. Hanson, C.O.M. Loten, A lower bound for interval colouring of bi-regular bipartite graphs. Bull. Inst. Comb. Appl. 18 (1996) 69-74.
-
(1996)
Bull. Inst. Comb. Appl.
, vol.18
, pp. 69-74
-
-
Hanson, D.1
Loten, C.O.M.2
-
7
-
-
0041545067
-
On interval colorings of bi-regular bipartite graphs
-
to appear
-
D. Hanson, C.O.M, Loten, B. Toft, On interval colorings of bi-regular bipartite graphs, Ars Combin., to appear.
-
Ars Combin.
-
-
Hanson, D.1
Loten, C.O.M.2
Toft, B.3
-
8
-
-
0043048101
-
-
Email information
-
A. Hertz, Email information, 1995.
-
(1995)
-
-
Hertz, A.1
-
9
-
-
0003698173
-
-
Wiley, New York
-
T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley, New York, 1995, pp. 203-205.
-
(1995)
Graph Coloring Problems
, pp. 203-205
-
-
Jensen, T.R.1
Toft, B.2
-
10
-
-
0043048100
-
-
Preprint, Comp. Cent, of Acad. Sci. of Armenian SSR, Erevan
-
R.R. Kamalian, Interval coloring of complete bipartite graphs and trees (in Russian), Preprint, Comp. Cent, of Acad. Sci. of Armenian SSR, Erevan, 1989.
-
(1989)
Interval Coloring of Complete Bipartite Graphs and Trees (In Russian)
-
-
Kamalian, R.R.1
-
11
-
-
0013520618
-
On interval colorability of a bipartite graph
-
S.V. Sevastjanov, On interval colorability of a bipartite graph (in Russian), Met. Diskret Analiz. 50 (1990) 61-72.
-
(1990)
Met. Diskret Analiz.
, vol.50
, pp. 61-72
-
-
Sevastjanov, S.V.1
-
12
-
-
0002935868
-
On an estimate of the chromatic class of a p-graph
-
V.G. Vizing, On an estimate of the chromatic class of a p-graph (in Russian), Met. Diskret. Analiz. 3 (1964) 25-30.
-
(1964)
Met. Diskret. Analiz.
, vol.3
, pp. 25-30
-
-
Vizing, V.G.1
-
13
-
-
0042856118
-
Almost nonpreemptive schedules
-
D. de Werra, Almost nonpreemptive schedules, Ann. Oper. Res. 26 (1990) 243-256.
-
(1990)
Ann. Oper. Res.
, vol.26
, pp. 243-256
-
-
De Werra, D.1
|