×

zbMATH — the first resource for mathematics

Ducoffe, Guillaume

Compute Distance To:
Author ID: ducoffe.guillaume Recent zbMATH articles by "Ducoffe, Guillaume"
Published as: Ducoffe, G.; Ducoffe, Guillaume
Documents Indexed: 32 Publications since 2013

Publications by Year

Citations contained in zbMATH Open

21 Publications have been cited 71 times in 47 Documents Cited by Year
Recognition of \(C_4\)-free and \(1/2\)-hyperbolic graphs. Zbl 1306.05233
Coudert, David; Ducoffe, Guillaume
12
2014
To approximate treewidth, use treelength! Zbl 1341.05238
Coudert, David; Ducoffe, Guillaume; Nisse, Nicolas
8
2016
Applying clique-decomposition for computing Gromov hyperbolicity. Zbl 1371.05284
Cohen, Nathann; Coudert, David; Ducoffe, Guillaume; Lancin, Aurélien
6
2017
On the hyperbolicity of bipartite graphs and intersection graphs. Zbl 1346.05243
Coudert, David; Ducoffe, Guillaume
6
2016
On the complexity of computing treebreadth. Zbl 06631007
Ducoffe, Guillaume; Legay, Sylvain; Nisse, Nicolas
6
2016
Data center interconnection networks are not hyperbolic. Zbl 1344.68173
Coudert, David; Ducoffe, Guillaume
6
2016
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs. Zbl 1403.68157
Coudert, David; Ducoffe, Guillaume; Popa, Alexandru
5
2018
On the (di)graphs with (directed) proper connection number two. Zbl 1383.05130
Ducoffe, Guillaume; Marinescu-Ghemeci, Ruxandra; Popa, Alexandru
4
2017
Finding cut-vertices in the square roots of a graph. Zbl 06822002
Ducoffe, Guillaume
3
2017
Easy computation of eccentricity approximating trees. Zbl 1409.05052
Ducoffe, Guillaume
2
2019
A short note on the complexity of computing strong pathbreadth. Zbl 1427.68237
Ducoffe, Guillaume
2
2018
Hamiltonicity of large generalized de Bruijn cycles. Zbl 1287.05078
Ducoffe, Guillaume
2
2013
Fast diameter computation within split graphs. Zbl 1435.68232
Ducoffe, Guillaume; Habib, Michel; Viennot, Laurent
1
2019
The 4-Steiner Root problem. Zbl 07173287
Ducoffe, Guillaume
1
2019
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs. Zbl 1454.68098
Coudert, David; Ducoffe, Guillaume; Popa, Alexandru
1
2019
Low time complexity algorithms for path computation in Cayley graphs. Zbl 1409.05099
Aguirre-Guerrero, D.; Ducoffe, G.; Fàbrega, L.; Vilà, P.; Coudert, D.
1
2019
Finding cut-vertices in the square roots of a graph. Zbl 1406.05101
Ducoffe, Guillaume
1
2019
Fast approximation and exact computation of negative curvature parameters of graphs. Zbl 07236426
Chalopin, Jérémie; Chepoi, Victor; Dragan, Feodor F.; Ducoffe, Guillaume; Mohammed, Abdulhakeem; Vaxès, Yann
1
2018
Revisiting decomposition by clique separators. Zbl 1383.05256
Coudert, David; Ducoffe, Guillaume
1
2018
The parallel complexity of coloring games. Zbl 1403.91065
Ducoffe, Guillaume
1
2016
Eulerian and Hamiltonian dicycles in directed hypergraphs. Zbl 1286.05110
Araujo, Julio; Bermond, Jean-Claude; Ducoffe, Guillaume
1
2014
Easy computation of eccentricity approximating trees. Zbl 1409.05052
Ducoffe, Guillaume
2
2019
Fast diameter computation within split graphs. Zbl 1435.68232
Ducoffe, Guillaume; Habib, Michel; Viennot, Laurent
1
2019
The 4-Steiner Root problem. Zbl 07173287
Ducoffe, Guillaume
1
2019
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs. Zbl 1454.68098
Coudert, David; Ducoffe, Guillaume; Popa, Alexandru
1
2019
Low time complexity algorithms for path computation in Cayley graphs. Zbl 1409.05099
Aguirre-Guerrero, D.; Ducoffe, G.; Fàbrega, L.; Vilà, P.; Coudert, D.
1
2019
Finding cut-vertices in the square roots of a graph. Zbl 1406.05101
Ducoffe, Guillaume
1
2019
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs. Zbl 1403.68157
Coudert, David; Ducoffe, Guillaume; Popa, Alexandru
5
2018
A short note on the complexity of computing strong pathbreadth. Zbl 1427.68237
Ducoffe, Guillaume
2
2018
Fast approximation and exact computation of negative curvature parameters of graphs. Zbl 07236426
Chalopin, Jérémie; Chepoi, Victor; Dragan, Feodor F.; Ducoffe, Guillaume; Mohammed, Abdulhakeem; Vaxès, Yann
1
2018
Revisiting decomposition by clique separators. Zbl 1383.05256
Coudert, David; Ducoffe, Guillaume
1
2018
Applying clique-decomposition for computing Gromov hyperbolicity. Zbl 1371.05284
Cohen, Nathann; Coudert, David; Ducoffe, Guillaume; Lancin, Aurélien
6
2017
On the (di)graphs with (directed) proper connection number two. Zbl 1383.05130
Ducoffe, Guillaume; Marinescu-Ghemeci, Ruxandra; Popa, Alexandru
4
2017
Finding cut-vertices in the square roots of a graph. Zbl 06822002
Ducoffe, Guillaume
3
2017
To approximate treewidth, use treelength! Zbl 1341.05238
Coudert, David; Ducoffe, Guillaume; Nisse, Nicolas
8
2016
On the hyperbolicity of bipartite graphs and intersection graphs. Zbl 1346.05243
Coudert, David; Ducoffe, Guillaume
6
2016
On the complexity of computing treebreadth. Zbl 06631007
Ducoffe, Guillaume; Legay, Sylvain; Nisse, Nicolas
6
2016
Data center interconnection networks are not hyperbolic. Zbl 1344.68173
Coudert, David; Ducoffe, Guillaume
6
2016
The parallel complexity of coloring games. Zbl 1403.91065
Ducoffe, Guillaume
1
2016
Recognition of \(C_4\)-free and \(1/2\)-hyperbolic graphs. Zbl 1306.05233
Coudert, David; Ducoffe, Guillaume
12
2014
Eulerian and Hamiltonian dicycles in directed hypergraphs. Zbl 1286.05110
Araujo, Julio; Bermond, Jean-Claude; Ducoffe, Guillaume
1
2014
Hamiltonicity of large generalized de Bruijn cycles. Zbl 1287.05078
Ducoffe, Guillaume
2
2013

Citations by Year