Yixun Lin

Orcid: 0000-0001-8973-8842

According to our database1, Yixun Lin authored at least 47 papers between 1993 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Graph Bipartization Problem with Applications to Via Minimization in VLSI Design.
Int. J. Found. Comput. Sci., June, 2023

The Application and Ethics of Artificial Intelligence in Blockchain: A Bibliometric-Content Analysis.
J. Glob. Inf. Manag., 2023

2021
What Climate-Orientation Fit Do to Passion for Learning, How Could Danmu Help?
Proceedings of the 25th Pacific Asia Conference on Information Systems, 2021

2020
Birkhoff-von Neumann Graphs that are PM-Compact.
SIAM J. Discret. Math., 2020

The Minimum Stretch Spanning Tree Problem for Hamming Graphs and Higher-Dimensional Grids.
J. Interconnect. Networks, 2020

Optimality computation of the minimum stretch spanning tree problem.
Appl. Math. Comput., 2020

2018
Bicriteria scheduling for due date assignment with total weighted tardiness.
RAIRO Oper. Res., 2018

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

2015
New bounds on the edge-bandwidth of triangular grids.
RAIRO Theor. Informatics Appl., 2015

New Classes of Extremal Graphs with Given Bandwidth.
Graphs Comb., 2015

Bounded serial-batching scheduling for minimizing maximum lateness and makespan.
Discret. Optim., 2015

2014
A Characterization of PM-Compact claw-Free cubic graphs.
Discret. Math. Algorithms Appl., 2014

Cutwidth of triangular grids.
Discret. Math., 2014

2013
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 Oper. Res., 2013

Cutwidth of iterated caterpillars.
RAIRO Theor. Informatics Appl., 2013

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

Removable Edges in Near-bricks.
Discret. Math. Theor. Comput. Sci., 2013

A characterization of PM-compact bipartite and near-bipartite graphs.
Discret. Math., 2013

Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan.
Central Eur. J. Oper. Res., 2013

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

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

2011
Square-root rule of two-dimensional bandwidth problem.
RAIRO Theor. Informatics Appl., 2011

2010
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.
Eur. J. Oper. Res., 2010

Bipartite Matching extendability and toughness.
Discret. Math. Algorithms Appl., 2010

Parallel Machine Scheduling with a Simultaneity Constraint and Unit-Length Jobs to minimize the makespan.
Asia Pac. J. Oper. Res., 2010

Some Improved Algorithms on the Single Machine Hierarchical Scheduling with Total tardiness as the Primary Criterion.
Asia Pac. J. Oper. Res., 2010

2009
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

2008
Bipartite matching extendable graphs.
Discret. Math., 2008

2007
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.
Eur. J. Oper. Res., 2007

2005
Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria.
Eur. J. Oper. Res., 2005

2004
Parallel machine scheduling of machine-dependent jobs with unit-length.
Eur. J. Oper. Res., 2004

Weight reduction problems with certain bottleneck objectives.
Eur. J. Oper. Res., 2004

On 3-cutwidth critical graphs.
Discret. Math., 2004

2003
Computation of the Reverse Shortest-Path Problem.
J. Glob. Optim., 2003

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

A class of bottleneck expansion problems.
Comput. Oper. Res., 2001

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

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

1994
The existence of infinitely many primary trees.
Discret. Math., 1994

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


  Loading...