SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Discrete Applied Mathematics

Volumn 76, Issue 1-3, 1997, Pages 93-101

Preassignment requirements in chromatic scheduling

(2) De Werra, D a Mahadev, N V R b

a EPFL (Switzerland)

b NORTHEASTERN UNIVERSITY (United States)

Author keywords

Graph coloring; Preassignment; Restricted coloring; Scheduling; Timetabling

Indexed keywords

EID: 0039995398 PISSN: 0166218X EISSN: None Source Type: Journal
DOI: 10.1016/S0166-218X(97)82776-X Document Type: Article

Times cited : (4)

References (15)

1
- 0004249508
- North-Holland, Amsterdam
- C. Berge, Graphs and Hypergraphs (North-Holland, Amsterdam, 1973).
- (1973) Graphs and Hypergraphs
- Berge, C.¹

2
- 0000038784
- Precoloring extension I. Interval graphs
- M. Birò, M. Hujter and Z. Tuza, Precoloring extension I. Interval graphs, Discrete math. 100 (1991) 267-279.
- (1991) Discrete Math. , vol.100 , pp. 267-279
- Birò, M.¹ Hujter, M.² Tuza, Z.³

3
- 0003638428
- J.C. Baltzer, Basel
- J. Blazewicz, W. Cellary, R. Slowinski and J. Weglarz, Scheduling under Resource Constraints: Deterministic Models (J.C. Baltzer, Basel, 1986).
- (1986) Scheduling under Resource Constraints: Deterministic Models
- Blazewicz, J.¹ Cellary, W.² Slowinski, R.³ Weglarz, J.⁴

4
- 0001488083
- On the complexity of timetable and multicommodity flow problems
- S. Even, A. Itai and A. Shamir, On the complexity of timetable and multicommodity flow problems, SIAM J. Comput. 5 (1976) 691-703.
- (1976) SIAM J. Comput. , vol.5 , pp. 691-703
- Even, S.¹ Itai, A.² Shamir, A.³

5
- 0038282267
- Precoloring extension II. Graph classes related to bipartite graphs
- M. Hujter and Z. Tuza, Precoloring extension II. Graph classes related to bipartite graphs, Acta Math Univ. Comeniana 61 (1993).
- (1993) Acta Math Univ. Comeniana , vol.61
- Hujter, M.¹ Tuza, Z.²

6
- 0000429528
- The NP-completeness of edge-coloring
- I. Holyer, The NP-completeness of edge-coloring, SIAM J. Comput. 10 (1981) 718-720.
- (1981) SIAM J. Comput. , vol.10 , pp. 718-720
- Holyer, I.¹

7
- 0042581278
- Scheduling and related graph theoretical problems
- Univ. Trier, Germany
- K. Jansen, Scheduling and related graph theoretical problems, Forschungsbericht 93-24, Univ. Trier, Germany, 1993.
- (1993) Forschungsbericht , vol.93 , Issue.24
- Jansen, K.¹

8
- 38249023254
- Interval vertex-coloring of a graph with forbidden colors
- M. Kubale, Interval vertex-coloring of a graph with forbidden colors, Discrete Math. 74 (1989) 125-136.
- (1989) Discrete Math. , vol.74 , pp. 125-136
- Kubale, M.¹

9
- 0346865623
- Some results concerning the complexity of restricted colorings of graphs
- M. Kubale, Some results concerning the complexity of restricted colorings of graphs, Discrete Appl. Math. 36 (1991) 35-46.
- (1991) Discrete Appl. Math. , vol.36 , pp. 35-46
- Kubale, M.¹

10
- 38249003803
- Interval edge coloring of a graph with forbidden colors
- M. Kubale, Interval edge coloring of a graph with forbidden colors, Discrtete Math. 121 (1993) 135-143.
- (1993) Discrtete Math. , vol.121 , pp. 135-143
- Kubale, M.¹

11
- 0022014119
- An introduction to timetabling
- D. de Werra, An introduction to Timetabling, European J. Oper. Res. 19 (1985) 151-162.
- (1985) European J. Oper. Res. , vol.19 , pp. 151-162
- De Werra, D.¹

12
- 0042080266
- Open shop scheduling with some additional constraints
- D. de Werra and J. Erschler, Open shop scheduling with some additional constraints, Graphs and Combin. 12 (1996) 81-93.
- (1996) Graphs and Combin. , vol.12 , pp. 81-93
- De Werra, D.¹ Erschler, J.²

13
- 38149147144
- Chromatic scheduling and frequency assignment
- D. de Werra and Y. Gay, Chromatic scheduling and frequency assignment, Discrete Applied Mathematics 49 (1994) 165-174.
- (1994) Discrete Applied Mathematics , vol.49 , pp. 165-174
- De Werra, D.¹ Gay, Y.²

14
- 0040588576
- Restrictions and preassignments in preemptive open shops scheduling
- D. de Werra, A.J. HOffman, N.V.R. Mahadev and U.N. Peled, Restrictions and Preassignments in preemptive open shops scheduling, Discrete Appl. Math. 68 (1996) 169-188.
- (1996) Discrete Appl. Math. , vol.68 , pp. 169-188
- De Werra, D.¹ Hoffman, A.J.² Mahadev, N.V.R.³ Peled, U.N.⁴

15
- 0041182669
- Edge-chromatic scheduling with simultaneity constraints
- D. de Werra, N.V.R. Mahadev and U.N. Peled, Edge-chromatic scheduling with simultaneity constraints, SIAM J. Discrete Math. 6 (1993) 631-641.
- (1993) SIAM J. Discrete Math. , vol.6 , pp. 631-641
- De Werra, D.¹ Mahadev, N.V.R.² Peled, U.N.³

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.