| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Laurent Bulteau, Guillaume Fertin, Irena Rusu |
Pancake Flipping is Hard  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette |
Upper and lower bounds for finding connected motifs in vertex-colored graphs. |
J. Comput. Syst. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Riccardo Dondi, Guillaume Fertin, Stéphane Vialette |
Complexity issues in vertex-colored graph pattern matching. |
J. Discrete Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Bulteau, Guillaume Fertin, Irena Rusu |
Sorting by Transpositions Is Difficult. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Riccardo Dondi, Guillaume Fertin, Stéphane Vialette |
Finding Approximate and Constrained Motifs in Graphs. |
CPM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu |
Tractability and Approximability of Maximal Strip Recovery. |
CPM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu, Florian Sikora, Stéphane Vialette |
Algorithmic Aspects of Heterogeneous Biological Networks Comparison. |
COCOA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette |
Finding common structured patterns in linear graphs. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Bulteau, Guillaume Fertin, Irena Rusu |
Sorting by Transpositions is Difficult |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Laurent Bulteau, Guillaume Fertin, Irena Rusu |
Revisiting the Minimum Breakpoint Linearization Problem. |
TAMC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Freddy Cliquet, Guillaume Fertin, Irena Rusu, Dominique Tessier |
Proper Alignment of MS/MS Spectra from Unsequenced Species. |
BIOCOMP |
2010 |
DBLP BibTeX RDF |
|
| 1 | Guillaume Fertin, Stéphane Vialette |
On the S-Labeling problem. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette |
On the Approximability of Comparing Genomes with Duplicates. |
J. Graph Algorithms Appl. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Guillaume Fertin, Romeo Rizzi, Stéphane Vialette |
Finding occurrences of protein complexes in protein-protein interaction graphs. |
J. Discrete Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Blin, Guillaume Fertin, Florian Sikora, Stéphane Vialette |
The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Riccardo Dondi, Guillaume Fertin, Stéphane Vialette |
Maximum Motif Problem in Vertex-Colored Graphs. |
CPM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Freddy Cliquet, Guillaume Fertin, Irena Rusu, Dominique Tessier |
Comparison of Spectra in Unsequenced Species. |
BSB |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Isabelle Fagnot, Guillaume Fertin, Stéphane Vialette |
On Finding Small 2-Generating Sets. |
COCOON |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sébastien Angibaud, Damien Eveillard, Guillaume Fertin, Irena Rusu |
Comparing Bacterial Genomes by Searching Their Common Intervals. |
BICoB |
2009 |
DBLP DOI BibTeX RDF |
circular genome, comparative genomic, common interval |
| 1 | Sébastien Angibaud, Guillaume Fertin, Annelyse Thévenin, Stéphane Vialette |
Pseudo Boolean Programming for Partially Ordered Genomes. |
RECOMB-CG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Bulteau, Guillaume Fertin, Irena Rusu |
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
comparative maps, genome comparison, synteny blocks, approximation algorithms, algorithmic complexity |
| 1 | Guillaume Fertin, André Raspaud |
Acyclic coloring of graphs of maximum degree five: Nine colors are enough. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette |
Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between Two Genomes with Duplicate Genes. |
Journal of Computational Biology |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette |
On the Approximability of Comparing Genomes with Duplicates |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette |
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. |
J. Discrete Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sébastien Angibaud, Guillaume Fertin, Irena Rusu |
On the Approximability of Comparing Genomes with Duplicates. |
WALCOM |
2008 |
DBLP DOI BibTeX RDF |
conserved intervals, genome rearrangement, duplicates, breakpoints, adjacencies, common intervals, APX-Hardness |
| 1 | Guillaume Blin, Guillaume Fertin, Stéphane Vialette |
Extracting constrained 2-interval subsets in 2-interval sets. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Fertin, André Raspaud |
L(p, q) labeling of d-dimensional grids. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette |
A Pseudo-Boolean Framework for Computing Rearrangement Distances between Genomes with Duplicates. |
Journal of Computational Biology |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Blin, Cedric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette |
Comparing Genomes with Duplications: A Computational Complexity Point of View. |
IEEE/ACM Trans. Comput. Biology Bioinform. |
2007 |
DBLP DOI BibTeX RDF |
maximum adjacency disruption number, summed adjacency disruption number, computational complexity, Comparative genomics, common intervals |
| 1 | Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Raffaella Rizzi, Stéphane Vialette |
Exemplar Longest Common Subsequence. |
IEEE/ACM Trans. Comput. Biology Bioinform. |
2007 |
DBLP DOI BibTeX RDF |
combinatorial algorithms, comparative genomics, Longest common subsequence, algorithm design and analysis, analysis of algorithms and problem complexity |
| 1 | Riccardo Dondi, Guillaume Fertin, Stéphane Vialette |
Weak pattern matching in colored graphs: Minimizing the number of connected components. |
ICTCS |
2007 |
DBLP BibTeX RDF |
|
| 1 | Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette |
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. |
ICALP |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette |
Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. |
CPM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Blin, Guillaume Fertin, Gaël Herry, Stéphane Vialette |
Comparing RNA Structures: Towards an Intermediate Model Between the Editand the LapcsProblems. |
BSB |
2007 |
DBLP DOI BibTeX RDF |
arc-annotated sequences, motif extraction, RNA structures |
| 1 | Guillaume Blin, Guillaume Fertin, Irena Rusu, Christine Sinoquet |
Extending the Hardness of RNA Secondary Structure Comparison. |
ESCAPE |
2007 |
DBLP DOI BibTeX RDF |
arc-annotated sequences, NP-hardness, computational biology, edit distance, RNA structures |
| 1 | Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette |
A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes. |
RECOMB-CG |
2007 |
DBLP DOI BibTeX RDF |
breakpoint distance, heuristic, genome rearrangement, duplication, pseudo-boolean programming |
| 1 | Cedric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette |
Genomes Containing Duplicates Are Hard to Compare. |
International Conference on Computational Science |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Stéphane Vialette |
Exemplar Longest Common Subsequence. |
International Conference on Computational Science |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette |
How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation. |
Comparative Genomics |
2006 |
DBLP DOI BibTeX RDF |
heuristic, genome rearrangement, duplication, common intervals, pseudo-boolean programming |
| 1 | Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho |
Edge-disjoint spanners in Cartesian products of graphs. |
Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette |
What Makes the Arc-Preserving Subsequence Problem Hard? |
T. Comp. Sys. Biology |
2005 |
DBLP DOI BibTeX RDF |
Arc-Preserving Subsequence problem, Computational complexity, RNA structures |
| 1 | Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette |
Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints. |
WG |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette |
What Makes the Arc-Preserving Subsequence Problem Hard? |
International Conference on Computational Science |
2005 |
DBLP DOI BibTeX RDF |
Arc-Preserving Subsequence, Computational complexity, RNA structures |
| 1 | Guillaume Fertin, Romeo Rizzi, Stéphane Vialette |
Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Blin, Cedric Chauve, Guillaume Fertin |
Genes Order and Phylogenetic Reconstruction: Application to gamma-Proteobacteria. |
Comparative Genomics |
2005 |
DBLP DOI BibTeX RDF |
conserved intervals, ?-Proteobacteria, gene families, breakpoints, common intervals, Phylogenetic reconstruction |
| 1 | Cedric Chauve, Guillaume Fertin |
On maximal instances for the original syntenic distance. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Fertin, André Raspaud, Bruce A. Reed |
Star coloring of graphs. |
Journal of Graph Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Fertin, André Raspaud |
A survey on Knödel graphs. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Fertin, André Raspaud, Ondrej Sýkora |
No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes. |
SIROCCO |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Blin, Guillaume Fertin, Stéphane Vialette |
New Results for the 2-Interval Pattern Problem. |
CPM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Fertin, André Raspaud, Arup Roychowdhury |
On the oriented chromatic number of grids. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Fertin, Emmanuel Godard, André Raspaud |
Acyclic and k-distance coloring of the grid. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho |
Factor d-domatic colorings of graphs. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Francesc Comellas, Guillaume Fertin, André Raspaud |
Vertex Labeling and Routing in Recursive Clique-Trees, a New Family of Small-World Scale-Free Graphs. |
SIROCCO |
2003 |
DBLP BibTeX RDF |
|
| 1 | Guillaume Fertin, Emmanuel Godard, André Raspaud |
Minimum feedback vertex set and acyclic coloring. |
Inf. Process. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Fertin, André Raspaud |
Neighborhood Communications in Networks. |
Electronic Notes in Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Baudon, Guillaume Fertin, Ivan Havel |
Routing permutations and 2-1 routing requests in the hypercube. |
Discrete Applied Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Fertin, André Raspaud, Bruce A. Reed |
On Star Coloring of Graphs. |
WG |
2001 |
DBLP DOI BibTeX RDF |
proper coloring, star coloring, acyclic coloring, graphs, treewidth, vertex coloring |
| 1 | Guillaume Fertin, André Raspaud |
k-Neighborhood Broadcasting. |
SIROCCO |
2001 |
DBLP BibTeX RDF |
|
| 1 | Guillaume Fertin, André Raspaud |
Recognizing Recursive Circulant Graphs (Extended Abstract). |
Electronic Notes in Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Fertin |
Hierarchical broadcast and gossip networks. |
Inf. Process. Lett. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Fertin |
On the structure of minimum broadcast digraphs. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Fertin |
A study of minimum gossip graphs. |
Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Fertin, Roger Labahn |
Compounding of gossip graphs. |
Networks |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Fertin, André Raspaud, Heiko Schröder, Ondrej Sýkora, Imrich Vrto |
Diameter of the Knödel Graph. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Baudon, Guillaume Fertin, Ivan Havel |
Routing Permutations in the Hypercube. |
WG |
1999 |
DBLP DOI BibTeX RDF |
routing permutations, Szymanski's conjecture, 2-1 routing requests, Hypercubes |
| 1 | Guillaume Fertin |
Trade-Offs for Add Gossiping. |
SIROCCO |
1999 |
DBLP BibTeX RDF |
|
| 1 | Guillaume Fertin, André Raspaud |
Families of Graphs Having Broadcasting and Gossiping Properties. |
WG |
1998 |
DBLP DOI BibTeX RDF |
minimum broadcast graphs, minimum gossip graphs, Knödel graphs, Broadcasting, hypercubes, gossiping, circulant graphs |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")