@techreport{oai:ipsj.ixsq.nii.ac.jp:00216135,
 author = {Hiroshi, Eto and Takehiro, Ito and Eiji, Miyano and Akira, Suzuki and Yuma, Tamura and Hiroshi, Eto and Takehiro, Ito and Eiji, Miyano and Akira, Suzuki and Yuma, Tamura},
 issue = {7},
 month = {Jan},
 note = {In this technical report, we investigate the complexity of the MAXIMUM HAPPY SET problem on subclasses of co-comparability graphs. For a graph G and its vertex subset S , a vertex v ∈ S is happy if all v's neighbors in G are contained in S . Given a graph G and a non-negative integer k, MAXIMUM HAPPY SET is the problem of finding a vertex subset S of G such that, In this technical report, we investigate the complexity of the MAXIMUM HAPPY SET problem on subclasses of co-comparability graphs. For a graph G and its vertex subset S , a vertex v ∈ S is happy if all v's neighbors in G are contained in S . Given a graph G and a non-negative integer k, MAXIMUM HAPPY SET is the problem of finding a vertex subset S of G such that},
 title = {Algorithms for Happy Set Problem on Interval Graphs and Permutation Graphs},
 year = {2022}
}