From post

Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs.

, , и . WALCOM, том 9627 из Lecture Notes in Computer Science, стр. 313-324. Springer, (2016)

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.

 

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

Graph Coloring with Distance Constraints., , и . PDPTA, стр. 131-140. CSREA Press, (2005)Parallel Algorithms for Dandelion-Like Codes., и . ICCS (1), том 5544 из Lecture Notes in Computer Science, стр. 611-620. Springer, (2009)On the Radiocoloring Problem., и . IWDC, том 2571 из Lecture Notes in Computer Science, стр. 118-127. Springer, (2002)Hierarchical Clustering of Trees: Algorithms and Experiments., и . ALENEX, том 2153 из Lecture Notes in Computer Science, стр. 117-131. Springer, (2001)Tree partitioning via vertex deletion., и . Electron. Notes Discret. Math., (2001)On Relaxing the Constraints in Pairwise Compatibility Graphs., , и . WALCOM, том 7157 из Lecture Notes in Computer Science, стр. 124-135. Springer, (2012)Divider-based algorithms for hierarchical tree partitioning., и . Discret. Appl. Math., 136 (2-3): 227-247 (2004)On pairwise compatibility graphs having Dilworth number two., и . Theor. Comput. Sci., (2014)Informative Labeling Schemes for the Least Common Ancestor Problem., , и . ICTCS, стр. 66-70. (2009)Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors., , и . ESA, том 5193 из Lecture Notes in Computer Science, стр. 234-245. Springer, (2008)