default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYixun Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j46]Lan Lin
, Yixun Lin:
Graph Bipartization Problem with Applications to Via Minimization in VLSI Design. Int. J. Found. Comput. Sci. 34(4): 347-361 (2023)- [j45]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): 1-32 (2023) - 2021
- [c1]Yixun Lin, Helen S. Du, Kathy Ning Shen:
What Climate-Orientation Fit Do to Passion for Learning, How Could Danmu Help? PACIS 2021: 183 - 2020
- [j44]Lan Lin, Yixun Lin:
Optimality computation of the minimum stretch spanning tree problem. Appl. Math. Comput. 386: 125502 (2020) - [j43]Lan Lin, Yixun Lin:
The Minimum Stretch Spanning Tree Problem for Hamming Graphs and Higher-Dimensional Grids. J. Interconnect. Networks 20(1): 2050004:1-2050004:15 (2020) - [j42]Marcelo Henriques de Carvalho, Nishad Kothari, Xiumei Wang, Yixun Lin:
Birkhoff-von Neumann Graphs that are PM-Compact. SIAM J. Discret. Math. 34(3): 1769-1790 (2020)
2010 – 2019
- 2018
- [j41]Yixun Lin, Xiumei Wang:
Core index of perfect matching polytope for a 2-connected cubic graph. Discuss. Math. Graph Theory 38(1): 189-201 (2018) - [j40]Hao Lin, Cheng He, Yixun Lin:
Bicriteria scheduling for due date assignment with total weighted tardiness. RAIRO Oper. Res. 52(2): 359 (2018) - 2015
- [j39]Cheng He, Hao Lin, Yixun Lin:
Bounded serial-batching scheduling for minimizing maximum lateness and makespan. Discret. Optim. 16: 70-75 (2015) - [j38]Lan Lin, Yixun Lin:
New Classes of Extremal Graphs with Given Bandwidth. Graphs Comb. 31(1): 149-167 (2015) - [j37]Lan Lin, Yixun Lin:
New bounds on the edge-bandwidth of triangular grids. RAIRO Theor. Informatics Appl. 49(1): 47-60 (2015) - 2014
- [j36]Lan Lin, Yixun Lin, Douglas B. West:
Cutwidth of triangular grids. Discret. Math. 331: 89-92 (2014) - [j35]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) - 2013
- [j34]Xiumei Wang, Aifen Feng, Yixun Lin:
4-regular bipartite matching extendable graphs. Ars Comb. 110: 113-128 (2013) - [j33]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): 177-186 (2013) - [j32]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): 772-783 (2013) - [j31]Xiumei Wang, Cheng He, Yixun Lin:
Removable Edges in Near-bricks. Discret. Math. Theor. Comput. Sci. 15(2): 157-164 (2013) - [j30]Lan Lin, Yixun Lin:
Machine scheduling with contiguous processing constraints. Inf. Process. Lett. 113(8): 280-284 (2013) - [j29]Lan Lin, Yixun Lin:
Cutwidth of iterated caterpillars. RAIRO Theor. Informatics Appl. 47(2): 181-193 (2013) - [j28]Cheng He, Xiumei Wang, Yixun Lin, Yundong Mu:
An Improved Algorithm for a Bicriteria Batching Scheduling Problem. RAIRO Oper. Res. 47(1): 1-8 (2013) - [j27]Xiumei Wang, Yixun Lin:
Three-matching intersection conjecture for perfect matching polytopes of small dimensions. Theor. Comput. Sci. 482: 111-114 (2013) - 2012
- [j26]Zhenkun Zhang, Yixun Lin:
On 4-cutwidth critical trees. Ars Comb. 105: 149-160 (2012) - 2011
- [j25]Lan Lin, Yixun Lin:
Square-root rule of two-dimensional bandwidth problem. RAIRO Theor. Informatics Appl. 45(4): 399-411 (2011) - 2010
- [j24]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): 577-585 (2010) - [j23]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): 669-676 (2010) - [j22]Xiumei Wang, Sujing Zhou, Yixun Lin:
Bipartite Matching extendability and toughness. Discret. Math. Algorithms Appl. 2(1): 33-44 (2010) - [j21]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): 966-970 (2010) - [j20]Lan Lin, Yixun Lin:
Two models of two-dimensional bandwidth problems. Inf. Process. Lett. 110(11): 469-473 (2010)
2000 – 2009
- 2009
- [j19]Xiumei Wang, Zhenkun Zhang, Yixun Lin:
Degree-type Conditions for Bipartite Matching Extendability. Ars Comb. 90 (2009) - [j18]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): 603-607 (2009) - [j17]Qingqin Nong, Jinjiang Yuan, Yixun Lin:
The weighted link ring loading problem. J. Comb. Optim. 18(1): 38-50 (2009) - 2008
- [j16]Xiumei Wang, Zhenkun Zhang, Yixun Lin:
Bipartite matching extendable graphs. Discret. Math. 308(23): 5334-5341 (2008) - 2007
- [j15]Yixun Lin, Xiumei Wang:
Necessary and sufficient conditions of optimality for some classical scheduling problems. Eur. J. Oper. Res. 176(2): 809-818 (2007) - [j14]Wenhua Li, Jinjiang Yuan, Yixun Lin:
A note on special optimal batching structures to minimize total weighted completion time. J. Comb. Optim. 14(4): 475-480 (2007) - [j13]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): 196-202 (2007) - [j12]Cheng He, Yixun Lin, Jinjiang Yuan:
Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan. Theor. Comput. Sci. 381(1-3): 234-240 (2007) - 2005
- [j11]Jinjiang Yuan, Yixun Lin:
Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria. Eur. J. Oper. Res. 164(3): 851-855 (2005) - 2004
- [j10]Yixun Lin, Aifeng Yang:
On 3-cutwidth critical graphs. Discret. Math. 275(1-3): 339-346 (2004) - [j9]Rainer E. Burkard, Yixun Lin, Jianzhong Zhang:
Weight reduction problems with certain bottleneck objectives. Eur. J. Oper. Res. 153(1): 191-199 (2004) - [j8]Yixun Lin, Wenhua Li:
Parallel machine scheduling of machine-dependent jobs with unit-length. Eur. J. Oper. Res. 156(1): 261-266 (2004) - 2003
- [j7]Jianzhong Zhang, Yixun Lin:
Computation of the Reverse Shortest-Path Problem. J. Glob. Optim. 25(3): 243-261 (2003) - 2001
- [j6]Jianzhong Zhang, Chao Yang, Yixun Lin:
A class of bottleneck expansion problems. Comput. Oper. Res. 28(6): 505-519 (2001) - [j5]Rainer E. Burkard, Helidon Dollani, Yixun Lin, Günter Rote:
The Obnoxious Center Problem on a Tree. SIAM J. Discret. Math. 14(4): 498-509 (2001)
1990 – 1999
- 1997
- [j4]Yixun Lin:
Minimum bandwidth problem for embedding graphs in cycles. Networks 29(3): 135-140 (1997) - 1996
- [j3]Hongxiang Li, Yixun Lin:
On the boundary inequality for bandwidth of graphs. Ars Comb. 42 (1996) - 1994
- [j2]Hongxiang Li, Yixun Lin:
The existence of infinitely many primary trees. Discret. Math. 135(1-3): 153-161 (1994) - 1993
- [j1]Huaien Li, Yixun Lin:
On the characterization of path graphs. J. Graph Theory 17(4): 463-466 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
