Yixun Lin
Orcid: 0000-0001-8973-8842
According to our database1,
Yixun Lin
authored at least 47 papers
between 1993 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
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
Proceedings of the 25th Pacific Asia Conference on Information Systems, 2021
2020
The Minimum Stretch Spanning Tree Problem for Hamming Graphs and Higher-Dimensional Grids.
J. Interconnect. Networks, 2020
Appl. Math. Comput., 2020
2018
RAIRO Oper. Res., 2018
Discuss. Math. Graph Theory, 2018
2015
RAIRO Theor. Informatics Appl., 2015
Discret. Optim., 2015
2014
Discret. Math. Algorithms Appl., 2014
2013
Three-matching intersection conjecture for perfect matching polytopes of small dimensions.
Theor. Comput. Sci., 2013
RAIRO Oper. Res., 2013
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
RAIRO Theor. Informatics Appl., 2011
2010
A note on the single machine scheduling to minimize the number of tardy jobs with deadlines.
Eur. J. Oper. Res., 2010
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
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
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
Eur. J. Oper. Res., 2004
Eur. J. Oper. Res., 2004
2003
2001
1997
1996
On the boundary inequality for bandwidth of graphs.
Ars Comb., 1996
1994
1993