Yixun Lin

Publication Activity (10 Years)

Years Active: 1993-2023
Publications (10 Years): 8

Top Topics

Top Venues

RAIRO Oper. Res.

RAIRO Theor. Informatics Appl.

SIAM J. Discret. Math.

Publications

Lan Lin, Yixun Lin
Graph Bipartization Problem with Applications to Via Minimization in VLSI Design. Int. J. Found. Comput. Sci. 34 (4) (2023)
Jing (Elaine) Chen, Feng Bao, Chenxi Li, Yixun Lin
The Application and Ethics of Artificial Intelligence in Blockchain: A Bibliometric-Content Analysis. J. Glob. Inf. Manag. 31 (7) (2023)
Yixun Lin, Helen S. Du, Kathy Ning Shen
What Climate-Orientation Fit Do to Passion for Learning, How Could Danmu Help? PACIS (2021)
Lan Lin, Yixun Lin
Optimality computation of the minimum stretch spanning tree problem. Appl. Math. Comput. 386 (2020)
Marcelo Henriques de Carvalho, Nishad Kothari, Xiumei Wang, Yixun Lin
Birkhoff-von Neumann Graphs that are PM-Compact. SIAM J. Discret. Math. 34 (3) (2020)
Lan Lin, Yixun Lin
The Minimum Stretch Spanning Tree Problem for Hamming Graphs and Higher-Dimensional Grids. J. Interconnect. Networks 20 (1) (2020)
Yixun Lin, Xiumei Wang
Core index of perfect matching polytope for a 2-connected cubic graph. Discuss. Math. Graph Theory 38 (1) (2018)
Hao Lin, Cheng He, Yixun Lin
Bicriteria scheduling for due date assignment with total weighted tardiness. RAIRO Oper. Res. 52 (2) (2018)
Lan Lin, Yixun Lin
New Classes of Extremal Graphs with Given Bandwidth. Graphs Comb. 31 (1) (2015)
Lan Lin, Yixun Lin
New bounds on the edge-bandwidth of triangular grids. RAIRO Theor. Informatics Appl. 49 (1) (2015)
Cheng He, Hao Lin, Yixun Lin
Bounded serial-batching scheduling for minimizing maximum lateness and makespan. Discret. Optim. 16 (2015)
Xiumei Wang, Weiping Shang, Yixun Lin, Marcelo Henriques de Carvalho
A Characterization of PM-Compact claw-Free cubic graphs. Discret. Math. Algorithms Appl. 6 (2) (2014)
Lan Lin, Yixun Lin, Douglas B. West
Cutwidth of triangular grids. Discret. Math. 331 (2014)
Xiumei Wang, Aifen Feng, Yixun Lin
4-regular bipartite matching extendable graphs. Ars Comb. 110 (2013)
Lan Lin, Yixun Lin
Machine scheduling with contiguous processing constraints. Inf. Process. Lett. 113 (8) (2013)
Xiumei Wang, Yixun Lin, Marcelo Henriques de Carvalho, Cláudio Leonardo Lucchesi, G. Sanjith, Charles H. C. Little
A characterization of PM-compact bipartite and near-bipartite graphs. Discret. Math. 313 (6) (2013)
Lan Lin, Yixun Lin
Cutwidth of iterated caterpillars. RAIRO Theor. Informatics Appl. 47 (2) (2013)
Cheng He, Hao Lin, Yixun Lin, Ji Tian
Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan. Central Eur. J. Oper. Res. 21 (1) (2013)
Cheng He, Xiumei Wang, Yixun Lin, Yundong Mu
An Improved Algorithm for a Bicriteria Batching Scheduling Problem. RAIRO Oper. Res. 47 (1) (2013)
Xiumei Wang, Cheng He, Yixun Lin
Removable Edges in Near-bricks. Discret. Math. Theor. Comput. Sci. 15 (2) (2013)
Xiumei Wang, Yixun Lin
Three-matching intersection conjecture for perfect matching polytopes of small dimensions. Theor. Comput. Sci. 482 (2013)
Zhenkun Zhang, Yixun Lin
On 4-cutwidth critical trees. Ars Comb. 105 (2012)
Lan Lin, Yixun Lin
Square-root rule of two-dimensional bandwidth problem. RAIRO Theor. Informatics Appl. 45 (4) (2011)
Xiumei Wang, Sujing Zhou, Yixun Lin
Bipartite Matching extendability and toughness. Discret. Math. Algorithms Appl. 2 (1) (2010)
Cheng He, Yixun Lin, Jinjiang Yuan
A note on the single machine scheduling to minimize the number of tardy jobs with deadlines. Eur. J. Oper. Res. 201 (3) (2010)
Lan Lin, Yixun Lin
Two models of two-dimensional bandwidth problems. Inf. Process. Lett. 110 (11) (2010)
Lin Lin, Yixun Lin, Xianwei Zhou, Ruyan Fu
Parallel Machine Scheduling with a Simultaneity Constraint and Unit-Length Jobs to minimize the makespan. Asia Pac. J. Oper. Res. 27 (6) (2010)
Cheng He, Yixun Lin, Jinjiang Yuan
Some Improved Algorithms on the Single Machine Hierarchical Scheduling with Total tardiness as the Primary Criterion. Asia Pac. J. Oper. Res. 27 (5) (2010)
Xiumei Wang, Zhenkun Zhang, Yixun Lin
Degree-type Conditions for Bipartite Matching Extendability. Ars Comb. 90 (2009)
Qingqin Nong, Jinjiang Yuan, Yixun Lin
The weighted link ring loading problem. J. Comb. Optim. 18 (1) (2009)
Cheng He, Yixun Lin, Jinjiang Yuan
A DP algorithm for minimizing makespan and total completion time on a series-batching machine. Inf. Process. Lett. 109 (12) (2009)
Xiumei Wang, Zhenkun Zhang, Yixun Lin
Bipartite matching extendable graphs. Discret. Math. 308 (23) (2008)
Ruyan Fu, Ji Tian, Jinjiang Yuan, Yixun Lin
Online scheduling in a parallel batch processing system to minimize makespan using restarts. Theor. Comput. Sci. 374 (1-3) (2007)
Cheng He, Yixun Lin, Jinjiang Yuan
Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan. Theor. Comput. Sci. 381 (1-3) (2007)
Yixun Lin, Xiumei Wang
Necessary and sufficient conditions of optimality for some classical scheduling problems. Eur. J. Oper. Res. 176 (2) (2007)
Wenhua Li, Jinjiang Yuan, Yixun Lin
A note on special optimal batching structures to minimize total weighted completion time. J. Comb. Optim. 14 (4) (2007)
Jinjiang Yuan, Yixun Lin
Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria. Eur. J. Oper. Res. 164 (3) (2005)
Rainer E. Burkard, Yixun Lin, Jianzhong Zhang
Weight reduction problems with certain bottleneck objectives. Eur. J. Oper. Res. 153 (1) (2004)
Yixun Lin, Wenhua Li
Parallel machine scheduling of machine-dependent jobs with unit-length. Eur. J. Oper. Res. 156 (1) (2004)
Yixun Lin, Aifeng Yang
On 3-cutwidth critical graphs. Discret. Math. 275 (1-3) (2004)
Jianzhong Zhang, Yixun Lin
Computation of the Reverse Shortest-Path Problem. J. Glob. Optim. 25 (3) (2003)
Jianzhong Zhang, Chao Yang, Yixun Lin
A class of bottleneck expansion problems. Comput. Oper. Res. 28 (6) (2001)
Rainer E. Burkard, Helidon Dollani, Yixun Lin, Günter Rote
The Obnoxious Center Problem on a Tree. SIAM J. Discret. Math. 14 (4) (2001)
Yixun Lin
Minimum bandwidth problem for embedding graphs in cycles. Networks 29 (3) (1997)
Hongxiang Li, Yixun Lin
On the boundary inequality for bandwidth of graphs. Ars Comb. 42 (1996)
Hongxiang Li, Yixun Lin
The existence of infinitely many primary trees. Discret. Math. 135 (1-3) (1994)
Huaien Li, Yixun Lin
On the characterization of path graphs. J. Graph Theory 17 (4) (1993)