( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Finding odd cycle transversals.

, , и . Oper. Res. Lett., 32 (4): 299-301 (2004)

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.

Nicholas Reed

Wallace Kwesi Bruce-Tamakloe

Cecil Bruce-Boye

Philippa Reed

Kate Reed

 

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

An Improved Algorithm for Finding Tree Decompositions of Small Width., и . WG, том 1665 из Lecture Notes in Computer Science, стр. 148-154. Springer, (1999)Non-Interfering Network Flows., , , и . SWAT, том 621 из Lecture Notes in Computer Science, стр. 245-257. Springer, (1992)Approximate Min-max Relations for Odd Cycles in Planar Graphs., , , и . IPCO, том 3509 из Lecture Notes in Computer Science, стр. 35-50. Springer, (2005)Connectivity Preserving Iterative Compaction and Finding 2 Disjoint Rooted Paths in Linear Time., , и . CoRR, (2015)Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width., , и . J. Algorithms, 48 (2): 333-359 (2003)Odd cycle packing., и . STOC, стр. 695-704. ACM, (2010)Hadwiger's conjecture is decidable., и . STOC, стр. 445-454. ACM, (2009)Covering the Edges of a Random Graph by Cliques., и . Combinatorica, 15 (4): 489-497 (1995)Linear Arboricity of Random Regular Graphs., и . Random Struct. Algorithms, 1 (4): 443-447 (1990)Approximately covering by cycles in planar graphs., и . SODA, стр. 402-406. ACM/SIAM, (2001)