Guillaume Fertin

According to our database1, Guillaume Fertin authored at least 107 papers between 1998 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
The Maximum Colorful Arborescence problem: How (computationally) hard can it be?
Theor. Comput. Sci., 2021

Evaluation of open search methods based on theoretical mass spectra comparison.
BMC Bioinform., 2021

Sorting by Multi-Cut Rearrangements.
Algorithms, 2021

Improved Lower Bounds for the Cyclic Bandwidth Problem.
Proceedings of the Computational Science - ICCS 2021, 2021

2020
Graph Motif Problems Parameterized by Dual.
J. Graph Algorithms Appl., 2020

A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions.
Proceedings of the Algorithms for Computational Biology, 2020

2019
Super short operations on both gene order and intergenic sizes.
Algorithms Mol. Biol., 2019

Unshuffling Permutations: Trivial Bijections and Compositions.
Proceedings of the Theory and Applications of Models of Computation, 2019

Sorting by Reversals, Transpositions, and Indels on Both Gene Order and Intergenic Sizes.
Proceedings of the Bioinformatics Research and Applications - 15th International Symposium, 2019

Finding a Small Number of Colourful Components.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

Mass Spectra Interpretation and the Interest of SpecFit for Identifying Uncommon Modifications.
Proceedings of the Computational Intelligence Methods for Bioinformatics and Biostatistics, 2019

2018
Sorting permutations and binary strings by length-weighted rearrangements.
Theor. Comput. Sci., 2018

Editorial.
Theor. Comput. Sci., 2018

The S-labeling problem: An algorithmic tour.
Discret. Appl. Math., 2018

Optimal odd gossiping.
Discret. Appl. Math., 2018

Prefix and suffix reversals on strings.
Discret. Appl. Math., 2018

Matching algorithms for assigning orthologs after genome duplication events.
Comput. Biol. Chem., 2018

Sorting signed circular permutations by super short operations.
Algorithms Mol. Biol., 2018

Super Short Reversals on Both Gene Order and Intergenic Sizes.
Proceedings of the Advances in Bioinformatics and Computational Biology, 2018

On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

2017
Sorting permutations by prefix and suffix rearrangements.
J. Bioinform. Comput. Biol., 2017

Odd gossiping.
Discret. Appl. Math., 2017

The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph.
CoRR, 2017

Algorithms for computing the double cut and join distance on both gene order and intergenic sizes.
Algorithms Mol. Biol., 2017

Algorithmic Aspects of the Maximum Colorful Arborescence Problem.
Proceedings of the Theory and Applications of Models of Computation, 2017

Beyond Adjacency Maximization: Scaffold Filling for New String Distances.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016
(Prefix) reversal distance for (signed) strings with few blocks or small alphabets.
J. Discrete Algorithms, 2016

Genome rearrangements with indels in intergenes restrict the scenario space.
BMC Bioinform., 2016

Genome Rearrangements on Both Gene Order and Intergenic Regions.
Proceedings of the Algorithms in Bioinformatics - 16th International Workshop, 2016

SpecTrees: An Efficient Without a Priori Data Structure for MS/MS Spectra Identification.
Proceedings of the Algorithms in Bioinformatics - 16th International Workshop, 2016

Decomposing Cubic Graphs into Connected Subgraphs of Size Three.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015
Approximation algorithms for sorting by length-weighted prefix and suffix operations.
Theor. Comput. Sci., 2015

Towards an algorithmic guide to Spiral Galaxies.
Theor. Comput. Sci., 2015

Pancake Flipping is hard.
J. Comput. Syst. Sci., 2015

Some algorithmic results for [2]-sumset covers.
Inf. Process. Lett., 2015

Path-driven orientation of mixed graphs.
Discret. Appl. Math., 2015

Finding Supported Paths in Heterogeneous Networks.
Algorithms, 2015

Algorithmic Aspects of the S-Labeling Problem.
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

Obtaining a Triangular Matrix by Independent Row-Column Permutations.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014
Reversal Distances for Strings with Few Blocks or Small Alphabets.
Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

DExTaR: Detection of exact tandem repeats based on the de Bruijn graph.
Proceedings of the 2014 IEEE International Conference on Bioinformatics and Biomedicine, 2014

2013
Finding approximate and constrained motifs in graphs.
Theor. Comput. Sci., 2013

Revisiting the Minimum Breakpoint Linearization Problem.
Theor. Comput. Sci., 2013

Maximal strip recovery problem with gaps: Hardness and approximation algorithms.
J. Discrete Algorithms, 2013

A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications.
Proceedings of the Algorithms in Bioinformatics - 13th International Workshop, 2013

2012
Tractability and approximability of maximal strip recovery.
Theor. Comput. Sci., 2012

Sorting by Transpositions Is Difficult.
SIAM J. Discret. Math., 2012

Algorithms for Subnetwork Mining in Heterogeneous Networks.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

2011
Complexity issues in vertex-colored graph pattern matching.
J. Discrete Algorithms, 2011

Upper and lower bounds for finding connected motifs in vertex-colored graphs.
J. Comput. Syst. Sci., 2011

Algorithmic Aspects of Heterogeneous Biological Networks Comparison.
Proceedings of the Combinatorial Optimization and Applications, 2011

2010
Finding common structured patterns in linear graphs.
Theor. Comput. Sci., 2010

Proper Alignment of MS/MS Spectra from Unsequenced Species.
Proceedings of the International Conference on Bioinformatics & Computational Biology, 2010

2009
On the Approximability of Comparing Genomes with Duplicates.
J. Graph Algorithms Appl., 2009

Finding occurrences of protein complexes in protein-protein interaction graphs.
J. Discrete Algorithms, 2009

On the S-Labeling problem.
Electron. Notes Discret. Math., 2009

Comparison of Spectra in Unsequenced Species.
Proceedings of the Advances in Bioinformatics and Computational Biology, 2009

The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated.
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Pseudo Boolean Programming for Partially Ordered Genomes.
Proceedings of the Comparative Genomics, International Workshop, 2009

Maximum Motif Problem in Vertex-Colored Graphs.
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

On Finding Small 2-Generating Sets.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

Comparing Bacterial Genomes by Searching Their Common Intervals.
Proceedings of the Bioinformatics and Computational Biology, 2009

Combinatorics of Genome Rearrangements.
Computational molecular biology, MIT Press, ISBN: 978-0-262-06282-4, 2009

2008
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints.
J. Discrete Algorithms, 2008

Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between Two Genomes with Duplicate Genes.
J. Comput. Biol., 2008

Acyclic coloring of graphs of maximum degree five: Nine colors are enough.
Inf. Process. Lett., 2008

On the Approximability of Comparing Genomes with Duplicates.
Proceedings of the WALCOM: Algorithms and Computation, Second International Workshop, 2008

2007
Extracting constrained 2-interval subsets in 2-interval sets.
Theor. Comput. Sci., 2007

Exemplar Longest Common Subsequence.
IEEE ACM Trans. Comput. Biol. Bioinform., 2007

Comparing Genomes with Duplications: A Computational Complexity Point of View.
IEEE ACM Trans. Comput. Biol. Bioinform., 2007

A Pseudo-Boolean Framework for Computing Rearrangement Distances between Genomes with Duplicates.
J. Comput. Biol., 2007

L(p, q) labeling of d-dimensional grids.
Discret. Math., 2007

Comparing RNA Structures: Towards an Intermediate Model Between the Editand the LapcsProblems.
Proceedings of the Advances in Bioinformatics and Computational Biology, 2007

A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes.
Proceedings of the Comparative Genomics, RECOMB 2007 International Workshop, 2007

Weak pattern matching in colored graphs: Minimizing the number of connected components.
Proceedings of the Theoretical Computer Science, 10th Italian Conference, 2007

Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Extending the Hardness of RNA Secondary Structure Comparison.
Proceedings of the Combinatorics, 2007

Common Structured Patterns in Linear Graphs: Approximation and Combinatorics.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006
How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation.
Proceedings of the Comparative Genomics, 2006

Genomes Containing Duplicates Are Hard to Compare.
Proceedings of the Computational Science, 2006

Exemplar Longest Common Subsequence.
Proceedings of the Computational Science, 2006

2005
What Makes the Arc-Preserving Subsequence Problem Hard?
Trans. Comp. Sys. Biology, 2005

Edge-disjoint spanners in Cartesian products of graphs.
Discret. Math., 2005

Genes Order and Phylogenetic Reconstruction: Application to <i>gamma</i>-Proteobacteria.
Proceedings of the Comparative Genomics, 2005

Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2004
On maximal instances for the original syntenic distance.
Theor. Comput. Sci., 2004

Star coloring of graphs.
J. Graph Theory, 2004

A survey on Knödel graphs.
Discret. Appl. Math., 2004

No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes.
Proceedings of the Structural Information and Communication Complexity, 2004

New Results for the 2-Interval Pattern Problem.
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

2003
On the oriented chromatic number of grids.
Inf. Process. Lett., 2003

Acyclic and k-distance coloring of the grid.
Inf. Process. Lett., 2003

Factor <i>d</i>-domatic colorings of graphs.
Discret. Math., 2003

Vertex Labeling and Routing in Recursive Clique-Trees, a New Family of Small-World Scale-Free Graphs.
Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

2002
Minimum feedback vertex set and acyclic coloring.
Inf. Process. Lett., 2002

2001
Neighborhood Communications in Networks.
Electron. Notes Discret. Math., 2001

Routing permutations and 2-1 routing requests in the hypercube.
Discret. Appl. Math., 2001

k-Neighborhood Broadcasting.
Proceedings of the SIROCCO 8, 2001

2000
On the structure of minimum broadcast digraphs.
Theor. Comput. Sci., 2000

Compounding of gossip graphs.
Networks, 2000

Hierarchical broadcast and gossip networks.
Inf. Process. Lett., 2000

Recognizing Recursive Circulant Graphs (Extended Abstract).
Electron. Notes Discret. Math., 2000

A study of minimum gossip graphs.
Discret. Math., 2000

Diameter of the Knödel Graph.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

1999
Routing Permutations in the Hypercube.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

Trade-Offs for Add Gossiping.
Proceedings of the SIROCCO'99, 1999

1998
Families of Graphs Having Broadcasting and Gossiping Properties.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998


  Loading...