Követés
David Coudert
David Coudert
INRIA
E-mail megerősítve itt: inria.fr - Kezdőlap
Cím
Hivatkozott rá
Hivatkozott rá
Év
Shared risk resource group complexity and approximability issues
D Coudert, P Datta, S Perennes, H Rivano, ME Voge
Parallel Processing Letters 17 (02), 169-184, 2007
1082007
Traffic grooming in unidirectional WDM ring networks using design theory
JC Bermond, D Coudert
IEEE International Conference on Communications, 2003. ICC'03. 2, 1402-1406, 2003
802003
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
772019
Lightpath assignment for multifibers WDM networks with wavelength translators
D Coudert, H Rivano
Global Telecommunications Conference, 2002. GLOBECOM'02. IEEE 3, 2686-2690, 2002
642002
Traffic grooming in unidirectional WDM ring networks: the all-to-all unitary case
JC Bermond, D Coudert, X Munoz
7th IFIP Working Conference on Optical Network Design & Modelling (ONDM …, 2003
552003
Reconfiguration of the routing in WDM networks with two classes of services
D Coudert, F Huc, D Mazauric, N Nisse, JS Sereni
2009 International Conference on Optical Network Design and Modeling, 1-6, 2009
49*2009
Exact and approximate algorithms for computing the hyperbolicity of large-scale graphs
N Cohen, D Coudert, A Lancin
INRIA, 2012
452012
Traffic grooming on the path
JC Bermond, L Braud, D Coudert
Structural Information and Communication Complexity: 12 International …, 2005
452005
On computing the hyperbolicity of real-world graphs
M Borassi, D Coudert, P Crescenzi, A Marino
Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015
432015
Rerouting requests in wdm networks
D Coudert, S Pérennes, QC Pham, JS Sereni
7eme Rencontres Francophones sur les aspects Algorithmiques des …, 2005
432005
Characterization of graphs and digraphs with small process numbers
D Coudert, JS Sereni
Discrete Applied Mathematics 159 (11), 1094-1109, 2011
422011
Power-efficient radio configuration in fixed broadband wireless networks
D Coudert, N Nepomuceno, H Rivano
Computer Communications 33 (8), 898-906, 2010
39*2010
Recognition of -Free and 1/2-Hyperbolic Graphs
D Coudert, G Ducoffe
SIAM Journal on Discrete Mathematics 28 (3), 1601-1617, 2014
382014
Traffic grooming in unidirectional wavelength-division multiplexed rings with grooming ratio C= 6
JC Bermond, CJ Colbourn, D Coudert, G Ge, ACH Ling, X Munoz
SIAM Journal on Discrete Mathematics 19 (2), 523-542, 2005
372005
Applying clique-decomposition for computing Gromov hyperbolicity
N Cohen, D Coudert, G Ducoffe, A Lancin
Theoretical computer science 690, 114-139, 2017
352017
On computing the Gromov hyperbolicity
N Cohen, D Coudert, A Lancin
Journal of Experimental Algorithmics (JEA) 20, 1-18, 2015
312015
A distributed algorithm for computing the node search number in trees
D Coudert, F Huc, D Mazauric
Algorithmica 63, 158-190, 2012
30*2012
Tradeoffs in process strategy games with application in the WDM reconfiguration problem
N Cohen, D Coudert, D Mazauric, N Nepomuceno, N Nisse
Theoretical Computer Science 412 (35), 4675-4687, 2011
30*2011
A chance-constrained model and cutting planes for fixed broadband wireless networks
G Claßen, D Coudert, AMCA Koster, N Nepomuceno
International Conference on Network Optimization, 37-42, 2011
282011
Combinatorial optimization in networks with Shared Risk Link Groups
D Coudert, S Pérennes, H Rivano, ME Voge
Discrete Mathematics & Theoretical Computer Science 18 (3), 2016
27*2016
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20