default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuillaume Fertin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j68]Guillaume Fertin, Géraldine Jean
, Anthony Labarre:
Sorting genomes by prefix double-cut-and-joins. Theor. Comput. Sci. 1024: 114909 (2025)- 2024
- [j67]Gabriel Siqueira, Andre Rodrigues Oliveira, Alexsandro Oliveira Alexandrino, Géraldine Jean, Guillaume Fertin, Zanoni Dias:
Assignment of orthologous genes in unbalanced genomes using cycle packing of adjacency graphs. J. Heuristics 30(5): 269-289 (2024) - [j66]Guillaume Fertin, Oscar Fontaine, Géraldine Jean, Stéphane Vialette:
The Maximum Zero-Sum Partition problem. Theor. Comput. Sci. 1019: 114811 (2024) - [c68]Guillaume Fertin, Éric Monfroy, Claudia Vasconcellos-Gaete:
Best of Both Worlds: Solving the Cyclic Bandwidth Problem by Combining Pre-existing Knowledge and Constraint Programming Techniques. ICCS (5) 2024: 197-211 - 2023
- [j65]Grégoire Prunier, Mehdi Cherkaoui, Albane Lysiak, Olivier Langella, Mélisande Blein-Nicolas, Virginie Lollier, Emile Benoist, Géraldine Jean, Guillaume Fertin, Hélène Rogniaux, Dominique Tessier:
Fast alignment of mass spectra in large proteomics datasets, capturing dissimilarities arising from multiple complex modifications of peptides. BMC Bioinform. 24(1): 421 (2023) - [j64]Alexsandro Oliveira Alexandrino, Andre Rodrigues Oliveira, Géraldine Jean, Guillaume Fertin, Ulisses Dias, Zanoni Dias:
Reversal and Transposition Distance on Unbalanced Genomes Using Intergenic Information. J. Comput. Biol. 30(8): 861-876 (2023) - [j63]Andre Rodrigues Oliveira, Alexsandro Oliveira Alexandrino, Géraldine Jean, Guillaume Fertin, Ulisses Dias, Zanoni Dias:
Approximation algorithms for sorting by k-cuts on signed permutations. J. Comb. Optim. 45(1): 6 (2023) - [c67]Gabriel Siqueira, Alexsandro Oliveira Alexandrino, Andre Rodrigues Oliveira, Géraldine Jean, Guillaume Fertin, Zanoni Dias:
Approximating Rearrangement Distances with Replicas and Flexible Intergenic Regions. ISBRA 2023: 241-254 - 2022
- [c66]Laurent Bulteau, Guillaume Fertin, Vincent Jugé, Stéphane Vialette:
Permutation Pattern Matching for Doubly Partially Ordered Patterns. CPM 2022: 21:1-21:17 - [c65]Guillaume Fertin, Oscar Fontaine, Géraldine Jean, Stéphane Vialette:
The Maximum Zero-Sum Partition Problem. ICS 2022: 73-85 - [c64]Alexsandro Oliveira Alexandrino, Andre Rodrigues Oliveira, Géraldine Jean, Guillaume Fertin, Ulisses Dias, Zanoni Dias:
Transposition Distance Considering Intergenic Regions for Unbalanced Genomes. ISBRA 2022: 100-113 - [c63]Andre Rodrigues Oliveira, Alexsandro Oliveira Alexandrino, Géraldine Jean, Guillaume Fertin, Ulisses Dias, Zanoni Dias:
Sorting by k-Cuts on Signed Permutations. RECOMB-CG 2022: 189-204 - [c62]Guillaume Fertin, Géraldine Jean, Anthony Labarre:
Sorting Genomes by Prefix Double-Cut-and-Joins. SPIRE 2022: 178-190 - [c61]Emile Benoist, Guillaume Fertin, Géraldine Jean:
The Exact Subset MultiCover Problem. TAMC 2022: 189-200 - [i9]Guillaume Fertin, Géraldine Jean, Anthony Labarre:
Sorting Genomes by Prefix Double-Cut-and-Joins. CoRR abs/2208.14315 (2022) - 2021
- [j62]Laurent Bulteau, Guillaume Fertin, Géraldine Jean, Christian Komusiewicz:
Sorting by Multi-Cut Rearrangements. Algorithms 14(6): 169 (2021) - [j61]Albane Lysiak, Guillaume Fertin, Géraldine Jean, Dominique Tessier:
Evaluation of open search methods based on theoretical mass spectra comparison. BMC Bioinform. 22-S(2): 65 (2021) - [j60]Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu:
Decomposing subcubic graphs into claws, paths or triangles. J. Graph Theory 98(4): 557-588 (2021) - [j59]Andre Rodrigues Oliveira, Géraldine Jean, Guillaume Fertin, Klairton Lima Brito, Ulisses Dias, Zanoni Dias:
Sorting Permutations by Intergenic Operations. IEEE ACM Trans. Comput. Biol. Bioinform. 18(6): 2080-2093 (2021) - [j58]Andre Rodrigues Oliveira, Géraldine Jean, Guillaume Fertin, Klairton Lima Brito, Laurent Bulteau, Ulisses Dias, Zanoni Dias:
Sorting Signed Permutations by Intergenic Reversals. IEEE ACM Trans. Comput. Biol. Bioinform. 18(6): 2870-2876 (2021) - [j57]Guillaume Fertin, Julien Fradin, Géraldine Jean:
The Maximum Colorful Arborescence problem: How (computationally) hard can it be? Theor. Comput. Sci. 852: 104-120 (2021) - [c60]Hugues Déprés, Guillaume Fertin, Éric Monfroy:
Improved Lower Bounds for the Cyclic Bandwidth Problem. ICCS (1) 2021: 555-569 - [c59]Laurent Bulteau, Guillaume Fertin, Géraldine Jean, Christian Komusiewicz:
Sorting by Multi-cut Rearrangements. SOFSEM 2021: 593-607 - 2020
- [j56]Klairton Lima Brito, Géraldine Jean, Guillaume Fertin, Andre Rodrigues Oliveira, Ulisses Dias, Zanoni Dias:
Sorting by Genome Rearrangements on Both Gene Order and Intergenic Sizes. J. Comput. Biol. 27(2): 156-174 (2020) - [j55]Guillaume Fertin, Christian Komusiewicz:
Graph Motif Problems Parameterized by Dual. J. Graph Algorithms Appl. 24(3): 371-396 (2020) - [c58]Andre Rodrigues Oliveira, Géraldine Jean, Guillaume Fertin, Klairton Lima Brito, Ulisses Dias, Zanoni Dias:
A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions. AlCoB 2020: 16-28
2010 – 2019
- 2019
- [j54]Andre Rodrigues Oliveira, Géraldine Jean, Guillaume Fertin, Ulisses Dias, Zanoni Dias:
Super short operations on both gene order and intergenic sizes. Algorithms Mol. Biol. 14(1): 21:1-21:17 (2019) - [c57]Guillaume Fertin, Matthieu David, Hélène Rogniaux, Dominique Tessier:
Mass Spectra Interpretation and the Interest of SpecFit for Identifying Uncommon Modifications. CIBB 2019: 80-89 - [c56]Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette:
Finding a Small Number of Colourful Components. CPM 2019: 20:1-20:14 - [c55]Klairton Lima Brito, Géraldine Jean, Guillaume Fertin, Andre Rodrigues Oliveira, Ulisses Dias, Zanoni Dias:
Sorting by Reversals, Transpositions, and Indels on Both Gene Order and Intergenic Sizes. ISBRA 2019: 28-39 - [c54]Guillaume Fertin, Samuele Giraudo, Sylvie Hamel, Stéphane Vialette:
Unshuffling Permutations: Trivial Bijections and Compositions. TAMC 2019: 242-261 - [i8]Guillaume Fertin, Christian Komusiewicz:
Graph Motif Problems Parameterized by Dual. CoRR abs/1908.03870 (2019) - 2018
- [j53]Andre Rodrigues Oliveira, Guillaume Fertin, Ulisses Dias, Zanoni Dias:
Sorting signed circular permutations by super short operations. Algorithms Mol. Biol. 13(1): 13:1-13:16 (2018) - [j52]Guillaume Fertin, Falk Hüffner, Christian Komusiewicz, Manuel Sorge:
Matching algorithms for assigning orthologs after genome duplication events. Comput. Biol. Chem. 74: 379-390 (2018) - [j51]Guillaume Fertin, Irena Rusu, Stéphane Vialette:
The S-labeling problem: An algorithmic tour. Discret. Appl. Math. 246: 49-61 (2018) - [j50]Guillaume Fertin, Loïc Jankowiak, Géraldine Jean:
Prefix and suffix reversals on strings. Discret. Appl. Math. 246: 140-153 (2018) - [j49]Guillaume Fertin, Joseph G. Peters:
Optimal odd gossiping. Discret. Appl. Math. 247: 53-69 (2018) - [j48]Carla Negri Lintzmayer, Guillaume Fertin, Zanoni Dias:
Sorting permutations and binary strings by length-weighted rearrangements. Theor. Comput. Sci. 715: 35-59 (2018) - [j47]Riccardo Dondi, Guillaume Fertin, Giancarlo Mauri:
Editorial. Theor. Comput. Sci. 717: 1 (2018) - [c53]Guillaume Fertin, Julien Fradin, Christian Komusiewicz:
On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure. CPM 2018: 17:1-17:15 - [c52]Andre Rodrigues Oliveira, Géraldine Jean, Guillaume Fertin, Ulisses Dias, Zanoni Dias:
Super Short Reversals on Both Gene Order and Intergenic Sizes. BSB 2018: 14-25 - [i7]Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette:
Finding a Small Number of Colourful Components. CoRR abs/1808.03561 (2018) - 2017
- [j46]Guillaume Fertin, Géraldine Jean, Eric Tannier:
Algorithms for computing the double cut and join distance on both gene order and intergenic sizes. Algorithms Mol. Biol. 12(1): 16:1-16:11 (2017) - [j45]Guillaume Fertin, Joseph G. Peters, Lynette Raabe, Charlie Xu:
Odd gossiping. Discret. Appl. Math. 216: 550-561 (2017) - [j44]Carla Negri Lintzmayer, Guillaume Fertin, Zanoni Dias:
Sorting permutations by prefix and suffix rearrangements. J. Bioinform. Comput. Biol. 15(1): 1750002:1-1750002:46 (2017) - [c51]Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz:
Beyond Adjacency Maximization: Scaffold Filling for New String Distances. CPM 2017: 27:1-27:17 - [c50]Guillaume Fertin, Julien Fradin, Géraldine Jean:
Algorithmic Aspects of the Maximum Colorful Arborescence Problem. TAMC 2017: 216-230 - [i6]Guillaume Fertin, Julien Fradin, Christian Komusiewicz:
The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph. CoRR abs/1710.07584 (2017) - 2016
- [j43]Laurent Bulteau, Guillaume Fertin, Eric Tannier:
Genome rearrangements with indels in intergenes restrict the scenario space. BMC Bioinform. 17(S-14): 225-231 (2016) - [j42]Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz:
(Prefix) reversal distance for (signed) strings with few blocks or small alphabets. J. Discrete Algorithms 37: 44-55 (2016) - [c49]Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu:
Decomposing Cubic Graphs into Connected Subgraphs of Size Three. COCOON 2016: 393-404 - [c48]Guillaume Fertin, Christian Komusiewicz:
Graph Motif Problems Parameterized by Dual. CPM 2016: 7:1-7:12 - [c47]Matthieu David, Guillaume Fertin, Dominique Tessier:
SpecTrees: An Efficient Without a Priori Data Structure for MS/MS Spectra Identification. WABI 2016: 65-76 - [c46]Guillaume Fertin, Géraldine Jean, Eric Tannier:
Genome Rearrangements on Both Gene Order and Intergenic Regions. WABI 2016: 162-173 - [e1]Riccardo Dondi, Guillaume Fertin, Giancarlo Mauri:
Algorithmic Aspects in Information and Management - 11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings. Lecture Notes in Computer Science 9778, Springer 2016, ISBN 978-3-319-41167-5 [contents] - [i5]Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu:
Decomposing Cubic Graphs into Connected Subgraphs of Size Three. CoRR abs/1604.08603 (2016) - 2015
- [j41]Guillaume Fertin, Christian Komusiewicz, Hafedh Mohamed-Babou, Irena Rusu:
Finding Supported Paths in Heterogeneous Networks. Algorithms 8(4): 810-831 (2015) - [j40]Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu:
Path-driven orientation of mixed graphs. Discret. Appl. Math. 181: 98-108 (2015) - [j39]Laurent Bulteau, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette:
Some algorithmic results for [2]-sumset covers. Inf. Process. Lett. 115(1): 1-5 (2015) - [j38]Laurent Bulteau, Guillaume Fertin, Irena Rusu:
Pancake Flipping is hard. J. Comput. Syst. Sci. 81(8): 1556-1574 (2015) - [j37]Guillaume Fertin, Shahrad Jamshidi, Christian Komusiewicz:
Towards an algorithmic guide to Spiral Galaxies. Theor. Comput. Sci. 586: 26-39 (2015) - [j36]Carla Negri Lintzmayer, Guillaume Fertin, Zanoni Dias:
Approximation algorithms for sorting by length-weighted prefix and suffix operations. Theor. Comput. Sci. 593: 26-41 (2015) - [c45]Guillaume Fertin, Irena Rusu, Stéphane Vialette:
Obtaining a Triangular Matrix by Independent Row-Column Permutations. ISAAC 2015: 165-175 - [c44]Guillaume Fertin, Irena Rusu, Stéphane Vialette:
Algorithmic Aspects of the S-Labeling Problem. IWOCA 2015: 173-184 - [c43]Guillaume Fertin, Loïc Jankowiak, Géraldine Jean:
Prefix and Suffix Reversals on Strings. SPIRE 2015: 165-176 - 2014
- [c42]Guillaume Fertin, Géraldine Jean, Andreea Radulescu, Irena Rusu:
DExTaR: Detection of exact tandem repeats based on the de Bruijn graph. BIBM 2014: 90-93 - [c41]Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz:
Reversal Distances for Strings with Few Blocks or Small Alphabets. CPM 2014: 50-59 - [c40]Guillaume Fertin, Shahrad Jamshidi, Christian Komusiewicz:
Towards an Algorithmic Guide to Spiral Galaxies. FUN 2014: 171-182 - 2013
- [j35]Laurent Bulteau, Guillaume Fertin, Irena Rusu:
Maximal strip recovery problem with gaps: Hardness and approximation algorithms. J. Discrete Algorithms 19: 1-22 (2013) - [j34]Riccardo Dondi, Guillaume Fertin, Stéphane Vialette:
Finding approximate and constrained motifs in graphs. Theor. Comput. Sci. 483: 10-21 (2013) - [j33]Laurent Bulteau, Guillaume Fertin, Irena Rusu:
Revisiting the Minimum Breakpoint Linearization Problem. Theor. Comput. Sci. 494: 122-133 (2013) - [c39]Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz, Irena Rusu:
A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. WABI 2013: 244-258 - [i4]Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz, Irena Rusu:
A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. CoRR abs/1307.7842 (2013) - 2012
- [j32]Laurent Bulteau, Guillaume Fertin, Irena Rusu:
Sorting by Transpositions Is Difficult. SIAM J. Discret. 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]Laurent Bulteau, Guillaume Fertin, Irena Rusu:
Pancake Flipping Is Hard. MFCS 2012: 247-258 - [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]Laurent Bulteau, Guillaume Fertin, Irena Rusu:
Pancake Flipping is Hard. CoRR abs/1111.0434 (2011) - 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
- [b1]Guillaume Fertin, Anthony Labarre, Irena Rusu, Eric Tannier, Stéphane Vialette:
Combinatorics of Genome Rearrangements. Computational molecular biology, MIT Press 2009, ISBN 978-0-262-06282-4, pp. I-XI, 1-288 - [j27]Guillaume Fertin, Stéphane Vialette:
On the S-Labeling problem. Electron. Notes Discret. Math. 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. J. Comput. Biol. 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. Discret. Math. 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. J. Comput. Biol. 14(4): 379-393 (2007) - [j19]Guillaume Blin, Cédric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette:
Comparing Genomes with Duplications: A Computational Complexity Point of View. IEEE ACM Trans. Comput. Biol. 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. Biol. 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]Cédric 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. Discret. Math. 296(2-3): 167-186 (2005) - [j15]Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette:
What Makes the Arc-Preserving Subsequence Problem Hard? Trans. 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, Cédric 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. Discret. Appl. Math. 137(2): 173-195 (2004) - [j13]Guillaume Fertin, André Raspaud, Bruce A. Reed:
Star coloring of graphs. J. Graph Theory 47(3): 163-182 (2004) - [j12]Cédric 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. Discret. Math. 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. Discret. Appl. Math. 113(1): 43-58 (2001) - [j6]Guillaume Fertin, André Raspaud:
Neighborhood Communications in Networks. Electron. Notes Discret. Math. 10: 103-108 (2001) - [c6]Guillaume Fertin, André Raspaud:
k-Neighborhood Broadcasting. SIROCCO 2001: 133-146 - [c5]Guillaume Fertin, André Raspaud, Bruce A. Reed:
On Star Coloring of Graphs. WG 2001: 140-153 - 2000
- [j5]Guillaume Fertin:
A study of minimum gossip graphs. Discret. Math. 215: 33-57 (2000) - [j4]Guillaume Fertin, André Raspaud:
Recognizing Recursive Circulant Graphs (Extended Abstract). Electron. Notes Discret. Math. 5: 112-115 (2000) - [j3]Guillaume Fertin:
Hierarchical broadcast and gossip networks. Inf. Process. Lett. 73(3-4): 131-136 (2000) - [j2]Guillaume Fertin, Roger Labahn:
Compounding of gossip graphs. Networks 36(2): 126-137 (2000) - [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]Guillaume Fertin:
Trade-Offs for Add Gossiping. SIROCCO 1999: 137-152 - [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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
