Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Guillaume Fertin
2010 – today
- 2013
[j34]Laurent Bulteau, Guillaume Fertin, Irena Rusu: Maximal strip recovery problem with gaps: Hardness and approximation algorithms. J. Discrete Algorithms 19: 1-22 (2013)- [j33]Riccardo Dondi, Guillaume Fertin, Stéphane Vialette: Finding approximate and constrained motifs in graphs. Theor. Comput. Sci. 483: 10-21 (2013)
- 2012
- [j32]Laurent Bulteau, Guillaume Fertin, Irena Rusu: Sorting by Transpositions Is Difficult. SIAM J. Discrete Math. 26(3): 1148-1180 (2012)
- [j31]Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu: Tractability and approximability of maximal strip recovery. Theor. Comput. Sci. 440-441: 14-28 (2012)
- [c38]
- [c37]Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu: Algorithms for Subnetwork Mining in Heterogeneous Networks. SEA 2012: 184-194
- 2011
- [j30]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. 77(4): 799-811 (2011)
- [j29]Riccardo Dondi, Guillaume Fertin, Stéphane Vialette: Complexity issues in vertex-colored graph pattern matching. J. Discrete Algorithms 9(1): 82-99 (2011)
- [c36]Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu, Florian Sikora, Stéphane Vialette: Algorithmic Aspects of Heterogeneous Biological Networks Comparison. COCOA 2011: 272-286
- [c35]Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu: Tractability and Approximability of Maximal Strip Recovery. CPM 2011: 336-349
- [c34]Riccardo Dondi, Guillaume Fertin, Stéphane Vialette: Finding Approximate and Constrained Motifs in Graphs. CPM 2011: 388-401
- [c33]Laurent Bulteau, Guillaume Fertin, Irena Rusu: Sorting by Transpositions Is Difficult. ICALP (1) 2011: 654-665
- [i3]
- 2010
- [j28]Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette: Finding common structured patterns in linear graphs. Theor. Comput. Sci. 411(26-28): 2475-2486 (2010)
- [c32]Freddy Cliquet, Guillaume Fertin, Irena Rusu, Dominique Tessier: Proper Alignment of MS/MS Spectra from Unsequenced Species. BIOCOMP 2010: 766-772
- [c31]Laurent Bulteau, Guillaume Fertin, Irena Rusu: Revisiting the Minimum Breakpoint Linearization Problem. TAMC 2010: 163-174
- [i2]Laurent Bulteau, Guillaume Fertin, Irena Rusu: Sorting by Transpositions is Difficult. CoRR abs/1011.1157 (2010)
2000 – 2009
- 2009
- [j27]Guillaume Fertin, Stéphane Vialette: On the S-Labeling problem. Electronic Notes in Discrete Mathematics 34: 273-277 (2009)
- [j26]Guillaume Fertin, Romeo Rizzi, Stéphane Vialette: Finding occurrences of protein complexes in protein-protein interaction graphs. J. Discrete Algorithms 7(1): 90-101 (2009)
- [j25]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. 13(1): 19-53 (2009)
- [c30]Sébastien Angibaud, Damien Eveillard, Guillaume Fertin, Irena Rusu: Comparing Bacterial Genomes by Searching Their Common Intervals. BICoB 2009: 102-113
- [c29]Isabelle Fagnot, Guillaume Fertin, Stéphane Vialette: On Finding Small 2-Generating Sets. COCOON 2009: 378-387
- [c28]Riccardo Dondi, Guillaume Fertin, Stéphane Vialette: Maximum Motif Problem in Vertex-Colored Graphs. CPM 2009: 221-235
- [c27]Laurent Bulteau, Guillaume Fertin, Irena Rusu: Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms. ISAAC 2009: 710-719
- [c26]Sébastien Angibaud, Guillaume Fertin, Annelyse Thévenin, Stéphane Vialette: Pseudo Boolean Programming for Partially Ordered Genomes. RECOMB-CG 2009: 126-137
- [c25]Guillaume Blin, Guillaume Fertin, Florian Sikora, Stéphane Vialette: The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated. WALCOM 2009: 357-368
- [c24]Freddy Cliquet, Guillaume Fertin, Irena Rusu, Dominique Tessier: Comparison of Spectra in Unsequenced Species. BSB 2009: 24-35
- 2008
- [j24]Guillaume Fertin, André Raspaud: Acyclic coloring of graphs of maximum degree five: Nine colors are enough. Inf. Process. Lett. 105(2): 65-72 (2008)
- [j23]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)
- [j22]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)
- [c23]Sébastien Angibaud, Guillaume Fertin, Irena Rusu: On the Approximability of Comparing Genomes with Duplicates. WALCOM 2008: 34-45
- [i1]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)
- 2007
- [j21]Guillaume Fertin, André Raspaud: L(p, q) labeling of d-dimensional grids. Discrete Mathematics 307(16): 2132-2140 (2007)
- [j20]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)
- [j19]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)
- [j18]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)
- [j17]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)
- [c22]Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette: Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. CPM 2007: 241-252
- [c21]Guillaume Blin, Guillaume Fertin, Irena Rusu, Christine Sinoquet: Extending the Hardness of RNA Secondary Structure Comparison. ESCAPE 2007: 140-151
- [c20]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
- [c19]Riccardo Dondi, Guillaume Fertin, Stéphane Vialette: Weak pattern matching in colored graphs: Minimizing the number of connected components. ICTCS 2007: 27-38
- [c18]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
- [c17]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
- 2006
- [c16]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
- [c15]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
- [c14]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
- 2005
- [j16]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)
- [j15]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)
- [c13]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
- [c12]Guillaume Fertin, Romeo Rizzi, Stéphane Vialette: Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs. MFCS 2005: 328-339
- [c11]Guillaume Blin, Cedric Chauve, Guillaume Fertin: Genes Order and Phylogenetic Reconstruction: Application to gamma-Proteobacteria. Comparative Genomics 2005: 11-20
- [c10]Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette: Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints. WG 2005: 271-282
- 2004
- [j14]Guillaume Fertin, André Raspaud: A survey on Knödel graphs. Discrete Applied Mathematics 137(2): 173-195 (2004)
- [j13]Guillaume Fertin, André Raspaud, Bruce A. Reed: Star coloring of graphs. Journal of Graph Theory 47(3): 163-182 (2004)
- [j12]Cedric Chauve, Guillaume Fertin: On maximal instances for the original syntenic distance. Theor. Comput. Sci. 326(1-3): 29-43 (2004)
- [c9]Guillaume Blin, Guillaume Fertin, Stéphane Vialette: New Results for the 2-Interval Pattern Problem. CPM 2004: 311-322
- [c8]Guillaume Fertin, André Raspaud, Ondrej Sýkora: No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes. SIROCCO 2004: 138-148
- 2003
- [j11]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)
- [j10]Guillaume Fertin, André Raspaud, Arup Roychowdhury: On the oriented chromatic number of grids. Inf. Process. Lett. 85(5): 261-266 (2003)
- [j9]Guillaume Fertin, Emmanuel Godard, André Raspaud: Acyclic and k-distance coloring of the grid. Inf. Process. Lett. 87(1): 51-58 (2003)
- [c7]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
- 2002
- [j8]Guillaume Fertin, Emmanuel Godard, André Raspaud: Minimum feedback vertex set and acyclic coloring. Inf. Process. Lett. 84(3): 131-139 (2002)
- 2001
- [j7]Olivier Baudon, Guillaume Fertin, Ivan Havel: Routing permutations and 2-1 routing requests in the hypercube. Discrete Applied Mathematics 113(1): 43-58 (2001)
- [j6]Guillaume Fertin, André Raspaud: Neighborhood Communications in Networks. Electronic Notes in Discrete Mathematics 10: 103-108 (2001)
- [c6]
- [c5]
- 2000
- [j5]
- [j4]Guillaume Fertin, André Raspaud: Recognizing Recursive Circulant Graphs (Extended Abstract). Electronic Notes in Discrete Mathematics 5: 112-115 (2000)
- [j3]Guillaume Fertin: Hierarchical broadcast and gossip networks. Inf. Process. Lett. 73(3-4): 131-136 (2000)
- [j2]
- [j1]Guillaume Fertin: On the structure of minimum broadcast digraphs. Theor. Comput. Sci. 245(2): 203-216 (2000)
- [c4]Guillaume Fertin, André Raspaud, Heiko Schröder, Ondrej Sýkora, Imrich Vrto: Diameter of the Knödel Graph. WG 2000: 149-160
1990 – 1999
- 1999
- [c3]
- [c2]Olivier Baudon, Guillaume Fertin, Ivan Havel: Routing Permutations in the Hypercube. WG 1999: 179-190
- 1998
- [c1]Guillaume Fertin, André Raspaud: Families of Graphs Having Broadcasting and Gossiping Properties. WG 1998: 63-77
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-19 20:43 CEST by the dblp team