E-LIB Suche - Ergebnisse für: Bermond, Jean-Claude

1

Minimum lethal sets in grids and tori under 3-neighbour boo..:

Benevides, Fabricio ; Bermond, Jean-Claude ; Lesfari, Hicham.
European Journal of Combinatorics. 119 (2024) - p. 103801 , 2024

Link: https://doi.org/10.1016/..

2

Gossiping with Interference Constraints in Radio Chain Netw..:

Bermond, Jean-Claude ; Kodate, Takako ; Yu, Joseph
Journal of Information Processing. 28 (2020) 0 - p. 889-902 , 2020

Link: https://doi.org/10.2197/..

3

How long does it take for all users in a social network to ..:

Bermond, Jean-Claude ; Chaintreau, Augustin ; Ducoffe, Guillaume.
Discrete Applied Mathematics. 270 (2019) - p. 37-57 , 2019

Link: https://doi.org/10.1016/..

4

On spectrum assignment in elastic optical tree-networks:

Bermond, Jean-Claude ; Moataz, Fatima Zahra
Discrete Applied Mathematics. 257 (2019) - p. 40-52 , 2019

Link: https://doi.org/10.1016/..

5

Well-Balanced Designs for Data Placement:

Bermond, Jean-Claude ; Jean-Marie, Alain ; Mazauric, Dorian.
Journal of Combinatorial Designs. 24 (2015) 2 - p. 55-76 , 2015

Link: https://doi.org/10.1002/..

6

Finding disjoint paths in networks with star shared risk li..:

Bermond, Jean-Claude ; Coudert, David ; D'Angelo, Gianlorenzo.
Theoretical Computer Science. 579 (2015) - p. 74-87 , 2015

Link: https://doi.org/10.1016/..

7

Data gathering and personalized broadcasting in radio grids..:

Bermond, Jean-Claude ; Li, Bi ; Nisse, Nicolas..
Theoretical Computer Science. 562 (2015) - p. 453-475 , 2015

Link: https://doi.org/10.1016/..

8

Directed acyclic graphs with the unique dipath property:

Bermond, Jean-Claude ; Cosnard, Michel ; Pérennes, Stéphane
Theoretical Computer Science. 504 (2013) - p. 5-11 , 2013

Link: https://doi.org/10.1016/..

9

Optimal time data gathering in wireless networks with multi..:

Bermond, Jean-Claude ; Gargano, Luisa ; Perénnes, Stephane..
Theoretical Computer Science. 509 (2013) - p. 122-139 , 2013

Link: https://doi.org/10.1016/..

10

Diverse routing in networks with star SRLGs:

, In: Proceedings of the 2012 ACM conference on CoNEXT student workshop,

Bermond, Jean-Claude ; Coudert, David ; D'Angelo, Gianlorenzo. - p. 23-24 , 2012

Link: https://dl.acm.org/doi/1..

11

Optimal gathering in radio grids with interference:

Bermond, Jean-Claude ; Peters, Joseph G.
Theoretical Computer Science. 457 (2012) - p. 10-26 , 2012

Link: https://doi.org/10.1016/..

12

GMPLS label space minimization through hypergraph layouts:

Bermond, Jean-Claude ; Coudert, David ; Moulierac, Joanna...
Theoretical Computer Science. 444 (2012) - p. 3-16 , 2012

Link: https://doi.org/10.1016/..

13

Drop Cost and Wavelength Optimal Two-Period Grooming with R..:

Bermond, Jean-Claude ; Colbourn, Charles J. ; Gionfriddo, Lucia..
SIAM Journal on Discrete Mathematics. 24 (2010) 2 - p. 400-419 , 2010

Link: https://doi.org/10.1137/..

14

A distributed scheduling algorithm for wireless networks wi..:

, In: Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems,

Bermond, Jean-Claude ; Mazauric, Dorian ; Misra, Vishal. - p. 345-346 , 2010

Link: https://dl.acm.org/doi/1..

15

A distributed scheduling algorithm for wireless networks wi..:

Bermond, Jean-Claude ; Mazauric, Dorian ; Misra, Vishal.
ACM SIGMETRICS Performance Evaluation Review. 38 (2010) 1 - p. 345-346 , 2010

Link: https://doi.org/10.1145/..