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.

 

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

A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees., , и . WG, том 1517 из Lecture Notes in Computer Science, стр. 100-113. Springer, (1998)JMLNet: Joint Multi-Label Learning Network for Weakly Supervised Semantic Segmentation in Aerial Images., , , , , , и . Remote. Sens., 12 (19): 3169 (2020)Complexity of Reconfiguration Problems for Constraint Satisfaction., , и . CoRR, (2018)A Parallel Algorithm for Edge-Coloring Partial k-Trees., , и . SWAT, том 824 из Lecture Notes in Computer Science, стр. 359-369. Springer, (1994)Total Colorings of Degenerated Graphs., , и . ICALP, том 2076 из Lecture Notes in Computer Science, стр. 506-517. Springer, (2001)Finding Edge-Disjoint Paths in Partial k-Trees., , и . Algorithmica, 26 (1): 3-30 (2000)An Intra-Drift-Free Robust Watermarking Algorithm in High Efficiency Video Coding Compressed Domain., , и . IEEE Access, (2019)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)Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size., , и . WG, том 3353 из Lecture Notes in Computer Science, стр. 365-376. Springer, (2004)