Author of the publication

Finding a minimum independent dominating set in a permutation graph.

, , and . Discret. Appl. Math., 21 (3): 177-183 (1988)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Short-term and long-term linkages among the Colombian capital market indexes, , and . International Review of Financial Analysis, 10 (3): 237--273 (00 2001)Routing with Guaranteed Delivery in Ad Hoc Wireless Networks, , , and . Wireless Networks, 7 (6): 609--616 (November 2001)Circular permutation graphs., and . Networks, 12 (4): 429-437 (1982)Separating Collections of Points in Euclidean Spaces., and . Inf. Process. Lett., 53 (4): 177-183 (1995)Corrigendum: Inf. Process. Lett. 54(6): 359 (1995).Corrigendum: Separating Collections of Points in Euclidean Spaces., and . Inf. Process. Lett., 54 (6): 359 (1995)see: Inf. Process. Lett. 53(4): 177-183(1995).Art Gallery and Illumination Problems.. Handbook of Computational Geometry, North Holland / Elsevier, (2000)Flat 2-Foldings of Convex Polygons., , , and . IJCCGGT, volume 3330 of Lecture Notes in Computer Science, page 14-24. Springer, (2003)On a Triangle with the Maximum Area in a Planar Point Set., , , and . IJCCGGT, volume 3330 of Lecture Notes in Computer Science, page 102-107. Springer, (2003)On the Packet Complexity of Distributed Selection., , and . WDAG, volume 312 of Lecture Notes in Computer Science, page 108-115. Springer, (1987)Hamiltonian Tetrahedralizations with Steiner Points, , and . CoRR, (2012)