Optimal Centrality Computations Within Bounded Clique-Width Graphs von Ducoffe, Guillaume

Volltext

Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width von Ducoffe, Guillaume

Volltext

Graph based analysis of the Bucharest transport network von Ducoffe, Guillaume

Volltext

The power of interval models for computing graph centralities von Ducoffe, Guillaume

Volltext

αi-Metric Graphs: Radius, Diameter and all Eccentricities von Dragan, Feodor F., Ducoffe, Guillaume

Volltext

Leanness Computation: Small Values and Special Graph Classes von Coudert, David, Coulomb, Samuel, Ducoffe, Guillaume

Volltext

Distance problems within Helly graphs and k-Helly graphs von Ducoffe, Guillaume

Volltext

On the Complexity of Computing Treebreadth von Ducoffe, Guillaume, Legay, Sylvain, Nisse, Nicolas

Volltext

Eccentricity queries and beyond using hub labels von Ducoffe, Guillaume

Volltext

Corrigendum: The diameter of AT‐free graphs von Ducoffe, Guillaume

Volltext

Balancing graph Voronoi diagrams with one more vertex von Ducoffe, Guillaume

Volltext

The diameter of AT‐free graphs von Ducoffe, Guillaume

Volltext

Fast Diameter Computation within Split Graphs von Ducoffe, Guillaume, Habib, Michel, Viennot, Laurent

Volltext

FASTER APPROXIMATION ALGORITHMS FOR COMPUTING SHORTEST CYCLES ON WEIGHTED GRAPHS von Ducoffe, Guillaume

Volltext

Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs von Chalopin, Jérémie, Chepoi, Victor, Dragan, Feodor F., Ducoffe, Guillaume, Mohammed, Abdulhakeem, Vaxès, Yann

Volltext

Easy computation of eccentricity approximating trees von Ducoffe, Guillaume

Volltext

Analiza bazatǎ pe grafuri a rețelei transporturilor în Bucureşti von DUCOFFE, Guillaume

Volltext

Finding cut-vertices in the square roots of a graph von Ducoffe, Guillaume

Volltext

Puterea modelelor de interval în problema calculării indicilor de centralitate von DUCOFFE, Guillaume

Volltext

A variation of Boolean distance von Ducoffe, Guillaume

Volltext