×

zbMATH — the first resource for mathematics

Fertin, Guillaume

Compute Distance To:
Author ID: fertin.guillaume Recent zbMATH articles by "Fertin, Guillaume"
Published as: Fertin, G.; Fertin, Guillaume
External Links: MGP · ORCID
Documents Indexed: 87 Publications since 1998, including 2 Books
Reviewing Activity: 4 Reviews

Publications by Year

Citations contained in zbMATH Open

72 Publications have been cited 453 times in 338 Documents Cited by Year
Combinatorics of genome rearrangements. Zbl 1170.92022
Fertin, Guillaume; Labarre, Anthony; Rusu, Irena; Tannier, Éric; Vialette, Stéphane
56
2009
Star coloring of graphs. Zbl 1055.05051
Fertin, Guillaume; Raspaud, André; Reed, Bruce
48
2004
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
22
2011
Sorting by transpositions is difficult. Zbl 1256.05004
Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena
20
2012
Acyclic and \(k\)-distance coloring of the grid. Zbl 1175.68293
Fertin, Guillaume; Godard, Emmanuel; Raspaud, André
19
2003
Complexity issues in vertex-colored graph pattern matching. Zbl 1222.05053
Dondi, Riccardo; Fertin, Guillaume; Vialette, Stéphane
15
2011
On the oriented chromatic number of grids. Zbl 1173.68604
Fertin, Guillaume; Raspaud, André; Roychowdhury, Arup
15
2003
Sharp tractability borderlines for finding connected motifs in vertex-colored graphs. Zbl 1171.68497
Fellows, Michael R.; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane
14
2007
A survey on Knödel graphs. Zbl 1062.68086
Fertin, Guillaume; Raspaud, André
14
2004
Minimum feedback vertex set and acyclic coloring. Zbl 1042.68090
Fertin, Guillaume; Godard, Emmanuel; Raspaud, André
14
2002
On star coloring of graphs. Zbl 1042.68628
Fertin, Guillaume; Raspaud, André; Reed, Bruce
14
2001
On the approximability of comparing genomes with duplicates. Zbl 1170.68049
Angibaud, Sébastien; Fertin, Guillaume; Rusu, Irena; Thévenin, Annelyse; Vialette, Stéphane
13
2009
Acyclic coloring of graphs of maximum degree five: nine colors are enough. Zbl 1183.05027
Fertin, Guillaume; Raspaud, André
13
2008
Exemplar longest common subsequence. Zbl 1155.68393
Bonizzoni, Paola; Della Vedova, Gianluca; Dondi, Riccardo; Fertin, Guillaume; Vialette, Stéphane
12
2006
High-dimensional Apollonian networks. Zbl 1086.68017
Zhang, Zhongzhi; Comellas, Francesc; Fertin, Guillaume; Rong, Lili
11
2006
Maximal strip recovery problem with gaps: hardness and approximation algorithms. Zbl 1273.68406
Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena
9
2009
Pancake flipping is hard. Zbl 1329.68132
Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena
8
2012
Finding approximate and constrained motifs in graphs. Zbl 1339.92025
Dondi, Riccardo; Fertin, Guillaume; Vialette, Stéphane
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
Pancake flipping is hard. Zbl 1328.68084
Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena
6
2015
Finding approximate and constrained motifs in graphs. Zbl 1297.05081
Dondi, Riccardo; Fertin, Guillaume; Vialette, Stéphane
6
2013
Sorting by transpositions is difficult. Zbl 1334.68085
Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena
5
2011
The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximated. Zbl 1211.68509
Blin, Guillaume; Fertin, Guillaume; Sikora, Florian; Vialette, Stéphane
5
2009
New results for the 2-interval pattern problem. Zbl 1103.68059
Blin, Guillaume; Fertin, Guillaume; Vialette, Stéphane
5
2004
A study of minimum gossip graphs. Zbl 0983.94002
Fertin, Guillaume
5
2000
Tractability and approximability of maximal strip recovery. Zbl 1252.68349
Bulteau, Laurent; Fertin, Guillaume; Jiang, Minghui; Rusu, Irena
4
2012
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
Acyclic coloring of graphs of maximum degree \(\Delta \). Zbl 1192.05049
Fertin, Guillaume; Raspaud, André
4
2005
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. Zbl 1171.92316
Blin, Guillaume; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane
4
2005
Approximation algorithms for sorting by length-weighted prefix and suffix operations. Zbl 1330.68116
Lintzmayer, Carla Negri; Fertin, Guillaume; Dias, Zanoni
3
2015
Extracting constrained 2-interval subsets in 2-interval sets. Zbl 1125.68085
Blin, Guillaume; Fertin, Guillaume; Vialette, Stéphane
3
2007
\(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
Optimal odd gossiping. Zbl 1423.68047
Fertin, Guillaume; Peters, Joseph G.
2
2018
Prefix and suffix reversals on strings. Zbl 1453.68228
Fertin, Guillaume; Jankowiak, Loïc; Jean, Géraldine
2
2018
Algorithmic aspects of the maximum colorful arborescence problem. Zbl 06721520
Fertin, Guillaume; Fradin, Julien; Jean, Géraldine
2
2017
Odd gossiping. Zbl 1372.68028
Fertin, Guillaume; Peters, Joseph G.; Raabe, Lynette; Xu, Charlie
2
2017
Graph motif problems parameterized by dual. Zbl 1382.68106
Fertin, Guillaume; Komusiewicz, Christian
2
2016
Algorithmic aspects of the \(S\)-labeling problem. Zbl 06562483
Fertin, Guillaume; Rusu, Irena; Vialette, Stéphane
2
2016
Maximal strip recovery problem with gaps: hardness and approximation algorithms. Zbl 1280.68094
Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena
2
2013
Tractability and approximability of maximal strip recovery. Zbl 1339.92050
Bulteau, Laurent; Fertin, Guillaume; Jiang, Minghui; Rusu, Irena
2
2011
On the \(S\)-Labeling problem. Zbl 1273.05191
Fertin, Guillaume; Vialette, Stéphane
2
2009
On the approximability of comparing genomes with duplicates. Zbl 1132.68817
Angibaud, Sébastien; Fertin, Guillaume; Rusu, Irena
2
2008
Extending the hardness of RNA secondary structure comparison. Zbl 1176.92018
Blin, Guillaume; Fertin, Guillaume; Rusu, Irena; Sinoquet, Christine
2
2007
What makes the Arc-Preserving Subsequence problem hard? Zbl 1133.92312
Blin, Guillaume; Fertin, Guillaume; Rizzi, Romeo; Vialette, Stéphane
2
2005
Routing permutations and 2-1 routing requests in the hypercube. Zbl 0983.68018
Baudon, Olivier; Fertin, Guillaume; Havel, Ivan
2
2001
Recognizing recursive circulant graphs (extended abstract). Zbl 1412.05185
Fertin, Guillaume; Raspaud, André
2
2000
Families of graphs having broadcasting and gossiping properties. Zbl 0918.68083
Fertin, Guillaume; Raspaud, André
2
1998
The \(S\)-labeling problem: an algorithmic tour. Zbl 1390.05202
Fertin, Guillaume; Rusu, Irena; Vialette, Stéphane
1
2018
Sorting permutations and binary strings by length-weighted rearrangements. Zbl 1386.68236
Lintzmayer, Carla Negri; Fertin, Guillaume; Dias, Zanoni
1
2018
Beyond adjacency maximization: scaffold filling for new string distances. Zbl 1434.68725
Bulteau, Laurent; Fertin, Guillaume; Komusiewicz, Christian
1
2017
Decomposing cubic graphs into connected subgraphs of size three. Zbl 06622046
Bulteau, Laurent; Fertin, Guillaume; Labarre, Anthony; Rizzi, Romeo; Rusu, Irena
1
2016
(Prefix) reversal distance for (signed) strings with few blocks or small alphabets. Zbl 1362.68300
Bulteau, Laurent; Fertin, Guillaume; Komusiewicz, Christian
1
2016
Path-driven orientation of mixed graphs. Zbl 1304.05081
Fertin, Guillaume; 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
1
2014
Revisiting the minimum breakpoint linearization problem. Zbl 1295.92020
Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena
1
2013
Algorithmic aspects of heterogeneous biological networks comparison. Zbl 1342.68153
Blin, Guillaume; Fertin, Guillaume; Mohamed-Babou, Hafedh; Rusu, Irena; Sikora, Florian; Vialette, Stéphane
1
2011
Revisiting the minimum breakpoint linearization problem. Zbl 1284.92055
Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena
1
2010
On finding small 2-generating sets. Zbl 1248.68362
Fagnot, Isabelle; Fertin, Guillaume; Vialette, Stéphane
1
2009
Finding occurrences of protein complexes in protein-protein interaction graphs. Zbl 1162.92015
Fertin, Guillaume; Rizzi, Romeo; Vialette, Stéphane
1
2009
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
Genomes containing duplicates are hard to compare. (Extended abstract). Zbl 1155.68395
Chauve, Cedric; Fertin, Guillaume; Rizzi, Romeo; Vialette, Stéphane
1
2006
Edge-disjoint spanners in Cartesian products of graphs. Zbl 1066.05062
Fertin, Guillaume; Liestman, Arthur L.; Shermer, Thomas C.; Stacho, Ladislav
1
2005
Factor \(d\)-domatic colorings of graphs. Zbl 1012.05066
Alon, Noga; Fertin, Guillaume; Liestman, Arthur L.; Shermer, Thomas C.; Stacho, Ladislav
1
2003
Hierarchical broadcast and gossip networks. Zbl 1014.68003
Fertin, Guillaume
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
Compounding of gossip graphs. Zbl 0960.90010
Fertin, Guillaume; Labahn, Roger
1
2000
On the structure of minimum broadcast digraphs. Zbl 0948.68132
Fertin, G.
1
2000
Routing permutations in the hypercube. Zbl 0952.68003
Baudon, Olivier; Fertin, Guillaume; Havel, Ivan
1
1999
Optimal odd gossiping. Zbl 1423.68047
Fertin, Guillaume; Peters, Joseph G.
2
2018
Prefix and suffix reversals on strings. Zbl 1453.68228
Fertin, Guillaume; Jankowiak, Loïc; Jean, Géraldine
2
2018
The \(S\)-labeling problem: an algorithmic tour. Zbl 1390.05202
Fertin, Guillaume; Rusu, Irena; Vialette, Stéphane
1
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 06721520
Fertin, Guillaume; Fradin, Julien; Jean, Géraldine
2
2017
Odd gossiping. Zbl 1372.68028
Fertin, Guillaume; Peters, Joseph G.; Raabe, Lynette; Xu, Charlie
2
2017
Beyond adjacency maximization: scaffold filling for new string distances. Zbl 1434.68725
Bulteau, Laurent; Fertin, Guillaume; Komusiewicz, Christian
1
2017
Graph motif problems parameterized by dual. Zbl 1382.68106
Fertin, Guillaume; Komusiewicz, Christian
2
2016
Algorithmic aspects of the \(S\)-labeling problem. Zbl 06562483
Fertin, Guillaume; Rusu, Irena; Vialette, Stéphane
2
2016
Decomposing cubic graphs into connected subgraphs of size three. Zbl 06622046
Bulteau, Laurent; Fertin, Guillaume; Labarre, Anthony; Rizzi, Romeo; Rusu, Irena
1
2016
(Prefix) reversal distance for (signed) strings with few blocks or small alphabets. Zbl 1362.68300
Bulteau, Laurent; Fertin, Guillaume; Komusiewicz, Christian
1
2016
Pancake flipping is hard. Zbl 1328.68084
Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena
6
2015
Approximation algorithms for sorting by length-weighted prefix and suffix operations. Zbl 1330.68116
Lintzmayer, Carla Negri; Fertin, Guillaume; Dias, Zanoni
3
2015
Path-driven orientation of mixed graphs. Zbl 1304.05081
Fertin, Guillaume; 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
1
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
2
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
20
2012
Pancake flipping is hard. Zbl 1329.68132
Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena
8
2012
Tractability and approximability of maximal strip recovery. Zbl 1252.68349
Bulteau, Laurent; Fertin, Guillaume; Jiang, Minghui; Rusu, Irena
4
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
22
2011
Complexity issues in vertex-colored graph pattern matching. Zbl 1222.05053
Dondi, Riccardo; Fertin, Guillaume; Vialette, Stéphane
15
2011
Finding approximate and constrained motifs in graphs. Zbl 1339.92025
Dondi, Riccardo; Fertin, Guillaume; Vialette, Stéphane
7
2011
Sorting by transpositions is difficult. Zbl 1334.68085
Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena
5
2011
Tractability and approximability of maximal strip recovery. Zbl 1339.92050
Bulteau, Laurent; Fertin, Guillaume; Jiang, Minghui; Rusu, Irena
2
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
1
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
56
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
13
2009
Maximal strip recovery problem with gaps: hardness and approximation algorithms. Zbl 1273.68406
Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena
9
2009
Maximum motif problem in vertex-colored graphs. Zbl 1247.68198
Dondi, Riccardo; Fertin, Guillaume; Vialette, Stéphane
7
2009
The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximated. Zbl 1211.68509
Blin, Guillaume; Fertin, Guillaume; Sikora, Florian; Vialette, Stéphane
5
2009
On the \(S\)-Labeling problem. Zbl 1273.05191
Fertin, Guillaume; Vialette, Stéphane
2
2009
On finding small 2-generating sets. Zbl 1248.68362
Fagnot, Isabelle; Fertin, Guillaume; Vialette, Stéphane
1
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é
13
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
14
2007
Extracting constrained 2-interval subsets in 2-interval sets. Zbl 1125.68085
Blin, Guillaume; Fertin, Guillaume; Vialette, Stéphane
3
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
Exemplar longest common subsequence. Zbl 1155.68393
Bonizzoni, Paola; Della Vedova, Gianluca; Dondi, Riccardo; Fertin, Guillaume; Vialette, Stéphane
12
2006
High-dimensional Apollonian networks. Zbl 1086.68017
Zhang, Zhongzhi; Comellas, Francesc; Fertin, Guillaume; Rong, Lili
11
2006
Genomes containing duplicates are hard to compare. (Extended abstract). Zbl 1155.68395
Chauve, Cedric; Fertin, Guillaume; Rizzi, Romeo; Vialette, Stéphane
1
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
Acyclic coloring of graphs of maximum degree \(\Delta \). Zbl 1192.05049
Fertin, Guillaume; Raspaud, André
4
2005
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. Zbl 1171.92316
Blin, Guillaume; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane
4
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
48
2004
A survey on Knödel graphs. Zbl 1062.68086
Fertin, Guillaume; Raspaud, André
14
2004
New results for the 2-interval pattern problem. Zbl 1103.68059
Blin, Guillaume; Fertin, Guillaume; Vialette, Stéphane
5
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é
19
2003
On the oriented chromatic number of grids. Zbl 1173.68604
Fertin, Guillaume; Raspaud, André; Roychowdhury, Arup
15
2003
Factor \(d\)-domatic colorings of graphs. Zbl 1012.05066
Alon, Noga; Fertin, Guillaume; Liestman, Arthur L.; Shermer, Thomas C.; Stacho, Ladislav
1
2003
Minimum feedback vertex set and acyclic coloring. Zbl 1042.68090
Fertin, Guillaume; Godard, Emmanuel; Raspaud, André
14
2002
On star coloring of graphs. Zbl 1042.68628
Fertin, Guillaume; Raspaud, André; Reed, Bruce
14
2001
Routing permutations and 2-1 routing requests in the hypercube. Zbl 0983.68018
Baudon, Olivier; Fertin, Guillaume; Havel, Ivan
2
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
Hierarchical broadcast and gossip networks. Zbl 1014.68003
Fertin, Guillaume
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
Compounding of gossip graphs. Zbl 0960.90010
Fertin, Guillaume; Labahn, Roger
1
2000
On the structure of minimum broadcast digraphs. Zbl 0948.68132
Fertin, G.
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é
2
1998
all top 5

Cited by 597 Authors

36 Fertin, Guillaume
17 Vialette, Stéphane
14 Raspaud, André
14 Rusu, Irena
12 Dondi, Riccardo
9 Bulteau, Laurent
9 Zhu, Binhai
7 Jiang, Haitao
7 Rizzi, Romeo
7 Sikora, Florian
6 Chitturi, Bhadrachalam
6 Jiang, Minghui
6 Zehavi, Meirav
5 Dias, Zanoni
5 Dybizbański, Janusz
5 Harutyunyan, Hovhannes A.
5 Hermelin, Danny
5 Labarre, Anthony
5 Lokshtanov, Daniel
5 Miao, Lianying
5 Pilipczuk, Marcin
5 Wood, David Ronald
4 Cygan, Marek
4 Francis, Andrew R.
4 Hou, Jianfeng
4 Kerdjoudj, Samia
4 Komusiewicz, Christian
4 Lin, Guohui
4 MacGillivray, Gary
4 Pilipczuk, Michał
4 Pinter, Ron Yair
4 Wang, Jianxin
4 Zhou, Sanming
4 Zhu, Daming
3 Blin, Guillaume
3 Bonizzoni, Paola
3 Borowiecki, Mieczysław
3 Braga, Marília D. V.
3 Braga, Mónica
3 Chauve, Cedric
3 Duffy, Christopher
3 Egri-Nagy, Attila
3 Fellows, Michael Ralph
3 Fernandes, Cristina G.
3 Ferreira, Carlos Eduardo
3 Goebel, Randy G.
3 Jean, Géraldine
3 Li, Zepeng
3 Li, Zhiyuan
3 Li, Zhong
3 Liestman, Arthur L.
3 Lintzmayer, Carla Negri
3 Marenco, Javier L.
3 Martinez, Fábio Viduani
3 Mehrabian, Abbas
3 Mohar, Bojan
3 Montassier, Mickaël
3 Nenca, Anna
3 Nešetřil, Jaroslav
3 Ossona de Mendez, Patrice
3 Pinlou, Alexandre
3 Rahman, Mohammad Sohel
3 Reidys, Christian Michael
3 Shachnai, Hadas
3 Shao, Zehui
3 Song, Wenyao
3 Sopena, Éric
3 Stefanes, Marco A.
3 Swarts, Jacobus Stephanus
3 Szepietowski, Andrzej
3 Tannier, Eric
3 Tjandraatmadja, Christian
3 Wang, Juan
3 Wang, Lusheng
3 Wang, Wei-Fan
3 Xu, Jin
3 Zhang, Zhongzhi
3 Zhu, Enqiang
2 Adi, Said Sadique
2 Anglès d’Auriac, Jean-Alexandre
2 Aravind, N. R.
2 Baudon, Olivier
2 Bensmail, Julien
2 Beretta, Stefano
2 Biller, Priscila
2 Blanco, Saúl A.
2 Buehrle, Charles
2 Castelli, Mauro
2 Chen, Lichao
2 Chen, Min
2 Chen, Zhixiang
2 Comin, Carlo
2 Cranston, Daniel W.
2 Dastjerdi, Marzieh Vahid
2 Drgas-Burchardt, Ewa
2 Dujmović, Vida
2 Esperet, Louis
2 Feng, Qilong
2 Fradin, Julien
2 Fu, Bin
...and 497 more Authors
all top 5

Cited in 64 Serials

45 Theoretical Computer Science
40 Discrete Applied Mathematics
30 Discrete Mathematics
22 Information Processing Letters
18 Journal of Discrete Algorithms
17 Journal of Combinatorial Optimization
12 Algorithmica
9 European Journal of Combinatorics
8 Graphs and Combinatorics
7 Journal of Computer and System Sciences
5 Journal of Graph Theory
5 Discussiones Mathematicae. Graph Theory
5 Discrete Mathematics, Algorithms and Applications
4 The Australasian Journal of Combinatorics
3 Journal of Mathematical Biology
3 Random Structures & Algorithms
3 The Electronic Journal of Combinatorics
3 Acta Mathematica Sinica. English Series
2 Bulletin of Mathematical Biology
2 Applied Mathematics and Computation
2 Advances in Applied Mathematics
2 Aequationes Mathematicae
2 The European Physical Journal B. Condensed Matter and Complex Systems
2 Algorithms
2 Journal of Theoretical Biology
2 Prikladnaya Diskretnaya Matematika
1 Computers & Mathematics with Applications
1 Acta Mathematica Vietnamica
1 Information Sciences
1 Journal of Combinatorial Theory. Series B
1 Networks
1 SIAM Journal on Computing
1 Ergodic Theory and Dynamical Systems
1 Operations Research Letters
1 Combinatorica
1 Order
1 Journal of Symbolic Computation
1 Information and Computation
1 Computers & Operations Research
1 SIAM Journal on Discrete Mathematics
1 Annals of Operations Research
1 Computational Geometry
1 International Journal of Computer Mathematics
1 Foundations of Computing and Decision Sciences
1 Combinatorics, Probability and Computing
1 Fractals
1 Complexity
1 Theory of Computing Systems
1 Taiwanese Journal of Mathematics
1 Journal of Graph Algorithms and Applications
1 Annals of Combinatorics
1 Discrete Mathematics and Theoretical Computer Science. DMTCS
1 Chaos
1 RAIRO. Operations Research
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 Science China. Mathematics
1 Sankhyā. Series B
1 Computer Science Review
1 Open Mathematics

Citations by Year