Yixun Lin

According to our database1, Yixun Lin authored at least 41 papers between 1993 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


On csauthors.net:


Bicriteria scheduling for due date assignment with total weighted tardiness.
RAIRO - Operations Research, 2018

Core index of perfect matching polytope for a 2-connected cubic graph.
Discussiones Mathematicae Graph Theory, 2018

New bounds on the edge-bandwidth of triangular grids.
RAIRO - Theor. Inf. and Applic., 2015

New Classes of Extremal Graphs with Given Bandwidth.
Graphs and Combinatorics, 2015

Bounded serial-batching scheduling for minimizing maximum lateness and makespan.
Discrete Optimization, 2015

A Characterization of PM-Compact claw-Free cubic graphs.
Discrete Math., Alg. and Appl., 2014

Cutwidth of triangular grids.
Discrete Mathematics, 2014

Three-matching intersection conjecture for perfect matching polytopes of small dimensions.
Theor. Comput. Sci., 2013

An Improved Algorithm for a Bicriteria Batching Scheduling Problem.
RAIRO - Operations Research, 2013

Cutwidth of iterated caterpillars.
RAIRO - Theor. Inf. and Applic., 2013

Machine scheduling with contiguous processing constraints.
Inf. Process. Lett., 2013

Removable Edges in Near-bricks.
Discrete Mathematics & Theoretical Computer Science, 2013

A characterization of PM-compact bipartite and near-bipartite graphs.
Discrete Mathematics, 2013

Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan.
CEJOR, 2013

4-regular bipartite matching extendable graphs.
Ars Comb., 2013

On 4-cutwidth critical trees.
Ars Comb., 2012

Square-root rule of two-dimensional bandwidth problem.
RAIRO - Theor. Inf. and Applic., 2011

Two models of two-dimensional bandwidth problems.
Inf. Process. Lett., 2010

A note on the single machine scheduling to minimize the number of tardy jobs with deadlines.
European Journal of Operational Research, 2010

Bipartite Matching extendability and toughness.
Discrete Math., Alg. and Appl., 2010

Parallel Machine Scheduling with a Simultaneity Constraint and Unit-Length Jobs to minimize the makespan.
APJOR, 2010

Some Improved Algorithms on the Single Machine Hierarchical Scheduling with Total tardiness as the Primary Criterion.
APJOR, 2010

The weighted link ring loading problem.
J. Comb. Optim., 2009

A DP algorithm for minimizing makespan and total completion time on a series-batching machine.
Inf. Process. Lett., 2009

Degree-type Conditions for Bipartite Matching Extendability.
Ars Comb., 2009

Bipartite matching extendable graphs.
Discrete Mathematics, 2008

Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan.
Theor. Comput. Sci., 2007

Online scheduling in a parallel batch processing system to minimize makespan using restarts.
Theor. Comput. Sci., 2007

A note on special optimal batching structures to minimize total weighted completion time.
J. Comb. Optim., 2007

Necessary and sufficient conditions of optimality for some classical scheduling problems.
European Journal of Operational Research, 2007

Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria.
European Journal of Operational Research, 2005

Parallel machine scheduling of machine-dependent jobs with unit-length.
European Journal of Operational Research, 2004

Weight reduction problems with certain bottleneck objectives.
European Journal of Operational Research, 2004

On 3-cutwidth critical graphs.
Discrete Mathematics, 2004

Computation of the Reverse Shortest-Path Problem.
J. Global Optimization, 2003

The Obnoxious Center Problem on a Tree.
SIAM J. Discrete Math., 2001

A class of bottleneck expansion problems.
Computers & OR, 2001

Minimum bandwidth problem for embedding graphs in cycles.
Networks, 1997

On the boundary inequality for bandwidth of graphs.
Ars Comb., 1996

The existence of infinitely many primary trees.
Discrete Mathematics, 1994

On the characterization of path graphs.
Journal of Graph Theory, 1993