@article{oai:muroran-it.repo.nii.ac.jp:00010261,
 author = {髙岡, 旭 and TAKAOKA, Asahi and TAYU, Satoshi and 田湯, 智 and UENO, Shuichi and 上野, 修一},
 issue = {8},
 journal = {IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS},
 month = {},
 note = {application/pdf, A 2-directional orthogonal ray graph is an intersection graph of rightward rays (half-lines) and downward rays in the plane. We show a dynamic programming algorithm that solves the weighted dominating set problem in O(n(3)) time for 2-directional orthogonal ray graphs, where n is the number of vertices of a graph.},
 pages = {1592--1595},
 title = {Dominating Sets in Two-Directional Orthogonal Ray Graphs},
 volume = {E98D},
 year = {2015},
 yomi = {タカオカ, アサヒ and タユ, サトシ and ウエノ, シュウイチ}
}