Search the dblp DataBase
Jinjiang Yuan :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Xiyong Zhang , Hua Guo , Jinjiang Yuan A Note of Perfect Nonlinear Functions. [Citation Graph (0, 0)][DBLP ] CANS, 2006, pp:259-269 [Conf ] Qiongxiang Huang , Jinjiang Yuan The automorphism groups of circulant digraphs of degree 3. [Citation Graph (0, 0)][DBLP ] Ars Comb., 1996, v:44, n:, pp:- [Journal ] Jinjiang Yuan Path-width and tree-width of the join of graphs. [Citation Graph (0, 0)][DBLP ] Ars Comb., 1996, v:43, n:, pp:- [Journal ] Liying Kang , Jinjiang Yuan Bondage number of planar graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2000, v:222, n:1-3, pp:191-198 [Journal ] Qin Wang , Jinjiang Yuan Maximal IM-unextendable graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:240, n:1-3, pp:295-298 [Journal ] Aifeng Yang , Jinjiang Yuan Partition the vertices of a graph into one independent set and one acyclic set. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:12, pp:1207-1216 [Journal ] Jinjiang Yuan , Qin Wang Partition the vertices of a graph into induced matchings. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2003, v:263, n:1-3, pp:323-329 [Journal ] Zhao Zhang , Jinjiang Yuan A proof of an inequality concerning k -restricted edge connectivity. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2005, v:304, n:1-3, pp:128-134 [Journal ] Weiping Shang , Jinjiang Yuan Upper minus domination in a claw-free cubic graph. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:22, pp:2983-2988 [Journal ] Zhao Zhang , Jinjiang Yuan Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:2, pp:293-298 [Journal ] Jinjiang Yuan , Sanming Zhou Polynomial Time Solvability Of The Weighted Ring Arc-Loading Problem With Integer Splitting. [Citation Graph (0, 0)][DBLP ] Journal of Interconnection Networks, 2004, v:5, n:2, pp:193-200 [Journal ] Zhaohui Liu , Jinjiang Yuan , T. C. Edwin Cheng On scheduling an unbounded batch machine. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2003, v:31, n:1, pp:42-48 [Journal ] Wenhua Li , Maurice Queyranne , Maxim Sviridenko , Jinjiang Yuan Approximation algorithms for shop scheduling problems with minsum objective: A correction. [Citation Graph (0, 0)][DBLP ] J. Scheduling, 2006, v:9, n:6, pp:569-570 [Journal ] Ruyan Fu , Tian Ji , Jinjiang Yuan , Yixun Lin Online scheduling in a parallel batch processing system to minimize makespan using restarts. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:374, n:1-3, pp:196-202 [Journal ] Ji Tian , Ruyan Fu , Jinjiang Yuan On-line scheduling with delivery time on a single batch machine. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:374, n:1-3, pp:49-57 [Journal ] Jinjiang Yuan , Ameur Soukhal , Youjun Chen , Lingfa Lu A note on the complexity of flow shop scheduling with transportation constraints. [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2007, v:178, n:3, pp:918-925 [Journal ] Jinjiang Yuan , Yixun Lin Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria. [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2005, v:164, n:3, pp:851-855 [Journal ] Sanming Zhou , Jinjiang Yuan Harper-type lower bounds and the bandwidths of the compositions of graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:181, n:1-3, pp:255-266 [Journal ] Jinjiang Yuan A local reductive elimination for the fill-in of graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1995, v:147, n:1-3, pp:321-327 [Journal ] Cheng He , Yixun Lin , Jinjiang Yuan Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:381, n:1-3, pp:234-240 [Journal ] Bounded single-machine parallel-batch scheduling with release dates and rejection. [Citation Graph (, )][DBLP ] Edge-deletable IM-extendable graphs with minimum number of edges. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.004secs