The following pages link to Min Chih Lin (Q324822):
Displaying 43 items.
- Efficient and perfect domination on circular-arc graphs (Q324824) (← links)
- On neighborhood-Helly graphs (Q344856) (← links)
- Arboricity, \(h\)-index, and dynamic algorithms (Q418737) (← links)
- A faster algorithm for the cluster editing problem on proper interval graphs (Q495665) (← links)
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (Q499360) (← links)
- Exact algorithms for minimum weighted dominating induced matching (Q521800) (← links)
- Powers of cycles, powers of paths, and distance graphs (Q531605) (← links)
- Linear-time recognition of Helly circular-arc models and graphs (Q627542) (← links)
- Algorithms for finding clique-transversals of graphs (Q940841) (← links)
- Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs (Q975464) (← links)
- The clique operator on circular-arc graphs (Q987670) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- Perfect edge domination: hard and solvable cases (Q1639290) (← links)
- Approximating weighted neighborhood independent sets (Q1679903) (← links)
- Approximating weighted induced matchings (Q1752475) (← links)
- On clique-transversals and clique-independent sets (Q1854773) (← links)
- Normal Helly circular-arc graphs and its subclasses (Q1949109) (← links)
- Fast algorithms for some dominating induced matching problems (Q2015144) (← links)
- Modelling and solving the perfect edge domination problem (Q2174880) (← links)
- Approximation algorithms for clique transversals on some graph classes (Q2346555) (← links)
- Faster recognition of clique-Helly and hereditary clique-Helly graphs (Q2379939) (← links)
- Algorithms for clique-independent sets on subclasses of circular-arc graphs (Q2500526) (← links)
- On balanced graphs (Q2583124) (← links)
- On some subclasses of circular-arc graphs (Q2716684) (← links)
- A sufficient condition for self-clique graphs (Q2741501) (← links)
- Short models for unit interval graphs (Q2840545) (← links)
- An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching (Q2872119) (← links)
- On cliques of Helly Circular-arc Graphs (Q3503539) (← links)
- Proper Helly Circular-Arc Graphs (Q3508572) (← links)
- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs (Q3512472) (← links)
- Efficient construction of unit circular-arc models (Q3581535) (← links)
- Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs (Q3591328) (← links)
- Unit Circular-Arc Graph Representations and Feasible Circulations (Q3614215) (← links)
- Self‐clique graphs and matrix permutations (Q4446891) (← links)
- The Maximum Number of Dominating Induced Matchings (Q4982287) (← links)
- Restricted Hamming–Huffman trees (Q5092535) (← links)
- Domination problems on P<sub>5</sub>-free graphs (Q5248877) (← links)
- O(n) Time Algorithms for Dominating Induced Matching Problems (Q5405059) (← links)
- (Q5461444) (← links)
- (Q5708496) (← links)
- (Q5747380) (← links)
- Graphs whose vertices of degree at least 2 lie in a triangle (Q6505799) (← links)
- Graphs whose vertices of degree at least 2 lie in a triangle (Q6667338) (← links)
