Učitavanje...
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Godišnji broj citata
Dvostruki navodi
Sljedeći su članci spojeni u Znalcu.
Navodi iz obaju
članaka broje se samo za prvi članak.
Spojeni navodi
Zbroj za "Citirano" uključuje navode sljedećeg članka u Znalcu. Oni koji su označeni znakom
*
mogu biti različiti od članka u profilu.
Dodavanje suautora
Suautori
Prati
Novi članci tog autora
Novi navodi tog autora
Novi članci povezani s istraživanjem tog autora
E-adresa za obavijesti
Završeno
Moj profil
Moja knjižnica
Mjerni podaci
Upozorenja
Postavke
Prijavite se
Prijavite se
Izradite svoj profil
Citirano
Prikaži sve
Sve
Od 2019.
Citati
732
517
H-indeks
15
12
i10-indeks
20
18
0
120
60
30
90
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
5
8
22
57
64
38
72
87
113
110
77
45
Javni pristup
Prikaži sve
Prikaži sve
12 članaka
0 članaka
dostupno
nije dostupno
Na temelju uvjeta financiranja
Suautori
David Coudert
INRIA
Potvrđena adresa e-pošte na inria.fr
Augustin Chaintreau
Associate Professor, Columbia University
Potvrđena adresa e-pošte na cs.columbia.edu
Alexandru Popa
Professor, University of Bucharest
Potvrđena adresa e-pošte na fmi.unibuc.ro
Nicolas Nisse
Inria, France
Potvrđena adresa e-pošte na inria.fr
Feodor F. Dragan
Kent State University
Potvrđena adresa e-pošte na CS.KENT.EDU
Mathias Lécuyer
University of British Columbia
Potvrđena adresa e-pošte na ubc.ca
Roxana Geambasu
Assistant Professor of Computer Science, Columbia University
Potvrđena adresa e-pošte na columbia.edu
Marinescu-Ghemeci R.
University of Bucharest
Potvrđena adresa e-pošte na fmi.unibuc.ro
Theofilos Petsios
Potvrđena adresa e-pošte na cs.columbia.edu
Riley Spahn
Columbia University
Potvrđena adresa e-pošte na cs.columbia.edu
Jean-Claude Bermond
Directeur de Recherche CNRS
Potvrđena adresa e-pošte na sophia.inria.fr
Karol Suchan
Universidad Diego Portales
Potvrđena adresa e-pošte na mail.udp.cl
Prati
Guillaume Ducoffe
University of Bucharest - Faculty of Mathematics and Informatics, and
ICI
Potvrđena adresa e-pošte na ici.ro -
Početna stranica
Graph theory
Algorithms
Game theory
Combinatorics
Complexity theory
Članci
Citirano
Javni pristup
Suautori
Naslov
Razvrstaj
Poredaj po navodima
Poredaj po godini
Poredaj po naslovu
Citirano
Citirano
Godina
{XRay}: Enhancing the {Web’s} Transparency with Differential Correlation
M Lécuyer, G Ducoffe, F Lan, A Papancea, T Petsios, R Spahn, ...
23rd USENIX Security Symposium (USENIX Security 14), 49-64
, 2014
159
2014
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
D Coudert, G Ducoffe, A Popa
ACM Transactions on Algorithms (TALG) 15 (3), 1-57
, 2019
68
2019
Recognition of
-Free and 1/2-Hyperbolic Graphs
D Coudert, G Ducoffe
SIAM Journal on Discrete Mathematics 28 (3), 1601-1617
, 2014
41
2014
Applying clique-decomposition for computing Gromov hyperbolicity
N Cohen, D Coudert, G Ducoffe, A Lancin
Theoretical computer science 690, 114-139
, 2017
35
2017
Diameter computation on
H
-minor free graphs and graphs of bounded (distance) VC-dimension
G Ducoffe, M Habib, L Viennot
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …
, 2020
32
2020
Extremal graphs with respect to the modified first Zagreb connection index
G Ducoffe, R Marinescu-Ghemeci, C Obreja, A Popa, RM Tache
2018 20th International Symposium on Symbolic and Numeric Algorithms for …
, 2018
32
2018
On the hyperbolicity of bipartite graphs and intersection graphs
D Coudert, G Ducoffe
Discrete Applied Mathematics 214, 187-195
, 2016
24
2016
A story of diameter, radius, and (almost) Helly property
G Ducoffe, FF Dragan
Networks 77 (3), 435-453
, 2021
22
*
2021
Diameter of minimal separators in graphs
D Coudert, G Ducoffe, N Nisse
Inria Sophia Antipolis; I3S; INRIA
, 2014
22
*
2014
On the (di) graphs with (directed) proper connection number two
G Ducoffe, R Marinescu-Ghemeci, A Popa
Electronic Notes in Discrete Mathematics 62, 237-242
, 2017
19
2017
Fast approximation and exact computation of negative curvature parameters of graphs
J Chalopin, V Chepoi, FF Dragan, G Ducoffe, A Mohammed, Y Vaxès
Discrete & Computational Geometry 65, 856-892
, 2021
18
2021
Fast diameter computation within split graphs
G Ducoffe, M Habib, L Viennot
Discrete Mathematics & Theoretical Computer Science 23 (Graph Theory)
, 2021
17
2021
On the complexity of computing treebreadth
G Ducoffe, S Legay, N Nisse
Algorithmica 82 (6), 1574-1600
, 2020
17
*
2020
Data center interconnection networks are not hyperbolic
D Coudert, G Ducoffe
Theoretical Computer Science 639, 72-90
, 2016
16
2016
A new application of orthogonal range searching for computing giant graph diameters
G Ducoffe
2nd Symposium on Simplicity in Algorithms (SOSA 2019), 12: 1-12: 7
, 2019
15
2019
Optimal centrality computations within bounded clique-width graphs
G Ducoffe
Algorithmica 84 (11), 3192-3222
, 2022
13
*
2022
The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes
G Ducoffe, A Popa
Discrete Applied Mathematics 291, 201-222
, 2021
11
2021
Revisiting decomposition by clique separators
D Coudert, G Ducoffe
SIAM Journal on Discrete Mathematics 32 (1), 682-694
, 2018
11
2018
The b-matching problem in distance-hereditary graphs and beyond
G Ducoffe, A Popa
Discrete Applied Mathematics 305, 233-246
, 2021
10
*
2021
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
FF Dragan, G Ducoffe, HM Guarnera
Workshop on Algorithms and Data Structures, 300-314
, 2021
10
2021
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20
Prikaži više
Privatnost
Uvjeti
Pomoć
O Znalcu
Pomoć za pretraživanje