2009 |
50 | EE | Sébastien Angibaud,
Damien Eveillard,
Guillaume Fertin,
Irena Rusu:
Comparing Bacterial Genomes by Searching Their Common Intervals.
BICoB 2009: 102-113 |
49 | EE | Guillaume Blin,
Guillaume Fertin,
Florian Sikora,
Stéphane Vialette:
The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated.
WALCOM 2009: 357-368 |
2008 |
48 | EE | Sébastien Angibaud,
Guillaume Fertin,
Irena Rusu:
On the Approximability of Comparing Genomes with Duplicates.
WALCOM 2008: 34-45 |
47 | EE | Sébastien Angibaud,
Guillaume Fertin,
Irena Rusu,
Annelyse Thévenin,
Stéphane Vialette:
On the Approximability of Comparing Genomes with Duplicates
CoRR abs/0806.1103: (2008) |
46 | EE | Guillaume Fertin,
André Raspaud:
Acyclic coloring of graphs of maximum degree five: Nine colors are enough.
Inf. Process. Lett. 105(2): 65-72 (2008) |
45 | EE | Guillaume Blin,
Guillaume Fertin,
Danny Hermelin,
Stéphane Vialette:
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints.
J. Discrete Algorithms 6(4): 618-626 (2008) |
44 | EE | 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 15(8): 1093-1115 (2008) |
2007 |
43 | EE | Guillaume Blin,
Guillaume Fertin,
Gaël Herry,
Stéphane Vialette:
Comparing RNA Structures: Towards an Intermediate Model Between the Editand the LapcsProblems.
BSB 2007: 101-112 |
42 | EE | Guillaume Fertin,
Danny Hermelin,
Romeo Rizzi,
Stéphane Vialette:
Common Structured Patterns in Linear Graphs: Approximation and Combinatorics.
CPM 2007: 241-252 |
41 | EE | Guillaume Blin,
Guillaume Fertin,
Irena Rusu,
Christine Sinoquet:
Extending the Hardness of RNA Secondary Structure Comparison.
ESCAPE 2007: 140-151 |
40 | EE | Michael R. Fellows,
Guillaume Fertin,
Danny Hermelin,
Stéphane Vialette:
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs.
ICALP 2007: 340-351 |
39 | | Riccardo Dondi,
Guillaume Fertin,
Stéphane Vialette:
Weak pattern matching in colored graphs: Minimizing the number of connected components.
ICTCS 2007: 27-38 |
38 | EE | 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: 16-29 |
37 | EE | Guillaume Fertin,
André Raspaud:
L(p, q) labeling of d-dimensional grids.
Discrete Mathematics 307(16): 2132-2140 (2007) |
36 | EE | 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. 4(4): 523-534 (2007) |
35 | EE | Paola Bonizzoni,
Gianluca Della Vedova,
Riccardo Dondi,
Guillaume Fertin,
Raffaella Rizzi,
Stéphane Vialette:
Exemplar Longest Common Subsequence.
IEEE/ACM Trans. Comput. Biology Bioinform. 4(4): 535-543 (2007) |
34 | EE | 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 14(4): 379-393 (2007) |
33 | EE | Guillaume Blin,
Guillaume Fertin,
Stéphane Vialette:
Extracting constrained 2-interval subsets in 2-interval sets.
Theor. Comput. Sci. 385(1-3): 241-263 (2007) |
2006 |
32 | EE | Sébastien Angibaud,
Guillaume Fertin,
Irena Rusu,
Stéphane Vialette:
How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation.
Comparative Genomics 2006: 75-86 |
31 | EE | Paola Bonizzoni,
Gianluca Della Vedova,
Riccardo Dondi,
Guillaume Fertin,
Stéphane Vialette:
Exemplar Longest Common Subsequence.
International Conference on Computational Science (2) 2006: 622-629 |
30 | EE | Cedric Chauve,
Guillaume Fertin,
Romeo Rizzi,
Stéphane Vialette:
Genomes Containing Duplicates Are Hard to Compare.
International Conference on Computational Science (2) 2006: 783-790 |
2005 |
29 | EE | Guillaume Blin,
Cedric Chauve,
Guillaume Fertin:
Genes Order and Phylogenetic Reconstruction: Application to gamma-Proteobacteria.
Comparative Genomics 2005: 11-20 |
28 | EE | Guillaume Blin,
Guillaume Fertin,
Romeo Rizzi,
Stéphane Vialette:
What Makes the Arc-Preserving Subsequence Problem Hard?
International Conference on Computational Science (2) 2005: 860-868 |
27 | EE | Guillaume Fertin,
Romeo Rizzi,
Stéphane Vialette:
Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs.
MFCS 2005: 328-339 |
26 | EE | Guillaume Blin,
Guillaume Fertin,
Danny Hermelin,
Stéphane Vialette:
Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints.
WG 2005: 271-282 |
25 | EE | Guillaume Fertin,
Arthur L. Liestman,
Thomas C. Shermer,
Ladislav Stacho:
Edge-disjoint spanners in Cartesian products of graphs.
Discrete Mathematics 296(2-3): 167-186 (2005) |
24 | EE | Guillaume Blin,
Guillaume Fertin,
Romeo Rizzi,
Stéphane Vialette:
What Makes the Arc-Preserving Subsequence Problem Hard?
T. Comp. Sys. Biology 2: 1-36 (2005) |
2004 |
23 | EE | Guillaume Blin,
Guillaume Fertin,
Stéphane Vialette:
New Results for the 2-Interval Pattern Problem.
CPM 2004: 311-322 |
22 | EE | Guillaume Fertin,
André Raspaud,
Ondrej Sýkora:
No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes.
SIROCCO 2004: 138-148 |
21 | EE | Guillaume Fertin,
André Raspaud:
A survey on Knödel graphs.
Discrete Applied Mathematics 137(2): 173-195 (2004) |
20 | EE | Guillaume Fertin,
André Raspaud,
Bruce A. Reed:
Star coloring of graphs.
Journal of Graph Theory 47(3): 163-182 (2004) |
19 | EE | Cedric Chauve,
Guillaume Fertin:
On maximal instances for the original syntenic distance.
Theor. Comput. Sci. 326(1-3): 29-43 (2004) |
2003 |
18 | | 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: 73-87 |
17 | EE | Noga Alon,
Guillaume Fertin,
Arthur L. Liestman,
Thomas C. Shermer,
Ladislav Stacho:
Factor d-domatic colorings of graphs.
Discrete Mathematics 262(1-3): 17-25 (2003) |
16 | EE | Guillaume Fertin,
André Raspaud,
Arup Roychowdhury:
On the oriented chromatic number of grids.
Inf. Process. Lett. 85(5): 261-266 (2003) |
15 | EE | Guillaume Fertin,
Emmanuel Godard,
André Raspaud:
Acyclic and k-distance coloring of the grid.
Inf. Process. Lett. 87(1): 51-58 (2003) |
2002 |
14 | EE | Guillaume Fertin,
Emmanuel Godard,
André Raspaud:
Minimum feedback vertex set and acyclic coloring.
Inf. Process. Lett. 84(3): 131-139 (2002) |
2001 |
13 | | Guillaume Fertin,
André Raspaud:
k-Neighborhood Broadcasting.
SIROCCO 2001: 133-146 |
12 | EE | Guillaume Fertin,
André Raspaud,
Bruce A. Reed:
On Star Coloring of Graphs.
WG 2001: 140-153 |
11 | | Olivier Baudon,
Guillaume Fertin,
Ivan Havel:
Routing permutations and 2-1 routing requests in the hypercube.
Discrete Applied Mathematics 113(1): 43-58 (2001) |
10 | EE | Guillaume Fertin,
André Raspaud:
Neighborhood Communications in Networks.
Electronic Notes in Discrete Mathematics 10: 103-108 (2001) |
2000 |
9 | EE | Guillaume Fertin,
André Raspaud,
Heiko Schröder,
Ondrej Sýkora,
Imrich Vrto:
Diameter of the Knödel Graph.
WG 2000: 149-160 |
8 | EE | Guillaume Fertin:
A study of minimum gossip graphs.
Discrete Mathematics 215: 33-57 (2000) |
7 | EE | Guillaume Fertin,
André Raspaud:
Recognizing Recursive Circulant Graphs (Extended Abstract).
Electronic Notes in Discrete Mathematics 5: 112-115 (2000) |
6 | EE | Guillaume Fertin:
Hierarchical broadcast and gossip networks.
Inf. Process. Lett. 73(3-4): 131-136 (2000) |
5 | EE | Guillaume Fertin,
Roger Labahn:
Compounding of gossip graphs.
Networks 36(2): 126-137 (2000) |
4 | EE | Guillaume Fertin:
On the structure of minimum broadcast digraphs.
Theor. Comput. Sci. 245(2): 203-216 (2000) |
1999 |
3 | | Guillaume Fertin:
Trade-Offs for Add Gossiping.
SIROCCO 1999: 137-152 |
2 | EE | Olivier Baudon,
Guillaume Fertin,
Ivan Havel:
Routing Permutations in the Hypercube.
WG 1999: 179-190 |
1998 |
1 | | Guillaume Fertin,
André Raspaud:
Families of Graphs Having Broadcasting and Gossiping Properties.
WG 1998: 63-77 |