Edit Profile (opens in new tab) Fertin, Guillaume Co-Author Distance Author ID: fertin.guillaume Published as: Fertin, Guillaume; Fertin, G. External Links: MGP · ORCID Documents Indexed: 93 Publications since 1998, including 1 Book 2 Contributions as Editor Reviewing Activity: 8 Reviews Co-Authors: 59 Co-Authors with 92 Joint Publications 2,041 Co-Co-Authors all top 5 Co-Authors 3 single-authored 30 Vialette, Stéphane 22 Rusu, Irena 18 Bulteau, Laurent 15 Raspaud, André 11 Jean, Géraldine 10 Rizzi, Romeo 9 Blin, Guillaume 9 Komusiewicz, Christian 7 Dondi, Riccardo 6 Hermelin, Danny 5 Dias, Zanoni 4 Labarre, Anthony 3 Dias, Ulisses 3 Fradin, Julien 3 Mohamed-Babou, Hafedh 3 Oliveira, Andre Rodrigues 2 Alexandrino, Alexsandro Oliveira 2 Angibaud, Sébastien 2 Baudon, Olivier 2 Chauve, Cedric 2 Comellas, Francesc 2 Fellows, Michael Ralph 2 Godard, Emmanuel 2 Havel, Ivan M. 2 Jankowiak, Loïc 2 Jiang, Minghui 2 Liestman, Arthur L. 2 Lintzmayer, Carla Negri 2 Mauri, Giancarlo 2 Peters, Joseph G. 2 Reed, Bruce Alan 2 Rong, Lili 2 Shermer, Thomas Caton 2 Sikora, Florian 2 Stacho, Ladislav 2 Sýkora, Ondrej 2 Tannier, Eric 2 Zhang, Zhongzhi 1 Alon, Noga 1 Benoist, Emile 1 Bonizzoni, Paola 1 Brito, Klairton Lima 1 Dabrowski, Konrad Kazimierz 1 Della Vedova, Gianluca 1 Fagnot, Isabelle 1 Giraudo, Samuele 1 Hamel, Sylvie 1 Jamshidi, Shahrad 1 Johnson, Matthew 1 Labahn, Roger 1 Paulusma, Daniël 1 Raabe, Lynette 1 Roychowdhury, Arup 1 Schröder, Heiko 1 Sinoquet, Christine 1 Thévenin, Annelyse 1 Vrto, Imrich 1 Xu, Charlie 1 Zhou, Shuigeng all top 5 Serials 12 Theoretical Computer Science 7 Discrete Applied Mathematics 6 Information Processing Letters 5 Journal of Discrete Algorithms 4 Discrete Mathematics 2 Journal of Computer and System Sciences 2 Journal of Graph Theory 2 Journal of Graph Algorithms and Applications 1 Networks 1 SIAM Journal on Discrete Mathematics 1 Journal of Physics A: Mathematical and General 1 Journal of Combinatorial Optimization 1 Lecture Notes in Computer Science 1 Journal of Physics A: Mathematical and Theoretical 1 Algorithms all top 5 Fields 76 Computer science (68-XX) 38 Combinatorics (05-XX) 38 Biology and other natural sciences (92-XX) 9 Operations research, mathematical programming (90-XX) 5 Information and communication theory, circuits (94-XX) 2 General and overarching topics; collections (00-XX) 1 Number theory (11-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 77 Publications have been cited 602 times in 449 Documents Cited by ▼ Year ▼ Combinatorics of genome rearrangements. Zbl 1170.92022 Fertin, Guillaume; Labarre, Anthony; Rusu, Irena; Tannier, Éric; Vialette, Stéphane 77 2009 Star coloring of graphs. Zbl 1055.05051 Fertin, Guillaume; Raspaud, André; Reed, Bruce 67 2004 Sorting by transpositions is difficult. Zbl 1256.05004 Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena 34 2012 Upper and lower bounds for finding connected motifs in vertex-colored graphs. Zbl 1210.68060 Fellows, Michael R.; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane 31 2011 Acyclic and \(k\)-distance coloring of the grid. Zbl 1175.68293 Fertin, Guillaume; Godard, Emmanuel; Raspaud, André 24 2003 A survey on Knödel graphs. Zbl 1062.68086 Fertin, Guillaume; Raspaud, André 21 2004 On the approximability of comparing genomes with duplicates. Zbl 1170.68049 Angibaud, Sébastien; Fertin, Guillaume; Rusu, Irena; Thévenin, Annelyse; Vialette, Stéphane 20 2009 On star coloring of graphs. Zbl 1042.68628 Fertin, Guillaume; Raspaud, André; Reed, Bruce 19 2001 Sharp tractability borderlines for finding connected motifs in vertex-colored graphs. Zbl 1171.68497 Fellows, Michael R.; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane 19 2007 Complexity issues in vertex-colored graph pattern matching. Zbl 1222.05053 Dondi, Riccardo; Fertin, Guillaume; Vialette, Stéphane 18 2011 Acyclic coloring of graphs of maximum degree five: nine colors are enough. Zbl 1183.05027 Fertin, Guillaume; Raspaud, André 18 2008 On the oriented chromatic number of grids. Zbl 1173.68604 Fertin, Guillaume; Raspaud, André; Roychowdhury, Arup 18 2003 Minimum feedback vertex set and acyclic coloring. Zbl 1042.68090 Fertin, Guillaume; Godard, Emmanuel; Raspaud, André 18 2002 High-dimensional Apollonian networks. Zbl 1086.68017 Zhang, Zhongzhi; Comellas, Francesc; Fertin, Guillaume; Rong, Lili 13 2006 Pancake flipping is hard. Zbl 1328.68084 Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena 13 2015 Pancake flipping is hard. Zbl 1329.68132 Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena 10 2012 Maximal strip recovery problem with gaps: hardness and approximation algorithms. Zbl 1273.68406 Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena 10 2009 Finding approximate and constrained motifs in graphs. Zbl 1339.92025 Dondi, Riccardo; Fertin, Guillaume; Vialette, Stéphane 8 2011 The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximated. Zbl 1211.68509 Blin, Guillaume; Fertin, Guillaume; Sikora, Florian; Vialette, Stéphane 8 2009 Sorting by transpositions is difficult. Zbl 1334.68085 Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena 7 2011 Maximum motif problem in vertex-colored graphs. Zbl 1247.68198 Dondi, Riccardo; Fertin, Guillaume; Vialette, Stéphane 7 2009 Finding exact and maximum occurrences of protein complexes in protein-protein interaction graphs. Zbl 1156.92317 Fertin, Guillaume; Rizzi, Romeo; Vialette, Stéphane 7 2005 New results for the 2-interval pattern problem. Zbl 1103.68059 Blin, Guillaume; Fertin, Guillaume; Vialette, Stéphane 6 2004 Tractability and approximability of maximal strip recovery. Zbl 1252.68349 Bulteau, Laurent; Fertin, Guillaume; Jiang, Minghui; Rusu, Irena 6 2012 Exemplar longest common subsequence. Zbl 1155.68393 Bonizzoni, Paola; Della Vedova, Gianluca; Dondi, Riccardo; Fertin, Guillaume; Vialette, Stéphane 6 2006 Finding approximate and constrained motifs in graphs. Zbl 1297.05081 Dondi, Riccardo; Fertin, Guillaume; Vialette, Stéphane 6 2013 Extracting constrained 2-interval subsets in 2-interval sets. Zbl 1125.68085 Blin, Guillaume; Fertin, Guillaume; Vialette, Stéphane 5 2007 A study of minimum gossip graphs. Zbl 0983.94002 Fertin, Guillaume 5 2000 Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. Zbl 1171.92316 Blin, Guillaume; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane 5 2005 Algorithmic aspects of the maximum colorful arborescence problem. Zbl 1485.68181 Fertin, Guillaume; Fradin, Julien; Jean, Géraldine 5 2017 Acyclic coloring of graphs of maximum degree \(\Delta \). Zbl 1192.05049 Fertin, Guillaume; Raspaud, André 5 2005 Families of graphs having broadcasting and gossiping properties. Zbl 0918.68083 Fertin, Guillaume; Raspaud, André 4 1998 Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. Zbl 1154.05326 Blin, Guillaume; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane 4 2008 Maximal strip recovery problem with gaps: hardness and approximation algorithms. Zbl 1280.68094 Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena 4 2013 \(L(p,q)\) labeling of \(d\)-dimensional grids. Zbl 1119.05096 Fertin, Guillaume; Raspaud, André 3 2007 What makes the Arc-Preserving Subsequence problem hard? Zbl 1128.68361 Blin, Guillaume; Fertin, Guillaume; Rizzi, Romeo; Vialette, Stéphane 3 2005 On maximal instances for the original syntenic distance. Zbl 1071.92502 Chauve, Cedric; Fertin, Guillaume 3 2004 Approximation algorithms for sorting by length-weighted prefix and suffix operations. Zbl 1330.68116 Lintzmayer, Carla Negri; Fertin, Guillaume; Dias, Zanoni 3 2015 (Prefix) reversal distance for (signed) strings with few blocks or small alphabets. Zbl 1362.68300 Bulteau, Laurent; Fertin, Guillaume; Komusiewicz, Christian 3 2016 On the \(S\)-Labeling problem. Zbl 1273.05191 Fertin, Guillaume; Vialette, Stéphane 3 2009 Beyond adjacency maximization: scaffold filling for new string distances. Zbl 1434.68725 Bulteau, Laurent; Fertin, Guillaume; Komusiewicz, Christian 3 2017 Sorting by multi-cut rearrangements. Zbl 1490.68303 Bulteau, Laurent; Fertin, Guillaume; Jean, Géraldine; Komusiewicz, Christian 3 2021 What makes the Arc-Preserving Subsequence problem hard? Zbl 1133.92312 Blin, Guillaume; Fertin, Guillaume; Rizzi, Romeo; Vialette, Stéphane 2 2005 On the approximability of comparing genomes with duplicates. Zbl 1132.68817 Angibaud, Sébastien; Fertin, Guillaume; Rusu, Irena 2 2008 Algorithmic aspects of heterogeneous biological networks comparison. Zbl 1342.68153 Blin, Guillaume; Fertin, Guillaume; Mohamed-Babou, Hafedh; Rusu, Irena; Sikora, Florian; Vialette, Stéphane 2 2011 Tractability and approximability of maximal strip recovery. Zbl 1339.92050 Bulteau, Laurent; Fertin, Guillaume; Jiang, Minghui; Rusu, Irena 2 2011 Extending the hardness of RNA secondary structure comparison. Zbl 1176.92018 Blin, Guillaume; Fertin, Guillaume; Rusu, Irena; Sinoquet, Christine 2 2007 Reversal distances for strings with few blocks or small alphabets. Zbl 1407.68573 Bulteau, Laurent; Fertin, Guillaume; Komusiewicz, Christian 2 2014 Decomposing cubic graphs into connected subgraphs of size three. Zbl 1476.68194 Bulteau, Laurent; Fertin, Guillaume; Labarre, Anthony; Rizzi, Romeo; Rusu, Irena 2 2016 On finding small 2-generating sets. Zbl 1248.68362 Fagnot, Isabelle; Fertin, Guillaume; Vialette, Stéphane 2 2009 Factor \(d\)-domatic colorings of graphs. Zbl 1012.05066 Alon, Noga; Fertin, Guillaume; Liestman, Arthur L.; Shermer, Thomas C.; Stacho, Ladislav 2 2003 Graph motif problems parameterized by dual. Zbl 1382.68106 Fertin, Guillaume; Komusiewicz, Christian 2 2016 Algorithmic aspects of the \(S\)-labeling problem. Zbl 1476.68206 Fertin, Guillaume; Rusu, Irena; Vialette, Stéphane 2 2016 Odd gossiping. Zbl 1372.68028 Fertin, Guillaume; Peters, Joseph G.; Raabe, Lynette; Xu, Charlie 2 2017 Recognizing recursive circulant graphs (extended abstract). Zbl 1412.05185 Fertin, Guillaume; Raspaud, André 2 2000 Genomes containing duplicates are hard to compare. (Extended abstract). Zbl 1155.68395 Chauve, Cedric; Fertin, Guillaume; Rizzi, Romeo; Vialette, Stéphane 2 2006 The \(S\)-labeling problem: an algorithmic tour. Zbl 1390.05202 Fertin, Guillaume; Rusu, Irena; Vialette, Stéphane 2 2018 Vertex labeling and routing in expanded Apollonian networks. Zbl 1152.90359 Zhang, Zhongzhi; Comellas, Francesc; Fertin, Guillaume; Raspaud, André; Rong, Lili; Zhou, Shuigeng 1 2008 Common structured patterns in linear graphs: Approximation and combinatorics. Zbl 1138.68476 Fertin, Guillaume; Hermelin, Danny; Rizzi, Romeo; Vialette, Stéphane 1 2007 Revisiting the minimum breakpoint linearization problem. Zbl 1284.92055 Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena 1 2010 On the structure of minimum broadcast digraphs. Zbl 0948.68132 Fertin, G. 1 2000 Compounding of gossip graphs. Zbl 0960.90010 Fertin, Guillaume; Labahn, Roger 1 2000 Routing permutations in the hypercube. Zbl 0952.68003 Baudon, Olivier; Fertin, Guillaume; Havel, Ivan 1 1999 Routing permutations and 2-1 routing requests in the hypercube. Zbl 0983.68018 Baudon, Olivier; Fertin, Guillaume; Havel, Ivan 1 2001 Diameter of the Knödel graph. Zbl 0988.68127 Fertin, Guillaume; Raspaud, André; Schröder, Heiko; Sýkora, Ondrej; Vrto, Imrich 1 2000 Finding occurrences of protein complexes in protein-protein interaction graphs. Zbl 1162.92015 Fertin, Guillaume; Rizzi, Romeo; Vialette, Stéphane 1 2009 Edge-disjoint spanners in Cartesian products of graphs. Zbl 1066.05062 Fertin, Guillaume; Liestman, Arthur L.; Shermer, Thomas C.; Stacho, Ladislav 1 2005 Some algorithmic results for [2]-sumset covers. Zbl 1366.68088 Bulteau, Laurent; Fertin, Guillaume; Rizzi, Romeo; Vialette, Stéphane 1 2015 Prefix and suffix reversals on strings. Zbl 1453.68227 Fertin, Guillaume; Jankowiak, Loïc; Jean, Géraldine 1 2015 Sorting permutations and binary strings by length-weighted rearrangements. Zbl 1386.68236 Lintzmayer, Carla Negri; Fertin, Guillaume; Dias, Zanoni 1 2018 Towards an algorithmic guide to Spiral Galaxies. Zbl 1327.68131 Fertin, Guillaume; Jamshidi, Shahrad; Komusiewicz, Christian 1 2015 Hierarchical broadcast and gossip networks. Zbl 1014.68003 Fertin, Guillaume 1 2000 Path-driven orientation of mixed graphs. Zbl 1304.05081 Fertin, Guillaume; Mohamed-Babou, Hafedh; Rusu, Irena 1 2015 Finding supported paths in heterogeneous networks. Zbl 1461.68151 Fertin, Guillaume; Komusiewicz, Christian; Mohamed-Babou, Hafedh; Rusu, Irena 1 2015 Sorting by \(k\)-cuts on signed permutations. Zbl 1496.92053 Rodrigues Oliveira, Andre; Oliveira Alexandrino, Alexsandro; Jean, Géraldine; Fertin, Guillaume; Dias, Ulisses; Dias, Zanoni 1 2022 A 3.5-approximation algorithm for sorting by intergenic transpositions. Zbl 1500.92057 Oliveira, Andre Rodrigues; Jean, Géraldine; Fertin, Guillaume; Brito, Klairton Lima; Dias, Ulisses; Dias, Zanoni 1 2020 Revisiting the minimum breakpoint linearization problem. Zbl 1295.92020 Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena 1 2013 Sorting by \(k\)-cuts on signed permutations. Zbl 1496.92053 Rodrigues Oliveira, Andre; Oliveira Alexandrino, Alexsandro; Jean, Géraldine; Fertin, Guillaume; Dias, Ulisses; Dias, Zanoni 1 2022 Sorting by multi-cut rearrangements. Zbl 1490.68303 Bulteau, Laurent; Fertin, Guillaume; Jean, Géraldine; Komusiewicz, Christian 3 2021 A 3.5-approximation algorithm for sorting by intergenic transpositions. Zbl 1500.92057 Oliveira, Andre Rodrigues; Jean, Géraldine; Fertin, Guillaume; Brito, Klairton Lima; Dias, Ulisses; Dias, Zanoni 1 2020 The \(S\)-labeling problem: an algorithmic tour. Zbl 1390.05202 Fertin, Guillaume; Rusu, Irena; Vialette, Stéphane 2 2018 Sorting permutations and binary strings by length-weighted rearrangements. Zbl 1386.68236 Lintzmayer, Carla Negri; Fertin, Guillaume; Dias, Zanoni 1 2018 Algorithmic aspects of the maximum colorful arborescence problem. Zbl 1485.68181 Fertin, Guillaume; Fradin, Julien; Jean, Géraldine 5 2017 Beyond adjacency maximization: scaffold filling for new string distances. Zbl 1434.68725 Bulteau, Laurent; Fertin, Guillaume; Komusiewicz, Christian 3 2017 Odd gossiping. Zbl 1372.68028 Fertin, Guillaume; Peters, Joseph G.; Raabe, Lynette; Xu, Charlie 2 2017 (Prefix) reversal distance for (signed) strings with few blocks or small alphabets. Zbl 1362.68300 Bulteau, Laurent; Fertin, Guillaume; Komusiewicz, Christian 3 2016 Decomposing cubic graphs into connected subgraphs of size three. Zbl 1476.68194 Bulteau, Laurent; Fertin, Guillaume; Labarre, Anthony; Rizzi, Romeo; Rusu, Irena 2 2016 Graph motif problems parameterized by dual. Zbl 1382.68106 Fertin, Guillaume; Komusiewicz, Christian 2 2016 Algorithmic aspects of the \(S\)-labeling problem. Zbl 1476.68206 Fertin, Guillaume; Rusu, Irena; Vialette, Stéphane 2 2016 Pancake flipping is hard. Zbl 1328.68084 Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena 13 2015 Approximation algorithms for sorting by length-weighted prefix and suffix operations. Zbl 1330.68116 Lintzmayer, Carla Negri; Fertin, Guillaume; Dias, Zanoni 3 2015 Some algorithmic results for [2]-sumset covers. Zbl 1366.68088 Bulteau, Laurent; Fertin, Guillaume; Rizzi, Romeo; Vialette, Stéphane 1 2015 Prefix and suffix reversals on strings. Zbl 1453.68227 Fertin, Guillaume; Jankowiak, Loïc; Jean, Géraldine 1 2015 Towards an algorithmic guide to Spiral Galaxies. Zbl 1327.68131 Fertin, Guillaume; Jamshidi, Shahrad; Komusiewicz, Christian 1 2015 Path-driven orientation of mixed graphs. Zbl 1304.05081 Fertin, Guillaume; Mohamed-Babou, Hafedh; Rusu, Irena 1 2015 Finding supported paths in heterogeneous networks. Zbl 1461.68151 Fertin, Guillaume; Komusiewicz, Christian; Mohamed-Babou, Hafedh; Rusu, Irena 1 2015 Reversal distances for strings with few blocks or small alphabets. Zbl 1407.68573 Bulteau, Laurent; Fertin, Guillaume; Komusiewicz, Christian 2 2014 Finding approximate and constrained motifs in graphs. Zbl 1297.05081 Dondi, Riccardo; Fertin, Guillaume; Vialette, Stéphane 6 2013 Maximal strip recovery problem with gaps: hardness and approximation algorithms. Zbl 1280.68094 Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena 4 2013 Revisiting the minimum breakpoint linearization problem. Zbl 1295.92020 Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena 1 2013 Sorting by transpositions is difficult. Zbl 1256.05004 Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena 34 2012 Pancake flipping is hard. Zbl 1329.68132 Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena 10 2012 Tractability and approximability of maximal strip recovery. Zbl 1252.68349 Bulteau, Laurent; Fertin, Guillaume; Jiang, Minghui; Rusu, Irena 6 2012 Upper and lower bounds for finding connected motifs in vertex-colored graphs. Zbl 1210.68060 Fellows, Michael R.; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane 31 2011 Complexity issues in vertex-colored graph pattern matching. Zbl 1222.05053 Dondi, Riccardo; Fertin, Guillaume; Vialette, Stéphane 18 2011 Finding approximate and constrained motifs in graphs. Zbl 1339.92025 Dondi, Riccardo; Fertin, Guillaume; Vialette, Stéphane 8 2011 Sorting by transpositions is difficult. Zbl 1334.68085 Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena 7 2011 Algorithmic aspects of heterogeneous biological networks comparison. Zbl 1342.68153 Blin, Guillaume; Fertin, Guillaume; Mohamed-Babou, Hafedh; Rusu, Irena; Sikora, Florian; Vialette, Stéphane 2 2011 Tractability and approximability of maximal strip recovery. Zbl 1339.92050 Bulteau, Laurent; Fertin, Guillaume; Jiang, Minghui; Rusu, Irena 2 2011 Revisiting the minimum breakpoint linearization problem. Zbl 1284.92055 Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena 1 2010 Combinatorics of genome rearrangements. Zbl 1170.92022 Fertin, Guillaume; Labarre, Anthony; Rusu, Irena; Tannier, Éric; Vialette, Stéphane 77 2009 On the approximability of comparing genomes with duplicates. Zbl 1170.68049 Angibaud, Sébastien; Fertin, Guillaume; Rusu, Irena; Thévenin, Annelyse; Vialette, Stéphane 20 2009 Maximal strip recovery problem with gaps: hardness and approximation algorithms. Zbl 1273.68406 Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena 10 2009 The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximated. Zbl 1211.68509 Blin, Guillaume; Fertin, Guillaume; Sikora, Florian; Vialette, Stéphane 8 2009 Maximum motif problem in vertex-colored graphs. Zbl 1247.68198 Dondi, Riccardo; Fertin, Guillaume; Vialette, Stéphane 7 2009 On the \(S\)-Labeling problem. Zbl 1273.05191 Fertin, Guillaume; Vialette, Stéphane 3 2009 On finding small 2-generating sets. Zbl 1248.68362 Fagnot, Isabelle; Fertin, Guillaume; Vialette, Stéphane 2 2009 Finding occurrences of protein complexes in protein-protein interaction graphs. Zbl 1162.92015 Fertin, Guillaume; Rizzi, Romeo; Vialette, Stéphane 1 2009 Acyclic coloring of graphs of maximum degree five: nine colors are enough. Zbl 1183.05027 Fertin, Guillaume; Raspaud, André 18 2008 Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. Zbl 1154.05326 Blin, Guillaume; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane 4 2008 On the approximability of comparing genomes with duplicates. Zbl 1132.68817 Angibaud, Sébastien; Fertin, Guillaume; Rusu, Irena 2 2008 Vertex labeling and routing in expanded Apollonian networks. Zbl 1152.90359 Zhang, Zhongzhi; Comellas, Francesc; Fertin, Guillaume; Raspaud, André; Rong, Lili; Zhou, Shuigeng 1 2008 Sharp tractability borderlines for finding connected motifs in vertex-colored graphs. Zbl 1171.68497 Fellows, Michael R.; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane 19 2007 Extracting constrained 2-interval subsets in 2-interval sets. Zbl 1125.68085 Blin, Guillaume; Fertin, Guillaume; Vialette, Stéphane 5 2007 \(L(p,q)\) labeling of \(d\)-dimensional grids. Zbl 1119.05096 Fertin, Guillaume; Raspaud, André 3 2007 Extending the hardness of RNA secondary structure comparison. Zbl 1176.92018 Blin, Guillaume; Fertin, Guillaume; Rusu, Irena; Sinoquet, Christine 2 2007 Common structured patterns in linear graphs: Approximation and combinatorics. Zbl 1138.68476 Fertin, Guillaume; Hermelin, Danny; Rizzi, Romeo; Vialette, Stéphane 1 2007 High-dimensional Apollonian networks. Zbl 1086.68017 Zhang, Zhongzhi; Comellas, Francesc; Fertin, Guillaume; Rong, Lili 13 2006 Exemplar longest common subsequence. Zbl 1155.68393 Bonizzoni, Paola; Della Vedova, Gianluca; Dondi, Riccardo; Fertin, Guillaume; Vialette, Stéphane 6 2006 Genomes containing duplicates are hard to compare. (Extended abstract). Zbl 1155.68395 Chauve, Cedric; Fertin, Guillaume; Rizzi, Romeo; Vialette, Stéphane 2 2006 Finding exact and maximum occurrences of protein complexes in protein-protein interaction graphs. Zbl 1156.92317 Fertin, Guillaume; Rizzi, Romeo; Vialette, Stéphane 7 2005 Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. Zbl 1171.92316 Blin, Guillaume; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane 5 2005 Acyclic coloring of graphs of maximum degree \(\Delta \). Zbl 1192.05049 Fertin, Guillaume; Raspaud, André 5 2005 What makes the Arc-Preserving Subsequence problem hard? Zbl 1128.68361 Blin, Guillaume; Fertin, Guillaume; Rizzi, Romeo; Vialette, Stéphane 3 2005 What makes the Arc-Preserving Subsequence problem hard? Zbl 1133.92312 Blin, Guillaume; Fertin, Guillaume; Rizzi, Romeo; Vialette, Stéphane 2 2005 Edge-disjoint spanners in Cartesian products of graphs. Zbl 1066.05062 Fertin, Guillaume; Liestman, Arthur L.; Shermer, Thomas C.; Stacho, Ladislav 1 2005 Star coloring of graphs. Zbl 1055.05051 Fertin, Guillaume; Raspaud, André; Reed, Bruce 67 2004 A survey on Knödel graphs. Zbl 1062.68086 Fertin, Guillaume; Raspaud, André 21 2004 New results for the 2-interval pattern problem. Zbl 1103.68059 Blin, Guillaume; Fertin, Guillaume; Vialette, Stéphane 6 2004 On maximal instances for the original syntenic distance. Zbl 1071.92502 Chauve, Cedric; Fertin, Guillaume 3 2004 Acyclic and \(k\)-distance coloring of the grid. Zbl 1175.68293 Fertin, Guillaume; Godard, Emmanuel; Raspaud, André 24 2003 On the oriented chromatic number of grids. Zbl 1173.68604 Fertin, Guillaume; Raspaud, André; Roychowdhury, Arup 18 2003 Factor \(d\)-domatic colorings of graphs. Zbl 1012.05066 Alon, Noga; Fertin, Guillaume; Liestman, Arthur L.; Shermer, Thomas C.; Stacho, Ladislav 2 2003 Minimum feedback vertex set and acyclic coloring. Zbl 1042.68090 Fertin, Guillaume; Godard, Emmanuel; Raspaud, André 18 2002 On star coloring of graphs. Zbl 1042.68628 Fertin, Guillaume; Raspaud, André; Reed, Bruce 19 2001 Routing permutations and 2-1 routing requests in the hypercube. Zbl 0983.68018 Baudon, Olivier; Fertin, Guillaume; Havel, Ivan 1 2001 A study of minimum gossip graphs. Zbl 0983.94002 Fertin, Guillaume 5 2000 Recognizing recursive circulant graphs (extended abstract). Zbl 1412.05185 Fertin, Guillaume; Raspaud, André 2 2000 On the structure of minimum broadcast digraphs. Zbl 0948.68132 Fertin, G. 1 2000 Compounding of gossip graphs. Zbl 0960.90010 Fertin, Guillaume; Labahn, Roger 1 2000 Diameter of the Knödel graph. Zbl 0988.68127 Fertin, Guillaume; Raspaud, André; Schröder, Heiko; Sýkora, Ondrej; Vrto, Imrich 1 2000 Hierarchical broadcast and gossip networks. Zbl 1014.68003 Fertin, Guillaume 1 2000 Routing permutations in the hypercube. Zbl 0952.68003 Baudon, Olivier; Fertin, Guillaume; Havel, Ivan 1 1999 Families of graphs having broadcasting and gossiping properties. Zbl 0918.68083 Fertin, Guillaume; Raspaud, André 4 1998 all cited Publications top 5 cited Publications all top 5 Cited by 781 Authors 45 Fertin, Guillaume 18 Vialette, Stéphane 17 Zhu, Binhai 16 Rusu, Irena 15 Raspaud, André 12 Bulteau, Laurent 12 Dias, Zanoni 12 Jiang, Haitao 11 Dondi, Riccardo 9 Jean, Géraldine 9 Labarre, Anthony 9 Zhu, Daming 8 Rizzi, Romeo 7 Chitturi, Bhadrachalam 7 Dias, Ulisses 7 Jiang, Minghui 7 Miao, Lianying 7 Zehavi, Meirav 6 Alexandrino, Alexsandro Oliveira 6 Harutyunyan, Hovhannes A. 6 Komusiewicz, Christian 6 Sikora, Florian 6 Wood, David Ronald 5 Braga, Marília D. V. 5 Dybizbański, Janusz 5 Fellows, Michael Ralph 5 Francis, Andrew R. 5 Hermelin, Danny 5 Hou, Jianfeng 5 Kerdjoudj, Samia 5 Lokshtanov, Daniel 5 Oliveira, Andre Rodrigues 5 Pilipczuk, Marcin L. 5 Pinter, Ron Yair 5 Wang, Juan 4 Brito, Klairton Lima 4 Cygan, Marek 4 Fernandes, Cristina G. 4 Li, Zhiyuan 4 Lin, Guohui 4 Lintzmayer, Carla Negri 4 MacGillivray, Gary 4 Martinez, Fábio Viduani 4 Nenca, Anna 4 Nešetřil, Jaroslav 4 Ossona de Mendez, Patrice 4 Pilipczuk, Michał 4 Shachnai, Hadas 4 Wang, Jianxin 4 Zhang, Zhongzhi 4 Zhou, Sanming 3 Bensmail, Julien 3 Borowiecki, Mieczysław 3 Braga, Mónica 3 Chauve, Cedric 3 Chen, Zhixiang 3 Duffy, Christopher 3 Egri-Nagy, Attila 3 Ferreira, Carlos Eduardo 3 Fu, Bin 3 Goebel, Randy G. 3 Guo, Jiong 3 Lafond, Manuel 3 Li, Zepeng 3 Li, Zhong 3 Liestman, Arthur L. 3 Ma, Jingjing 3 Manoussakis, Yannis G. 3 Marenco, Javier L. 3 Mehrabian, Abbas 3 Mohar, Bojan 3 Mondal, Debajyoti 3 Montassier, Mickaël 3 Pinlou, Alexandre 3 Rahman, Mohammad Sohel 3 Reidys, Christian Michael 3 Sawada, Joe 3 Shao, Zehui 3 Song, Wenyao 3 Sopena, Éric 3 Stacho, Ladislav 3 Stefanes, Marco A. 3 Stoye, Jens 3 Sumner, Jeremy G. 3 Swarts, Jacobus Stephanus 3 Szepietowski, Andrzej 3 Tannier, Eric 3 Tjandraatmadja, Christian 3 Vivin, J. Vernold 3 Wakabayashi, Yoshiko 3 Wang, Lusheng 3 Wang, Wei-Fan 3 Williams, Aaron Michael 3 Xu, Jin 3 Zhu, Enqiang 3 Zou, Peng 2 Adi, Said Sadique 2 Anglès d’Auriac, Jean-Alexandre 2 Antony, Cyriac 2 Aravind, N. R. ...and 681 more Authors all top 5 Cited in 79 Serials 55 Theoretical Computer Science 44 Discrete Applied Mathematics 33 Discrete Mathematics 20 Information Processing Letters 20 Journal of Combinatorial Optimization 17 Journal of Discrete Algorithms 13 Algorithmica 9 European Journal of Combinatorics 9 The Electronic Journal of Combinatorics 9 Discussiones Mathematicae. Graph Theory 9 Discrete Mathematics, Algorithms and Applications 8 Graphs and Combinatorics 7 Journal of Computer and System Sciences 7 Journal of Graph Theory 7 SIAM Journal on Discrete Mathematics 5 Computers & Operations Research 4 Journal of Mathematical Biology 4 The Australasian Journal of Combinatorics 4 Acta Mathematica Sinica. English Series 3 Bulletin of Mathematical Biology 3 Applied Mathematics and Computation 3 Advances in Applied Mathematics 3 Random Structures & Algorithms 3 Discrete Mathematics and Theoretical Computer Science. DMTCS 2 Journal of Combinatorial Theory. Series B 2 SIAM Journal on Computing 2 Computational Geometry 2 Aequationes Mathematicae 2 RAIRO. Operations Research 2 The European Physical Journal B. Condensed Matter and Complex Systems 2 Algorithms 2 Journal of Theoretical Biology 2 Prikladnaya Diskretnaya Matematika 1 Artificial Intelligence 1 Computers & Mathematics with Applications 1 Physica A 1 Acta Mathematica Vietnamica 1 Information Sciences 1 Networks 1 Ergodic Theory and Dynamical Systems 1 Combinatorica 1 Order 1 Journal of Symbolic Computation 1 Information and Computation 1 Facta Universitatis. Series Mathematics and Informatics 1 SIAM Journal on Matrix Analysis and Applications 1 Annals of Operations Research 1 European Journal of Operational Research 1 International Journal of Computer Mathematics 1 Foundations of Computing and Decision Sciences 1 Combinatorics, Probability and Computing 1 Computational and Applied Mathematics 1 Fractals 1 Complexity 1 International Transactions in Operational Research 1 Theory of Computing Systems 1 Optimization Methods & Software 1 Taiwanese Journal of Mathematics 1 Journal of Graph Algorithms and Applications 1 Annals of Combinatorics 1 Chaos 1 Communications de la Faculté des Sciences de l’Université d’Ankara. Séries A1. Mathematics and Statistics 1 Fundamenta Informaticae 1 Bulletin of the Malaysian Mathematical Sciences Society. Second Series 1 South East Asian Journal of Mathematics and Mathematical Sciences 1 ACM Journal of Experimental Algorithmics 1 Internet Mathematics 1 Discrete Optimization 1 Proyecciones 1 Frontiers of Mathematics in China 1 Logical Methods in Computer Science 1 Asian-European Journal of Mathematics 1 Science China. Mathematics 1 Sankhyā. Series B 1 Computer Science Review 1 Electronic Journal of Graph Theory and Applications 1 Open Mathematics 1 Communications in Combinatorics and Optimization 1 Advances in Combinatorics all top 5 Cited in 21 Fields 301 Combinatorics (05-XX) 205 Computer science (68-XX) 99 Biology and other natural sciences (92-XX) 44 Operations research, mathematical programming (90-XX) 14 Group theory and generalizations (20-XX) 8 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 7 Information and communication theory, circuits (94-XX) 6 Probability theory and stochastic processes (60-XX) 5 Number theory (11-XX) 4 Linear and multilinear algebra; matrix theory (15-XX) 2 Mathematical logic and foundations (03-XX) 2 Measure and integration (28-XX) 2 Convex and discrete geometry (52-XX) 2 Statistics (62-XX) 2 Numerical analysis (65-XX) 1 General and overarching topics; collections (00-XX) 1 Order, lattices, ordered algebraic structures (06-XX) 1 Functions of a complex variable (30-XX) 1 Dynamical systems and ergodic theory (37-XX) 1 Manifolds and cell complexes (57-XX) 1 Statistical mechanics, structure of matter (82-XX) Citations by Year