I agree that this site is using cookies. You can find further informations here.
X
Coudert, David
781  results:
Search for persons X
?
1

Finding thekShortest Simple Paths: Time and Space Trade-off:

Al Zoobi, Ali ; Coudert, David ; Nisse, Nicolas
ACM Journal of Experimental Algorithmics.  28 (2023)  - p. 1-23 , 2023
Link: https://doi.org/10.1145/..
 
?
2

Enumeration of Far-apart Pairs by Decreasing Distance for F..:

Coudert, David ; Nusser, André ; Viennot, Laurent
ACM Journal of Experimental Algorithmics.  27 (2022)  - p. 1-29 , 2022
Link: https://doi.org/10.1145/..
 
?
3

Efficient Make-Before-Break Layer 2 Reoptimization:

Duong, Huy ; Jaumard, Brigitte ; Coudert, David.
IEEE/ACM Transactions on Networking.  29 (2021)  5 - p. 1910-1921 , 2021
Link: https://doi.org/10.1109/..
 
?
4

Dantzig–Wolfe decomposition for the design of filterless op..:

Jaumard, Brigitte ; Wang, Yan ; Coudert, David
Journal of Optical Communications and Networking.  13 (2021)  12 - p. 312 , 2021
Link: https://doi.org/10.1364/..
 
?
5

Network alignment and similarity reveal atlas-based topolog..:

Frigo, Matteo ; Cruciani, Emilio ; Coudert, David...
Network Neuroscience.  , 2021
Link: https://doi.org/10.1162/..
 
?
6

Self-organized UAV-based Supervision and Connectivity: Chal..:

, In: 2019 IEEE 18th International Symposium on Network Computing and Applications (NCA),
Busnel, Yann ; Caillouet, Christelle ; Coudert, David - p. 1-5 , 2019
Link: https://doi.org/10.1109/..
 
?
7

Self-Organized Disaster Management System by Distributed De..:

, In: 2019 International Conference on Information and Communication Technologies for Disaster Management (ICT-DM),
Busnel, Yann ; Caillouet, Christelle ; Coudert, David - p. 1-8 , 2019
Link: https://doi.org/10.1109/..
 
?
8

Fully Polynomial FPT Algorithms for Some Classes of Bounded..:

Coudert, David ; Ducoffe, Guillaume ; Popa, Alexandru
ACM Transactions on Algorithms.  15 (2019)  3 - p. 1-57 , 2019
Link: https://doi.org/10.1145/..
 
?
9

Fully Polynomial FPT Algorithms for Some Classes of Bounded..:

Coudert, David ; Ducoffe, Guillaume ; Popa, Alexandru
ACM Transactions on Algorithms (TALG).  15 (2019)  3 - p. 1-57 , 2019
Link: https://dl.acm.org/doi/1..
 
?
10

Computing and maximizing the exact reliability of wireless ..:

Coudert, David ; Luedtke, James ; Moreno, Eduardo.
Electronic Notes in Discrete Mathematics.  64 (2018)  - p. 85-94 , 2018
Link: https://doi.org/10.1016/..
 
?
11

Revisiting Decomposition by Clique Separators:

Coudert, David ; Ducoffe, Guillaume
SIAM Journal on Discrete Mathematics.  32 (2018)  1 - p. 682-694 , 2018
Link: https://doi.org/10.1137/..
 
?
12

On distance-preserving elimination orderings in graphs: Com..:

Coudert, David ; Ducoffe, Guillaume ; Nisse, Nicolas.
Discrete Applied Mathematics.  243 (2018)  - p. 140-153 , 2018
Link: https://doi.org/10.1016/..
 
?
13

Fully polynomial FPT algorithms for some classes of bounded..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Coudert, David ; Ducoffe, Guillaume ; Popa, Alexandra - p. 2765-2784 , 2018
Link: https://doi.org/10.1137/..
 
?
14

Fully polynomial FPT algorithms for some classes of bounded..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Coudert, David ; Ducoffe, Guillaume ; Popa, Alexandru - p. 2765-2784 , 2018
Link: https://dl.acm.org/doi/1..
 
?
15

Applying clique-decomposition for computing Gromov hyperbol..:

Cohen, Nathann ; Coudert, David ; Ducoffe, Guillaume.
Theoretical Computer Science.  690 (2017)  - p. 114-139 , 2017
Link: https://doi.org/10.1016/..
 
1-15