( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
DP-Complete Problems Derived from Extremal NP-Complete Properties.

, , и . MFCS, том 5734 из Lecture Notes in Computer Science, стр. 199-210. Springer, (2009)

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.

Lorna Sopcak

Lorna Lines

Lorna Lück

Lorna Uden

Lorna McKnight

 

Другие публикации лиц с тем же именем

Approximating Bandwidth by Mixing Layouts of Interval Graphs., и . SIAM J. Discret. Math., 15 (4): 435-449 (2002)DP-Complete Problems Derived from Extremal NP-Complete Properties., , и . MFCS, том 5734 из Lecture Notes in Computer Science, стр. 199-210. Springer, (2009)Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs., , и . ICALP, том 944 из Lecture Notes in Computer Science, стр. 292-302. Springer, (1995)On Subfamilies of AT-Free Graphs., , , и . WG, том 2204 из Lecture Notes in Computer Science, стр. 241-253. Springer, (2001)LBFS Orderings and Cocomparability Graphs., , и . SODA, стр. 883-884. ACM/SIAM, (1999)The Mycielskian of a Graph., и . Formalized Mathematics, 19 (1): 27-34 (2011)Asteroidal Triple-Free Graphs., , и . WG, том 790 из Lecture Notes in Computer Science, стр. 211-224. Springer, (1993)Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear Time., , и . WADS, том 955 из Lecture Notes in Computer Science, стр. 358-368. Springer, (1995)The Ultimate Interval Graph Recognition Algorithm? (Extended Abstract)., , и . SODA, стр. 175-180. ACM/SIAM, (1998)Domination on Cocomparability Graphs., и . SIAM J. Discret. Math., 6 (3): 400-417 (1993)