Ko‐Wei Lih

420 total citations
24 papers, 260 citations indexed

About

Ko‐Wei Lih is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Electrical and Electronic Engineering. According to data from OpenAlex, Ko‐Wei Lih has authored 24 papers receiving a total of 260 indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Computational Theory and Mathematics, 9 papers in Discrete Mathematics and Combinatorics and 7 papers in Electrical and Electronic Engineering. Recurrent topics in Ko‐Wei Lih's work include Advanced Graph Theory Research (15 papers), Graph Labeling and Dimension Problems (11 papers) and Limits and Structures in Graph Theory (8 papers). Ko‐Wei Lih is often cited by papers focused on Advanced Graph Theory Research (15 papers), Graph Labeling and Dimension Problems (11 papers) and Limits and Structures in Graph Theory (8 papers). Ko‐Wei Lih collaborates with scholars based in Taiwan, China and United States. Ko‐Wei Lih's co-authors include Weifan Wang, Pierre Hansen, Yuehua Bu, Daphne Der‐Fen Liu, Yusheng Li, Lianzhu Zhang, Jiaojiao Wu, Gerard J. Chang, Yiqiao Wang and Xingxing Yu and has published in prestigious journals such as European Journal of Operational Research, IEEE Transactions on Computers and Discrete Applied Mathematics.

In The Last Decade

Ko‐Wei Lih

22 papers receiving 237 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Ko‐Wei Lih Taiwan	10	206	110	63	50	30	24	260
Dan Pritikin United States	8	168 0.8×	106 1.0×	78 1.2×	73 1.5×	79 2.6×	24	263
V. G. Vizing Ukraine	5	404 2.0×	204 1.9×	93 1.5×	93 1.9×	28 0.9×	15	438
John Mitchem United States	11	270 1.3×	90 0.8×	69 1.1×	58 1.2×	58 1.9×	29	318
Gabriel Semanišin Slovakia	8	286 1.4×	123 1.1×	79 1.3×	48 1.0×	85 2.8×	31	327
V. E. Alekseev Russia	9	242 1.2×	97 0.9×	54 0.9×	52 1.0×	78 2.6×	24	297
Bernard Lidický United States	10	306 1.5×	202 1.8×	113 1.8×	67 1.3×	30 1.0×	60	370
Stanley Fiorini United Kingdom	8	280 1.4×	125 1.1×	131 2.1×	77 1.5×	31 1.0×	26	329
Matthias Kriesell Germany	11	365 1.8×	107 1.0×	101 1.6×	121 2.4×	170 5.7×	56	415
Nora Hartsfield United States	7	199 1.0×	33 0.3×	41 0.7×	50 1.0×	19 0.6×	19	255
Ajai Kapoor Italy	10	213 1.0×	84 0.8×	25 0.4×	59 1.2×	42 1.4×	16	263

Countries citing papers authored by Ko‐Wei Lih

Since Specialization

Citations

This map shows the geographic impact of Ko‐Wei Lih's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Ko‐Wei Lih with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ko‐Wei Lih more than expected).

Fields of papers citing papers by Ko‐Wei Lih

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Ko‐Wei Lih. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Ko‐Wei Lih. The network helps show where Ko‐Wei Lih may publish in the future.

Co-authorship network of co-authors of Ko‐Wei Lih

This figure shows the co-authorship network connecting the top 25 collaborators of Ko‐Wei Lih. A scholar is included among the top collaborators of Ko‐Wei Lih based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Ko‐Wei Lih. Ko‐Wei Lih is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Lih, Ko‐Wei, et al.. (2022). A note on additive choice number of planar graphs. Discrete Applied Mathematics. 321. 357–359. 1 indexed citations

Lih, Ko‐Wei, et al.. (2016). Approximation algorithms for constructing spanning K-trees using stock pieces of bounded length. Optimization Letters. 11(8). 1663–1675. 1 indexed citations

Lih, Ko‐Wei, et al.. (2014). Approximation algorithms for solving the constrained arc routing problem in mixed graphs. European Journal of Operational Research. 239(1). 80–88. 3 indexed citations

Zhang, Lianzhu, Weifan Wang, & Ko‐Wei Lih. (2013). An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph. Discrete Applied Mathematics. 162. 348–354. 11 indexed citations

Lih, Ko‐Wei, et al.. (2013). Nordhaus–Gaddum-type relations of three graph coloring parameters. Discrete Applied Mathematics. 162. 404–408. 3 indexed citations

Bu, Yuehua, Ko‐Wei Lih, & Weifan Wang. (2011). Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six. Discussiones Mathematicae Graph Theory. 31(3). 429–429. 17 indexed citations

Lih, Ko‐Wei. (2010). A Remarkable Euler Square before Euler. Mathematics Magazine. 83(3). 163–167. 1 indexed citations

Lih, Ko‐Wei, et al.. (2010). ACYCLIC LIST EDGE COLORING OF PLANAR GRAPHS. 1 indexed citations

Lih, Ko‐Wei, et al.. (2009). Full orientability of graphs with at most one dependent arc. Discrete Applied Mathematics. 157(13). 2969–2972.

10.

Wang, Weifan & Ko‐Wei Lih. (2008). Note on Coloring the Square of an Outerplanar Graph.. Ars Combinatoria. 86. 2 indexed citations

11.

Li, Yusheng & Ko‐Wei Lih. (2008). Multi-color Ramsey numbers of even cycles. European Journal of Combinatorics. 30(1). 114–118. 10 indexed citations

12.

Chang, Gerard J., et al.. (2007). On fully orientability of 2-degenerate graphs. Information Processing Letters. 105(5). 177–181. 2 indexed citations

13.

Lih, Ko‐Wei & Weifan Wang. (2006). COLORING THE SQUARE OF AN OUTERPLANAR GRAPH. Taiwanese Journal of Mathematics. 10(4). 17 indexed citations

14.

Lih, Ko‐Wei & Daphne Der‐Fen Liu. (2002). Circular chromatic numbers of some reduced Kneser graphs. Journal of Graph Theory. 41(1). 62–68. 11 indexed citations

15.

Wang, Weifan & Ko‐Wei Lih. (2001). Choosability, Edge Choosability, and Total Choosability of Outerplane Graphs. European Journal of Combinatorics. 22(1). 71–78. 28 indexed citations

16.

Lih, Ko‐Wei, et al.. (1996). On equitable coloring of bipartite graphs. Discrete Mathematics. 151(1-3). 155–160. 60 indexed citations

17.

Hansen, Pierre & Ko‐Wei Lih. (1992). Improved algorithms for partitioning problems in parallel, pipelined, and distributed computing. IEEE Transactions on Computers. 41(6). 769–771. 25 indexed citations

18.

Lih, Ko‐Wei, et al.. (1990). Diameters of iterated clique graphs of chordal graphs. Journal of Graph Theory. 14(3). 391–396. 9 indexed citations

19.

Lih, Ko‐Wei, et al.. (1987). Hamiltonian uniform subset graphs. Journal of Combinatorial Theory Series B. 42(3). 257–263. 31 indexed citations

20.

Lih, Ko‐Wei. (1980). Sperner families over a subset. Journal of Combinatorial Theory Series A. 29(2). 182–185. 17 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact