Guillaume Fertin
2
Documents
Affiliations actuelles
- 481374
- 1088564
Identifiants chercheurs
guillaume-fertin-
0000-0002-8251-2012
- IdRef : 095050612
Publications
- 2
- 2
- 1
- 1
- 1
- 1
- 1
|
|
Upper and lower bounds for finding connected motifs in vertex-colored graphsJournal of Computer and System Sciences, 2011, 77 (4), pp.799-811. ⟨10.1016/j.jcss.2010.07.003⟩
Article dans une revue
hal-00606148v1
|
|
|
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs34th International Colloquium on Automata, Languages and Programming (ICALP 2007), 2007, Wroclaw, Poland. pp.340-351
Communication dans un congrès
hal-00417928v1
|