( en | de | ru )

 

Disambiguation of "Fertin, Guillaume"

Author of the publication

copydeleteadd this publication to your clipboard
Recognizing Recursive Circulant Graphs (Extended Abstract).

, and . Electron. Notes Discret. Math., (2000)

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. You can also use the button next to the name to display some publications already assigned to the person.

Guillaume Klein

Guillaume Jacques

Guillaume Weick

Guillaume Pierre

Guillaume Wendt

 

Other publications of authors with the same name

Finding Approximate and Constrained Motifs in Graphs., , and . CPM, volume 6661 of Lecture Notes in Computer Science, page 388-401. Springer, (2011)Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs., , and . MFCS, volume 3618 of Lecture Notes in Computer Science, page 328-339. Springer, (2005)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., , and . CPM, volume 105 of LIPIcs, page 17:1-17:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)DExTaR: Detection of exact tandem repeats based on the de Bruijn graph., , , and . BIBM, page 90-93. IEEE Computer Society, (2014)Finding a Small Number of Colourful Components., , , , , and . CPM, volume 128 of LIPIcs, page 20:1-20:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)The Maximum Zero-Sum Partition Problem., , , and . ICS, volume 1723 of Communications in Computer and Information Science, page 73-85. Springer, (2022)Algorithmic Aspects of the Maximum Colorful Arborescence Problem., , and . TAMC, volume 10185 of Lecture Notes in Computer Science, page 216-230. (2017)Graph Motif Problems Parameterized by Dual., and . CPM, volume 54 of LIPIcs, page 7:1-7:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Finding approximate and constrained motifs in graphs., , and . Theor. Comput. Sci., (2013)