| Shared risk resource group complexity and approximability issues D Coudert, P Datta, S Pérennes, H Rivano, ME Voge Parallel Processing Letters 17 (02), 169-184, 2007 | 97 | 2007 |
| 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 | 78 | 2003 |
| Lightpath assignment for multifibers WDM networks with wavelength translators D Coudert, H Rivano Global Telecommunications Conference, 2002. GLOBECOM'02. IEEE 3, 2686-2690, 2002 | 60 | 2002 |
| 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 | 51 | 2003 |
| Applying clique-decomposition for computing Gromov hyperbolicity N Cohen, D Coudert, G Ducoffe, A Lancin Theoretical computer science 690, 114-139, 2017 | 49* | 2017 |
| Exact and approximate algorithms for computing the hyperbolicity of large-scale graphs N Cohen, D Coudert, A Lancin Inria, 2012 | 45 | 2012 |
| Rerouting requests in wdm networks D Coudert, S Pérennes, QC Pham, JS Sereni 7eme Rencontres Francophones sur les aspects Algorithmiques des …, 2005 | 41 | 2005 |
| 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 | 40* | 2009 |
| Traffic grooming on the path JC Bermond, L Braud, D Coudert International Colloquium on Structural Information and Communication …, 2005 | 39 | 2005 |
| Recognition of -Free and 1/2-Hyperbolic Graphs D Coudert, G Ducoffe SIAM Journal on Discrete Mathematics 28 (3), 1601-1617, 2014 | 35 | 2014 |
| 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 | 35 | 2005 |
| 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 | 34 | 2019 |
| Characterization of graphs and digraphs with small process numbers D Coudert, JS Sereni Discrete Applied Mathematics 159 (11), 1094-1109, 2011 | 34 | 2011 |
| Power-efficient radio configuration in fixed broadband wireless networks D Coudert, N Nepomuceno, H Rivano Computer Communications 33 (8), 898-906, 2010 | 31* | 2010 |
| On computing the hyperbolicity of real-world graphs M Borassi, D Coudert, P Crescenzi, A Marino Algorithms-ESA 2015, 215-226, 2015 | 28 | 2015 |
| A distributed algorithm for computing the node search number in trees D Coudert, F Huc, D Mazauric Algorithmica 63 (1), 158-190, 2012 | 27* | 2012 |
| Robust redundancy elimination for energy-aware routing D Coudert, AMCA Koster, TK Phan, M Tieves 2013 IEEE International Conference on Green Computing and Communications and …, 2013 | 24 | 2013 |
| 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 | 24 | 2011 |
| Topologies for optical interconnection networks based on the optical transpose interconnection system D Coudert, A Ferreira, X Muñoz Applied optics 39 (17), 2965-2974, 2000 | 24 | 2000 |
| 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 | 22* | 2016 |
Jean-Claude BermondDirecteur de Recherche CNRSVerified email at sophia.inria.fr
