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.

 

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

On the structure of minimum broadcast digraphs.. Theor. Comput. Sci., 245 (2): 203-216 (2000)On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure., , и . CPM, том 105 из LIPIcs, стр. 17:1-17:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Finding Approximate and Constrained Motifs in Graphs., , и . CPM, том 6661 из Lecture Notes in Computer Science, стр. 388-401. Springer, (2011)Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs., , и . MFCS, том 3618 из Lecture Notes in Computer Science, стр. 328-339. Springer, (2005)DExTaR: Detection of exact tandem repeats based on the de Bruijn graph., , , и . BIBM, стр. 90-93. IEEE Computer Society, (2014)Finding a Small Number of Colourful Components., , , , , и . CPM, том 128 из LIPIcs, стр. 20:1-20:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Approximating Rearrangement Distances with Replicas and Flexible Intergenic Regions., , , , , и . ISBRA, том 14248 из Lecture Notes in Computer Science, стр. 241-254. Springer, (2023)Graph Motif Problems Parameterized by Dual., и . CPM, том 54 из LIPIcs, стр. 7:1-7:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Algorithmic Aspects of the Maximum Colorful Arborescence Problem., , и . TAMC, том 10185 из Lecture Notes in Computer Science, стр. 216-230. (2017)The Maximum Zero-Sum Partition Problem., , , и . ICS, том 1723 из Communications in Computer and Information Science, стр. 73-85. Springer, (2022)