公開日期 | 標題 | 作者 | 來源出版物 | scopus | WOS | 全文 |
---|---|---|---|---|---|---|
1994 | The path-partition problem in block graphs | GERARD JENNHWA CHANG | Information Processing Letters | 20 | 0 | |
2005 | The PIGs full monty - A floor show of minimal separators | GERARD JENNHWA CHANG | Lecture Notes in Computer Science | |||
1985 | The poset scheduling problem | GERARD JENNHWA CHANG | Order | 7 | 5 | |
2008 | The upper bound on k-tuple domination numbers of graphs | GERARD JENNHWA CHANG | European Journal of Combinatorics | 15 | 13 | |
2004 | The weighted independent domination problem is NP-complete for chordal graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 23 | 19 | |
1997 | The β-assignment problem in general graphs | GERARD JENNHWA CHANG | Computers and Operations Research | |||
1998 | The β-assignment problems | GERARD JENNHWA CHANG | European Journal of Operational Research | |||
1989 | Total domination in block graphs | GERARD JENNHWA CHANG | Operations Research Letters | 20 | 18 | |
2002 | Total interval numbers of complete r-partite graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 2 | 2 | |
2012 | Upper bounds on Roman domination numbers of graphs | Liu, Chun-Hung; GERARD JENNHWA CHANG ; Chang, Gerard Jennhwa | Discrete Mathematics | 44 | 33 | |
2012 | Upper k-tuple domination in graphs | GERARD JENNHWA CHANG | Discrete Mathematics and Theoretical Computer Science | |||
2004 | Vertex and tree arboricities of graphs | GERARD JENNHWA CHANG | Journal of Combinatorial Optimization | 15 | 15 | |
2011 | Vertex-coloring edge-weightings of graphs | GERARD JENNHWA CHANG | Taiwanese Journal of Mathematics | |||
1998 | Weighted connected domination and Steiner trees in distance-hereditary graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | |||
2001 | Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs | GERARD JENNHWA CHANG | Theoretical Computer Science | 12 | 9 | |
1995 | Weighted independent perfect domination on cocomparability graphs | GERARD JENNHWA CHANG | Discrete Applied Mathematics | 33 | 28 | |
1999 | Wide diameters of butterfly networks | GERARD JENNHWA CHANG | Taiwanese Journal of Mathematics | |||
2012 | (Δ + 1)-total choosability of planar graphs with no cycles of length from 4 to k and without close triangles | GERARD JENNHWA CHANG | Discrete Mathematics | 1 | 1 | |
2007 | 北部地區數學期刊圖書服務計畫(3/3) | 張鎮華 | ||||
2007 | 國家理論科學研究中心子計畫一(4/5) | 張鎮華 |