( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Complexity of List H-Packing for Sparse Graph Classes.

, , , , , , , и . WALCOM, том 14549 из Lecture Notes in Computer Science, стр. 421-435. Springer, (2024)

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.

Xiao Zhou

Xiao-Yan Zhou

Xiao-Zhou Yao

Zhou Zhou

Zhou Zhou

 

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

Adaptive Feature Point Image Registration Algorithm with Added Spatial Constraint Model., , , , , и . J. ICT Stand., 11 (2): 157-174 (2023)A Flexible-Channel MDF Architecture for Pipelined Radix-2 FFT., , , и . IEEE Access, (2023)Tour Route Recommendation Model by the Improved Symmetry-Based Naive Bayes Mining and Spatial Decision Forest Search., , , и . Symmetry, 15 (12): 2168 (декабря 2023)Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs., и . ISAAC, том 2223 из Lecture Notes in Computer Science, стр. 514-524. Springer, (2001)A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees., , и . WG, том 1517 из Lecture Notes in Computer Science, стр. 100-113. Springer, (1998)Total Colorings of Degenerated Graphs., , и . ICALP, том 2076 из Lecture Notes in Computer Science, стр. 506-517. Springer, (2001)A Parallel Algorithm for Edge-Coloring Partial k-Trees., , и . SWAT, том 824 из Lecture Notes in Computer Science, стр. 359-369. Springer, (1994)Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size., , и . WG, том 3353 из Lecture Notes in Computer Science, стр. 365-376. Springer, (2004)List Total Colorings of Series-Parallel Graphs., , и . COCOON, том 2697 из Lecture Notes in Computer Science, стр. 172-181. Springer, (2003)Algorithms for Finding Distance-Edge-Colorings of Graphs., , , и . COCOON, том 3595 из Lecture Notes in Computer Science, стр. 798-807. Springer, (2005)