( en | de | ru )

 

Disambiguation of "Stewart, Lorna"

Author of the publication

copydeleteadd this publication to your clipboard
A Linear Time Algorithm to Compute a Dominating Path in an AT-Free Graph.

, , and . Inf. Process. Lett., 54 (5): 253-257 (1995)

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.

Lorna Sopcak

Lorna Lines

Lorna Lück

Lorna Uden

Lorna McKnight

 

Other publications of authors with the same name

DP-Complete Problems Derived from Extremal NP-Complete Properties., , and . MFCS, volume 5734 of Lecture Notes in Computer Science, page 199-210. Springer, (2009)Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs., , and . ICALP, volume 944 of Lecture Notes in Computer Science, page 292-302. Springer, (1995)Approximating Bandwidth by Mixing Layouts of Interval Graphs., and . SIAM J. Discret. Math., 15 (4): 435-449 (2002)Complexity Results on Graphs with Few Cliques., and . Discret. Math. Theor. Comput. Sci., (2007)Games on interval and permutation graph representations., and . Theor. Comput. Sci., (2016)On Subfamilies of AT-Free Graphs., , , and . WG, volume 2204 of Lecture Notes in Computer Science, page 241-253. Springer, (2001)On polygon numbers of circle graphs and distance hereditary graphs., and . Discret. Appl. Math., (2018)A Linear Time Algorithm to Compute a Dominating Path in an AT-Free Graph., , and . Inf. Process. Lett., 54 (5): 253-257 (1995)The overlap number of a graph, and . CoRR, (2010)On polygon numbers of circle graphs and distance hereditary graphs., and . CoRR, (2014)