Min Chih Lin

609 total citations
32 papers, 304 citations indexed

About

Min Chih Lin is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Geometry and Topology. According to data from OpenAlex, Min Chih Lin has authored 32 papers receiving a total of 304 indexed citations (citations by other indexed papers that have themselves been cited), including 32 papers in Computational Theory and Mathematics, 11 papers in Computer Networks and Communications and 9 papers in Geometry and Topology. Recurrent topics in Min Chih Lin's work include Advanced Graph Theory Research (31 papers), Complexity and Algorithms in Graphs (15 papers) and Graph Labeling and Dimension Problems (13 papers). Min Chih Lin is often cited by papers focused on Advanced Graph Theory Research (31 papers), Complexity and Algorithms in Graphs (15 papers) and Graph Labeling and Dimension Problems (13 papers). Min Chih Lin collaborates with scholars based in Argentina, Brazil and Chile. Min Chih Lin's co-authors include Jayme L. Szwarcfiter, Guillermo Durán, Flavia Bonomo, Ross M. McConnell, Dieter Rautenbach, Jeremy Spinrad, Andrew R. Curtis, Fábio Protti, Yahav Nussbaum and Julián Mestre and has published in prestigious journals such as Mathematical Programming, Annals of Operations Research and Theoretical Computer Science.

In The Last Decade

Min Chih Lin

30 papers receiving 283 citations

Peers

Min Chih Lin
Zhengke Miao China
Yota Otachi Japan
Jochen Harant Germany
Tomáš Kaiser Czechia
D. S. Malyshev Russia
Zevi Miller United States
Curtiss E. Wall United States
Toru Hasunuma Japan
Margaret B. Cozzens United States
David Erwin United States
Zhengke Miao China
Min Chih Lin
Citations per year, relative to Min Chih Lin Min Chih Lin (= 1×) peers Zhengke Miao

Countries citing papers authored by Min Chih Lin

Since Specialization
Citations

This map shows the geographic impact of Min Chih Lin'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 Min Chih Lin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Min Chih Lin more than expected).

Fields of papers citing papers by Min Chih Lin

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Min Chih Lin. 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 Min Chih Lin. The network helps show where Min Chih Lin may publish in the future.

Co-authorship network of co-authors of Min Chih Lin

This figure shows the co-authorship network connecting the top 25 collaborators of Min Chih Lin. A scholar is included among the top collaborators of Min Chih Lin 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 Min Chih Lin. Min Chih Lin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Lin, Min Chih, et al.. (2018). Approximating weighted induced matchings. Discrete Applied Mathematics. 243. 304–310. 3 indexed citations
2.
Lin, Min Chih, et al.. (2015). On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size. Discrete Applied Mathematics. 197. 53–58. 1 indexed citations
3.
Lin, Min Chih, et al.. (2015). Approximation algorithms for clique transversals on some graph classes. Information Processing Letters. 115(9). 667–670. 1 indexed citations
4.
Lin, Min Chih, et al.. (2014). The Maximum Number of Dominating Induced Matchings. Journal of Graph Theory. 78(4). 258–268. 3 indexed citations
5.
Lin, Min Chih, et al.. (2014). Fast algorithms for some dominating induced matching problems. Information Processing Letters. 114(10). 524–528. 5 indexed citations
6.
Lin, Min Chih, et al.. (2012). Normal Helly circular-arc graphs and its subclasses. Discrete Applied Mathematics. 161(7-8). 1037–1059. 13 indexed citations
7.
Lin, Min Chih, et al.. (2011). Arboricity, h-index, and dynamic algorithms. Theoretical Computer Science. 426-427. 75–90. 25 indexed citations
8.
Lin, Min Chih, et al.. (2010). Powers of cycles, powers of paths, and distance graphs. Discrete Applied Mathematics. 159(7). 621–627. 16 indexed citations
9.
Lin, Min Chih, et al.. (2009). Short Models for Unit Interval Graphs. Electronic Notes in Discrete Mathematics. 35. 247–255. 6 indexed citations
10.
Lin, Min Chih, et al.. (2009). Linear-Time Recognition of Helly Circular-Arc Models and Graphs. Algorithmica. 59(2). 215–239. 11 indexed citations
11.
Lin, Min Chih & Jayme L. Szwarcfiter. (2008). Characterizations and recognition of circular-arc graphs and subclasses: A survey. Discrete Mathematics. 309(18). 5618–5635. 19 indexed citations
12.
Dourado, Mitre C., Min Chih Lin, Fábio Protti, & Jayme L. Szwarcfiter. (2008). Improved algorithms for recognizing p-Helly and hereditary p-Helly hypergraphs. Information Processing Letters. 108(4). 247–250. 5 indexed citations
13.
Lin, Min Chih, et al.. (2008). On cliques of Helly Circular-arc Graphs. Electronic Notes in Discrete Mathematics. 30. 117–122. 7 indexed citations
14.
Durán, Guillermo, et al.. (2007). Algorithms for finding clique-transversals of graphs. Annals of Operations Research. 157(1). 37–45. 11 indexed citations
15.
Lin, Min Chih & Jayme L. Szwarcfiter. (2006). Efficient construction of unit circular-arc models. Symposium on Discrete Algorithms. 309–315. 8 indexed citations
16.
Durán, Guillermo, et al.. (2006). Algorithms for clique-independent sets on subclasses of circular-arc graphs. Discrete Applied Mathematics. 154(13). 1783–1790. 12 indexed citations
17.
Lin, Min Chih & Jayme L. Szwarcfiter. (2006). Efficient construction of unit circular-arc models. 309–315. 4 indexed citations
18.
Durán, Guillermo, et al.. (2003). Self‐clique graphs and matrix permutations. Journal of Graph Theory. 44(3). 178–192. 16 indexed citations
19.
Durán, Guillermo & Min Chih Lin. (2001). Clique graphs of Helly circular arc graphs.. Ars Combinatoria. 60(1). e30–e30. 11 indexed citations
20.
Lin, Min Chih, et al.. (2001). A sufficient condition for self-clique graphs. Electronic Notes in Discrete Mathematics. 7. 174–177. 5 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

Breakdown of academic impact, for papers by Zhengke Miao Breakdown of academic impact, for papers by Yota Otachi Breakdown of academic impact, for papers by Jochen Harant Breakdown of academic impact, for papers by Tomáš Kaiser Breakdown of academic impact, for papers by D. S. Malyshev Breakdown of academic impact, for papers by Zevi Miller Breakdown of academic impact, for papers by Curtiss E. Wall Breakdown of academic impact, for papers by Toru Hasunuma Breakdown of academic impact, for papers by Margaret B. Cozzens Breakdown of academic impact, for papers by David Erwin
Rankless by CCL
2026