Documentation
Français (FR)

Anglais (EN)

Guillaume Fertin

11

Documents

Affiliations actuelles

481374
1088564

Identifiants chercheurs

guillaume-fertin
0000-0002-8251-2012
IdRef : 095050612

Contact

Publications

761704

	Decomposing Subcubic Graphs into Claws, Paths or Triangles Laurent Bulteau , Guillaume Fertin , Anthony Labarre , Romeo Rizzi , Irena Rusu Journal of Graph Theory, 2021, 98 (4), pp.557-588. ⟨10.1002/jgt.22713⟩ Article dans une revue hal-03388424v1
	Finding Common Structured Patterns in Linear Graphs Guillaume Fertin , Danny Hermelin , Romeo Rizzi , Stéphane Vialette Theoretical Computer Science, 2010, 411 (26-28), pp.2475-2486. ⟨10.1016/j.tcs.2010.02.017⟩ Article dans une revue hal-00482850v1
	Finding Occurrences of Protein Complexes in Protein-Protein Interaction Graphs Guillaume Fertin , Romeo Rizzi , Stéphane Vialette Journal of Discrete Algorithms, 2009, 7 (1), pp.90-101 Article dans une revue hal-00416394v1
	Comparing Genomes with Duplications: a Computational Complexity Point of View Guillaume Blin , Cedric Chauve , Guillaume Fertin , Romeo Rizzi , Stéphane Vialette ACM Transactions on Computational Logic, 2007, 4 (4), pp.523-534. ⟨10.1109/TCBB.2007.1069⟩ Article dans une revue hal-00417720v1
	What makes the Arc-Preserving Subsequence problem hard ? Guillaume Blin , Guillaume Fertin , Romeo Rizzi , Stéphane Vialette LNCS Transactions on Computational Systems Biology, 2005, 2, pp.1-36 Article dans une revue hal-00417738v1

	Decomposing Cubic Graphs into Connected Subgraphs of Size Three Laurent Bulteau , Guillaume Fertin , Anthony Labarre , Romeo Rizzi , Irena Rusu The 22nd International Computing and Combinatorics Conference (COCOON), Aug 2016, Ho Chi Minh City, Vietnam. ⟨10.1007/978-3-319-42634-1_32⟩ Communication dans un congrès hal-01309152v1
	Common Structured Patterns in Linear Graphs: Approximations and Combinatorics Guillaume Fertin , Danny Hermelin , Romeo Rizzi , Stéphane Vialette 18th Annual Symposium on Combinatorial Pattern Matching (CPM 2007), 2007, London, Canada. pp.214-252 Communication dans un congrès hal-00418241v1
	Genomes containing duplicates are hard to compare Cedric Chauve , Guillaume Fertin , Romeo Rizzi , Stéphane Vialette Proc Int. Workshop on Bioinformatics Research and Applications (IWBRA), 2006, Reading, UK, United Kingdom. pp.783-790 Communication dans un congrès hal-00620297v1
	Genomes containing Duplicates are Hard to compare Cedric Chauve , Guillaume Fertin , Romeo Rizzi , Stéphane Vialette International Workshop on Bioinformatics Research and Applications (IWBRA 2006), 2006, Reading, United Kingdom. pp.783-790 Communication dans un congrès hal-00418260v1
	What Makes the Arc-Preserving Subsequence Problem Hard? Guillaume Blin , Guillaume Fertin , Romeo Rizzi , Stéphane Vialette 5th Int. Workshop on Bioinformatics Research and Applications (IWBRA'05), May 2005, Atlanta, GA, USA, United States. pp.860-868 Communication dans un congrès hal-00620359v1
	Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs Guillaume Fertin , Romeo Rizzi , Stéphane Vialette 30th International Symposium on Mathematical Foundations of Computer Science (MFCS'05), 2005, Gdansk, Poland, Poland. pp.328-339 Communication dans un congrès hal-00620292v1