From post

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.

 

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

Partitioning Complete Bipartite Graphs by Monochromatic Cycles, .. J. Comb. Theory B, 69 (2): 210-218 (1997)Wide-Sense Nonblocking WDM Cross-Connects., , , и . ESA, том 2461 из Lecture Notes in Computer Science, стр. 538-549. Springer, (2002)Bounded size components--partitions and transversals., , и . J. Comb. Theory B, 88 (2): 281-297 (2003)Morphing Planar Graph Drawings with Unidirectional Moves., , и . CoRR, (2014)An Algorithmic Version of the Hypergraph Regularity Method., , и . FOCS, стр. 439-448. IEEE Computer Society, (2005)Morphing Schnyder Drawings of Planar Triangulations., , и . GD, том 8871 из Lecture Notes in Computer Science, стр. 294-305. Springer, (2014)Turán's Extremal Problem in Random Graphs: Forbidding Even Cycles., , и . J. Comb. Theory B, 64 (2): 273-287 (1995)Maximum acyclic and fragmented sets in regular graphs., , и . J. Graph Theory, 57 (2): 149-156 (2008)A fractional model of the border gateway protocol (BGP)., и . SODA, стр. 193-199. SIAM, (2008)Independent dominating sets and hamiltonian cycles., , и . J. Graph Theory, 54 (3): 233-244 (2007)