Min Chih Lin

From MaRDI portal
Person:324822

Available identifiers

zbMath Open lin.min-chihWikidataQ102325307 ScholiaQ102325307MaRDI QIDQ324822

List of research outcomes





PublicationDate of PublicationType
Graphs whose vertices of degree at least 2 lie in a triangle2025-01-20Paper
Restricted Hamming–Huffman trees2022-07-22Paper
Modelling and solving the perfect edge domination problem2020-04-27Paper
Perfect edge domination: hard and solvable cases2018-06-12Paper
Approximating weighted induced matchings2018-05-24Paper
Approximating weighted neighborhood independent sets2017-11-22Paper
Exact algorithms for minimum weighted dominating induced matching2017-04-12Paper
On neighborhood-Helly graphs2016-11-24Paper
Efficient and perfect domination on circular-arc graphs2016-10-17Paper
On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size2015-09-30Paper
A faster algorithm for the cluster editing problem on proper interval graphs2015-09-15Paper
Approximation algorithms for clique transversals on some graph classes2015-06-02Paper
Domination problems on P5-free graphs2015-04-28Paper
The Maximum Number of Dominating Induced Matchings2015-03-24Paper
Fast algorithms for some dominating induced matching problems2014-06-23Paper
O(n) Time Algorithms for Dominating Induced Matching Problems2014-03-31Paper
https://portal.mardi4nfdi.de/entity/Q57473802014-02-14Paper
An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching2014-01-14Paper
Short models for unit interval graphs2013-07-19Paper
Normal Helly circular-arc graphs and its subclasses2013-04-25Paper
Exact algorithms for dominating induced matchings2013-01-31Paper
Arboricity, \(h\)-index, and dynamic algorithms2012-05-30Paper
Powers of cycles, powers of paths, and distance graphs2011-04-19Paper
Linear-time recognition of Helly circular-arc models and graphs2011-03-02Paper
Efficient construction of unit circular-arc models2010-08-16Paper
The clique operator on circular-arc graphs2010-08-13Paper
Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs2010-06-09Paper
Faster recognition of clique-Helly and hereditary clique-Helly graphs2010-03-24Paper
Characterizations and recognition of circular-arc graphs and subclasses: a survey2009-12-15Paper
Unit Circular-Arc Graph Representations and Feasible Circulations2009-03-16Paper
Algorithms for finding clique-transversals of graphs2008-09-03Paper
A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs2008-07-15Paper
Proper Helly Circular-Arc Graphs2008-07-01Paper
On cliques of Helly Circular-arc Graphs2008-06-05Paper
Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs2007-09-10Paper
Algorithms for clique-independent sets on subclasses of circular-arc graphs2006-08-17Paper
On balanced graphs2006-01-13Paper
https://portal.mardi4nfdi.de/entity/Q57084962005-11-18Paper
https://portal.mardi4nfdi.de/entity/Q54614442005-07-26Paper
Self‐clique graphs and matrix permutations2004-02-03Paper
On clique-transversals and clique-independent sets2003-01-27Paper
On some subclasses of circular-arc graphs2002-01-02Paper
A sufficient condition for self-clique graphs2001-10-24Paper
Graphs whose vertices of degree at least 2 lie in a triangleN/APaper

Research outcomes over time

This page was built for person: Min Chih Lin