@article{Piliposyan_2021, title={A Note on Maximum Weight Independent Set in Outer-rectangle Graph}, volume={36}, url={http://mpcs.sci.am/index.php/mpcs/article/view/265}, abstractNote={<p>An outer-rectangle graph is the intersection graph of rectangles lying inside a rectangular box and having exactly one edge on the boundary of the box. We present a polynomial-time algorithm for the problem of computing a maximum weight independent set in 2-side outer-rectangle graphs where any two rectangles lying on same edge of box do not intersect.</p>}, journal={Mathematical Problems of Computer Science}, author={Piliposyan, Eduard T.}, year={2021}, month={Dec.}, pages={51–56} }