Documentation
Français (FR)

Anglais (EN)

Guillaume Fertin

23

Documents

Affiliations actuelles

481374
1088564

Identifiants chercheurs

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

Contact

Publications

laurent-bulteau

	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
	Sorting by Multi-Cut Rearrangements Laurent Bulteau , Guillaume Fertin , Géraldine Jean , Christian Komusiewicz Algorithms, 2021, 14 (6), pp.169. ⟨10.3390/a14060169⟩ Article dans une revue hal-03388451v1
	Sorting Signed Permutations by Intergenic Reversals Andre Rodrigues Oliveira , Géraldine Jean , Guillaume Fertin , Klairton Lima Brito , Laurent Bulteau IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2020, ⟨10.1109/TCBB.2020.2993002⟩ Article dans une revue hal-02901617v1
	Genome rearrangements with indels in intergenes restrict the scenario space Laurent Bulteau , Guillaume Fertin , Eric Tannier BMC Bioinformatics, 2016, 17 (Suppl 14), 426 (7 p.). ⟨10.1186/s12859-016-1264-6⟩ Article dans une revue hal-01396842v1
	(Prefix) reversal distance for (signed) strings with few blocks or small alphabets Laurent Bulteau , Guillaume Fertin , Christian Komusiewicz Journal of Discrete Algorithms, 2016, 37, pp.44-55. ⟨10.1016/j.jda.2016.05.002⟩ Article dans une revue hal-01318663v1
	Pancake Flipping Is Hard Laurent Bulteau , Guillaume Fertin , Irena Rusu Journal of Computer and System Sciences, 2015, 81 (8), pp.1556-1574. ⟨10.1016/j.jcss.2015.02.003⟩ Article dans une revue hal-01053461v1
	Some algorithmic results for [2]-sumset covers Laurent Bulteau , Guillaume Fertin , Stéphane Vialette , Roméo Rizzi Information Processing Letters, 2015, 115 (1), pp.1-5 Article dans une revue hal-01044891v1
	Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms Laurent Bulteau , Guillaume Fertin , Irena Rusu Journal of Discrete Algorithms, 2013, 19, pp.1-22 Article dans une revue hal-00826876v1
	Revisiting the Minimum Breakpoint Linearization Problem Theoretical Computer Science Laurent Bulteau , Guillaume Fertin , Irena Rusu Theoretical Computer Science, 2013, 494, pp.122-133 Article dans une revue hal-00826880v1
	Tractability and approximability of maximal strip recovery Laurent Bulteau , Guillaume Fertin , Minghui Jiang , Irena Rusu Theoretical Computer Science, 2012, 440-441, pp.14-28. ⟨10.1016/j.tcs.2012.04.034⟩ Article dans une revue hal-00700598v1
	Sorting by Transpositions is Difficult Laurent Bulteau , Guillaume Fertin , Irena Rusu SIAM Journal on Discrete Mathematics, 2012, 26 (3), pp.1148-1180. ⟨10.1137/110851390⟩ Article dans une revue hal-00826867v1

	Sorting by Multi-cut Rearrangements Laurent Bulteau , Guillaume Fertin , Géraldine Jean , Christian Komusiewicz SOFSEM 2021, Jan 2021, Bolzano-Bozen, Italy. pp.593-607, ⟨10.1007/978-3-030-67731-2_43⟩ Communication dans un congrès hal-03346830v1
	Finding a Small Number of Colourful Components Laurent Bulteau , Konrad K. Dabrowski , Guillaume Fertin , Matthew Johnson , Daniël Paulusma CPM 2019, Jul 2019, Pise, Italy. ⟨10.4230/LIPIcs.CPM.2019.20⟩ Communication dans un congrès hal-02304030v1
	Beyond Adjacency Maximization: Scaffold Filling for New String Distances Laurent Bulteau , Guillaume Fertin , Christian J Komusiewicz 28th Annual Symposium on Combinatorial Pattern Matching, 2017, Warsaw, Poland. ⟨10.4230/LIPIcs.CPM.2017.27⟩ Communication dans un congrès hal-01615671v1
	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
	Reversal Distances for Strings with Few Blocks or Small Alphabets Laurent Bulteau , Guillaume Fertin , Christian Komusiewicz 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), Jun 2014, Moscou, Russia. pp.50-59, ⟨10.1007/978-3-319-07566-2_6⟩ Communication dans un congrès hal-01044938v1
	A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications Laurent Bulteau , Guillaume Fertin , Christian Komusiewicz , Irena Rusu 13th Workshop on Algorithms in Bioinformatics (WABI2013), Sep 2013, Nice, France. pp.244-258, ⟨10.1007/978-3-642-40453-5_19⟩ Communication dans un congrès hal-00906903v1
	Pancake Flipping is Hard Laurent Bulteau , Guillaume Fertin , Irena Rusu 37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012), Aug 2012, Bratislava, Slovakia. pp.247-258 Communication dans un congrès hal-00717712v1
	Sorting by Transpositions is Difficult Laurent Bulteau , Guillaume Fertin , Irena Rusu 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), 2011, Zürich, Switzerland. pp.654-665 Communication dans un congrès hal-00606223v1
	Tractability and Approximability of Maximal Strip Recovery Laurent Bulteau , Guillaume Fertin , Minghui Jiang , Irena Rusu 22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011), 2011, Palermo, Italy. pp.336-349 Communication dans un congrès hal-00606167v1
	Revisiting the Minimum Breakpoint Linearization Problem Laurent Bulteau , Guillaume Fertin , Irena Rusu 7th Annual Conference on Theory and Applications of Models of Computation (TAMC 2010), Jun 2010, Prague, France. pp.163-174 Communication dans un congrès hal-00482856v1
	Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms Laurent Bulteau , Guillaume Fertin , Irena Rusu ISAAC 2009 (20th International Symposium on Algorithms and Computation), 2009, Hawaii, United States. pp.710-719 Communication dans un congrès hal-00425145v1

	Finding a Small Number of Colourful Components Laurent Bulteau , Konrad K. Dabrowski , Guillaume Fertin , Matthew Johnson , Daniel Paulusma 2019 Pré-publication, Document de travail hal-01986725v1