-
Nicolas Nisse.
Network Decontamination.
In Distributed Computing by Mobile Entities,
volume 11340 of LNCS,
pages 516-548.
Springer,
2019.
[WWW
] [PDF
]
Keywords:
Computational Complexity,
(Distributed) Graph Algorithms,
Graph Searching,
Path-and Tree-Decompositions.
@incollection{nisse:hal-02098917,
TITLE = {{Network Decontamination}},
AUTHOR = {Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-02098917},
BOOKTITLE = {{Distributed Computing by Mobile Entities}},
PUBLISHER = {{Springer}},
SERIES = {LNCS},
VOLUME = {11340},
PAGES = {516-548},
YEAR = {2019},
KEYWORDS = {Computational Complexity ; (Distributed) Graph Algorithms ; Graph Searching ; Path-and Tree-Decompositions},
PDF = {https://hal.archives-ouvertes.fr/hal-02098917/file/NetworkDecontamination.pdf},
HAL_ID = {hal-02098917},
HAL_VERSION = {v1},
}
-
Pierre Aboulker,
Nathann Cohen,
Frédéric Havet,
William Lochet,
Phablo F S Moura,
and Stéphan Thomassé.
Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number.
The Electronic Journal of Combinatorics,
26:P3.19,
July 2019.
[WWW
] [PDF
]
@article{aboulker:hal-02275082,
TITLE = {{Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number}},
AUTHOR = {Aboulker, Pierre and Cohen, Nathann and Havet, Fr{\'e}d{\'e}ric and Lochet, William and Moura, Phablo F S and Thomass{\'e}, St{\'e}phan},
URL = {https://hal.archives-ouvertes.fr/hal-02275082},
JOURNAL = {{The Electronic Journal of Combinatorics}},
PUBLISHER = {{Open Journal Systems}},
VOLUME = {26},
PAGES = {P3.19},
YEAR = {2019},
MONTH = Jul,
PDF = {https://hal.archives-ouvertes.fr/hal-02275082/file/in-arborescences.pdf},
HAL_ID = {hal-02275082},
HAL_VERSION = {v1},
}
-
Daniela Aguirre-Guerrero,
Guillaume Ducoffe,
Lluis Fabrega,
Pere Vila,
and David Coudert.
Low Time Complexity Algorithms for Path Computation in Cayley Graphs.
Discrete Applied Mathematics,
259:218-225,
April 2019.
[WWW
] [PDF
]
Keywords:
interconnection networks,
Cayley graphs,
path computation,
K-shortest paths.
@article{aguirreguerrero:hal-01973608,
TITLE = {{Low Time Complexity Algorithms for Path Computation in Cayley Graphs}},
AUTHOR = {Aguirre-Guerrero, Daniela and Ducoffe, Guillaume and Fabrega, Lluis and Vila, Pere and Coudert, David},
URL = {https://hal.inria.fr/hal-01973608},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {259},
PAGES = {218-225},
YEAR = {2019},
MONTH = Apr,
DOI = {10.1016/j.dam.2018.12.005},
KEYWORDS = {interconnection networks ; Cayley graphs ; path computation ; K-shortest paths},
PDF = {https://hal.inria.fr/hal-01973608/file/cga_final.pdf},
HAL_ID = {hal-01973608},
HAL_VERSION = {v1},
}
-
Stephan Dominique Andres,
Melissa Huggan,
Fionn Mc Inerney,
and Richard J Nowakowski.
The Orthogonal Colouring Game.
Theoretical Computer Science,
795:312-325,
February 2019.
[WWW
] [PDF
]
Keywords:
Orthogonal Colouring Game,
strictly matched involution,
games on graphs,
scoring game,
orthogonal graph colouring,
mutually orthogonal Latin squares.
@article{andres:hal-02017462,
TITLE = {{The Orthogonal Colouring Game}},
AUTHOR = {Andres, Stephan Dominique and Huggan, Melissa and Mc Inerney, Fionn and Nowakowski, Richard J},
URL = {https://hal.inria.fr/hal-02017462},
JOURNAL = {{Theoretical Computer Science}},
PUBLISHER = {{Elsevier}},
VOLUME = {795},
PAGES = {312-325},
YEAR = {2019},
MONTH = Feb,
KEYWORDS = {Orthogonal Colouring Game ; strictly matched involution ; games on graphs ; scoring game ; orthogonal graph colouring ; mutually orthogonal Latin squares},
PDF = {https://hal.inria.fr/hal-02017462v4/file/Corrected_TCS_orthogonalGraphColoringGame.pdf},
HAL_ID = {hal-02017462},
HAL_VERSION = {v4},
}
-
Spyros Angelopoulos,
Nicolas Nisse,
and Dimitrios M. Thilikos.
Preface to special issue on Theory and Applications of Graph Searching.
Theoretical Computer Science,
794:1-2,
November 2019.
[WWW
] [PDF
]
@article{angelopoulos:lirmm-02342745,
TITLE = {{Preface to special issue on Theory and Applications of Graph Searching}},
AUTHOR = {Angelopoulos, Spyros and Nisse, Nicolas and Thilikos, Dimitrios M.},
URL = {https://hal-lirmm.ccsd.cnrs.fr/lirmm-02342745},
JOURNAL = {{Theoretical Computer Science}},
PUBLISHER = {{Elsevier}},
VOLUME = {794},
PAGES = {1-2},
YEAR = {2019},
MONTH = Nov,
DOI = {10.1016/j.tcs.2019.09.043},
PDF = {https://hal-lirmm.ccsd.cnrs.fr/lirmm-02342745/file/tcs-2017-preface.pdf},
HAL_ID = {lirmm-02342745},
HAL_VERSION = {v1},
}
-
Jorgen Bang-Jensen,
Stéphane Bessy,
Frédéric Havet,
and Anders Yeo.
Bipartite spanning sub(di)graphs induced by 2-partitions.
Journal of Graph Theory,
92(2):130-151,
October 2019.
[WWW
] [PDF
]
Keywords:
Eulerian,
Spanning bipartite subdigraph,
Strong spanning subdigraph,
2-partition,
Minimum out-degree.
@article{bangjensen:hal-02350210,
TITLE = {{Bipartite spanning sub(di)graphs induced by 2-partitions}},
AUTHOR = {Bang-Jensen, J{{\o}}rgen and Bessy, St{\'e}phane and Havet, Fr{\'e}d{\'e}ric and Yeo, Anders},
URL = {https://hal.inria.fr/hal-02350210},
JOURNAL = {{Journal of Graph Theory}},
PUBLISHER = {{Wiley}},
VOLUME = {92},
NUMBER = {2},
PAGES = {130-151},
YEAR = {2019},
MONTH = Oct,
DOI = {10.1002/jgt.22444},
KEYWORDS = {Eulerian ; Spanning bipartite subdigraph ; Strong spanning subdigraph ; 2-partition ; Minimum out-degree},
PDF = {https://hal.inria.fr/hal-02350210/file/Bipartite-revise.pdf},
HAL_ID = {hal-02350210},
HAL_VERSION = {v1},
}
-
Olivier Baudon,
Julien Bensmail,
Tom Davot,
Hervé Hocquard,
Jakub Przybylo,
Mohammed Senhaji,
Eric Sopena,
and Mariusz Wozniak.
A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions.
Discrete Mathematics and Theoretical Computer Science,
21(1),
April 2019.
[WWW
] [PDF
]
Keywords:
Coloured weighted degrees,
1-2-3 Conjecture,
Locally irregular decompositions.
@article{baudon:hal-01690222,
TITLE = {{A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions}},
AUTHOR = {Baudon, Olivier and Bensmail, Julien and Davot, Tom and Hocquard, Herv{\'e} and Przybylo, Jakub and Senhaji, Mohammed and Sopena, Eric and Wo{\'z}niak, Mariusz},
URL = {https://hal.archives-ouvertes.fr/hal-01690222},
JOURNAL = {{Discrete Mathematics and Theoretical Computer Science}},
PUBLISHER = {{DMTCS}},
SERIES = {ICGT 2018},
VOLUME = {21},
NUMBER = {1},
YEAR = {2019},
MONTH = Apr,
KEYWORDS = {Coloured weighted degrees ; 1-2-3 Conjecture ; Locally irregular decompositions},
PDF = {https://hal.archives-ouvertes.fr/hal-01690222v4/file/multisums-dmtcs.pdf},
HAL_ID = {hal-01690222},
HAL_VERSION = {v4},
}
-
Olivier Baudon,
Julien Bensmail,
Hervé Hocquard,
Mohammed Senhaji,
and Eric Sopena.
Edge Weights and Vertex Colours: Minimizing Sum Count.
Discrete Applied Mathematics,
270:13-24,
November 2019.
[WWW
] [PDF
]
@article{baudon:hal-01839537,
TITLE = {{Edge Weights and Vertex Colours: Minimizing Sum Count}},
AUTHOR = {Baudon, Olivier and Bensmail, Julien and Hocquard, Herv{\'e} and Senhaji, Mohammed and Sopena, Eric},
URL = {https://hal.archives-ouvertes.fr/hal-01839537},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {270},
PAGES = {13-24},
YEAR = {2019},
MONTH = Nov,
PDF = {https://hal.archives-ouvertes.fr/hal-01839537v2/file/123sums-07062019.pdf},
HAL_ID = {hal-01839537},
HAL_VERSION = {v2},
}
-
L. Becchetti,
A. Clementi,
Emanuele Natale,
F. Pasquale,
and G. Posta.
Self-stabilizing repeated balls-into-bins.
Distributed Computing,
32(1):59-68,
February 2019.
[WWW
]
@article{becchetti:hal-02948569,
TITLE = {{Self-stabilizing repeated balls-into-bins}},
AUTHOR = {Becchetti, L. and Clementi, A. and Natale, Emanuele and Pasquale, F. and Posta, G.},
URL = {https://hal.archives-ouvertes.fr/hal-02948569},
JOURNAL = {{Distributed Computing}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {32},
NUMBER = {1},
PAGES = {59-68},
YEAR = {2019},
MONTH = Feb,
DOI = {10.1007/s00446-017-0320-4},
HAL_ID = {hal-02948569},
HAL_VERSION = {v1},
}
-
Julien Bensmail,
Thibaut Blanc,
Nathann Cohen,
Frédéric Havet,
and Leonardo Rocha.
Backbone colouring and algorithms for TDMA scheduling.
Discrete Mathematics and Theoretical Computer Science,
Vol. 21 no. 3(3):#24,
July 2019.
[WWW
] [PDF
]
Keywords:
Wireless networks,
TDMA scheduling,
Backbone colouring,
Algorithmic complexity.
@article{bensmail:hal-01851600,
TITLE = {{Backbone colouring and algorithms for TDMA scheduling}},
AUTHOR = {Bensmail, Julien and Blanc, Thibaut and Cohen, Nathann and Havet, Fr{\'e}d{\'e}ric and Rocha, Leonardo},
URL = {https://hal.archives-ouvertes.fr/hal-01851600},
JOURNAL = {{Discrete Mathematics and Theoretical Computer Science}},
PUBLISHER = {{DMTCS}},
VOLUME = {Vol. 21 no. 3 },
NUMBER = {3},
PAGES = {\#24},
YEAR = {2019},
MONTH = Jul,
KEYWORDS = {Wireless networks ; TDMA scheduling ; Backbone colouring ; Algorithmic complexity},
PDF = {https://hal.archives-ouvertes.fr/hal-01851600v4/file/bmrn-dmtcs.pdf},
HAL_ID = {hal-01851600},
HAL_VERSION = {v4},
}
-
Julien Bensmail,
Ararat Harutyunyan,
Tien-Nam Le,
and Stéphan Thomassé.
Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture.
Combinatorica,
39(2):239-263,
April 2019.
[WWW
] [PDF
]
@article{bensmail:hal-01744515,
TITLE = {{Edge-partitioning a graph into paths: beyond the Bar{\'a}t-Thomassen conjecture}},
AUTHOR = {Bensmail, Julien and Harutyunyan, Ararat and Le, Tien-Nam and Thomass{\'e}, St{\'e}phan},
URL = {https://hal.archives-ouvertes.fr/hal-01744515},
JOURNAL = {{Combinatorica}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {39},
NUMBER = {2},
PAGES = {239-263},
YEAR = {2019},
MONTH = Apr,
DOI = {10.1007/s00493-017-3661-5},
PDF = {https://hal.archives-ouvertes.fr/hal-01744515/file/bt-paths5.pdf},
HAL_ID = {hal-01744515},
HAL_VERSION = {v1},
}
-
Julien Bensmail,
Fionn Mc Inerney,
and Kasper Lyngsie.
On a,b-edge-weightings of bipartite graphs with odd a,b.
Discussiones Mathematicae Graph Theory,
2019.
[WWW
] [PDF
]
@article{bensmail:hal-01988399,
TITLE = {{On {a,b}-edge-weightings of bipartite graphs with odd a,b}},
AUTHOR = {Bensmail, Julien and Mc Inerney, Fionn and Lyngsie, Kasper},
URL = {https://hal.archives-ouvertes.fr/hal-01988399},
JOURNAL = {{Discussiones Mathematicae Graph Theory}},
PUBLISHER = {{University of Zielona G{\'o}ra}},
YEAR = {2019},
PDF = {https://hal.archives-ouvertes.fr/hal-01988399v2/file/odd-odd-bip.pdf},
HAL_ID = {hal-01988399},
HAL_VERSION = {v2},
}
-
Julien Bensmail and Jakub PrzybyÆo.
Decomposability of graphs into subgraphs fulfilling the 1-2-3 Conjecture.
Discrete Applied Mathematics,
September 2019.
[WWW
] [PDF
]
Keywords:
graph decomposition,
1-2-3 Conjecture,
locally irregular graph.
@article{bensmail:hal-02288797,
TITLE = {{Decomposability of graphs into subgraphs fulfilling the 1-2-3 Conjecture}},
AUTHOR = {Bensmail, Julien and PrzybyÆo, Jakub},
URL = {https://hal.archives-ouvertes.fr/hal-02288797},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
YEAR = {2019},
MONTH = Sep,
DOI = {10.1016/j.dam.2019.04.011},
KEYWORDS = {graph decomposition ; 1-2-3 Conjecture ; locally irregular graph},
PDF = {https://hal.archives-ouvertes.fr/hal-02288797/file/regular_decomposition_123_DAM_REVISED.pdf},
HAL_ID = {hal-02288797},
HAL_VERSION = {v1},
}
-
Julien Bensmail.
A 1-2-3-4 result for the 1-2-3 Conjecture in 5-regular graphs.
Discrete Applied Mathematics,
257:31-39,
February 2019.
[WWW
] [PDF
]
Keywords:
1-2-3 Conjecture,
Four weights,
5-regular graphs.
@article{bensmail:hal-01509365,
TITLE = {{A 1-2-3-4 result for the 1-2-3 Conjecture in 5-regular graphs}},
AUTHOR = {Bensmail, Julien},
URL = {https://hal.archives-ouvertes.fr/hal-01509365},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {257},
PAGES = {31-39},
YEAR = {2019},
MONTH = Feb,
DOI = {10.1016/j.dam.2018.10.008},
KEYWORDS = {1-2-3 Conjecture ; Four weights ; 5-regular graphs},
PDF = {https://hal.archives-ouvertes.fr/hal-01509365v2/file/123reg.pdf},
HAL_ID = {hal-01509365},
HAL_VERSION = {v2},
}
-
Julien Bensmail.
On the 2-edge-coloured chromatic number of grids.
The Australasian Journal of Combinatorics,
75(3):365-384,
2019.
[WWW
] [PDF
]
Keywords:
grids,
oriented chromatic number,
2-edge-coloured chromatic number.
@article{bensmail:hal-02264958,
TITLE = {{On the 2-edge-coloured chromatic number of grids}},
AUTHOR = {Bensmail, Julien},
URL = {https://hal.archives-ouvertes.fr/hal-02264958},
JOURNAL = {{The Australasian Journal of Combinatorics}},
PUBLISHER = {{Combinatorial Mathematics Society of Australasia (Inc.)}},
VOLUME = {75},
NUMBER = {3},
PAGES = {365-384},
YEAR = {2019},
KEYWORDS = {grids ; oriented chromatic number ; 2-edge-coloured chromatic number},
PDF = {https://hal.archives-ouvertes.fr/hal-02264958v2/file/grids.pdf},
HAL_ID = {hal-02264958},
HAL_VERSION = {v2},
}
-
Jean-Claude Bermond,
Augustin Chaintreau,
Guillaume Ducoffe,
and Dorian Mazauric.
How long does it take for all users in a social network to choose their communities?.
Discrete Applied Mathematics,
270:37-57,
2019.
[WWW
] [PDF
]
Keywords:
graphs,
communities,
social networks,
algorithms,
integer partitions,
coloring games.
@article{bermond:hal-02264327,
TITLE = {{How long does it take for all users in a social network to choose their communities?}},
AUTHOR = {Bermond, Jean-Claude and Chaintreau, Augustin and Ducoffe, Guillaume and Mazauric, Dorian},
URL = {https://hal.inria.fr/hal-02264327},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {270},
PAGES = {37-57},
YEAR = {2019},
DOI = {10.1016/j.dam.2019.07.023},
KEYWORDS = {graphs ; communities ; social networks ; algorithms ; integer partitions ; coloring games},
PDF = {https://hal.inria.fr/hal-02264327/file/no-format-01-08-19.pdf},
HAL_ID = {hal-02264327},
HAL_VERSION = {v1},
}
-
Jean-Claude Bermond and Fatima Zahra Moataz.
On spectrum assignment in elastic optical tree-networks.
Discrete Applied Mathematics,
257:40-52,
2019.
[WWW
] [PDF
]
Keywords:
Elastic optical networks,
spectrum assignment,
interval coloring,
chordal graphs.
@article{bermond:hal-01962617,
TITLE = {{On spectrum assignment in elastic optical tree-networks}},
AUTHOR = {Bermond, Jean-Claude and Moataz, Fatima Zahra},
URL = {https://hal.inria.fr/hal-01962617},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {257},
PAGES = {40-52},
YEAR = {2019},
DOI = {10.1016/j.dam.2018.09.021},
KEYWORDS = {Elastic optical networks ; spectrum assignment ; interval coloring ; chordal graphs},
PDF = {https://hal.inria.fr/hal-01962617/file/elasticDAMpreprintsubmission.pdf},
HAL_ID = {hal-01962617},
HAL_VERSION = {v1},
}
-
Anthony Bonato,
Nancy Clarke,
Danielle Cox,
Stephen Finbow,
Fionn Mc Inerney,
and Margaret-Ellen Messinger.
Hyperopic Cops and Robbers.
Theoretical Computer Science,
794:59-68,
2019.
[WWW
] [PDF
]
@article{bonato:hal-01627391,
TITLE = {{Hyperopic Cops and Robbers}},
AUTHOR = {Bonato, Anthony and Clarke, Nancy and Cox, Danielle and Finbow, Stephen and Mc Inerney, Fionn and Messinger, Margaret-Ellen},
URL = {https://hal.inria.fr/hal-01627391},
JOURNAL = {{Theoretical Computer Science}},
PUBLISHER = {{Elsevier}},
VOLUME = {794},
PAGES = {59-68},
YEAR = {2019},
PDF = {https://hal.inria.fr/hal-01627391v2/file/HyperopicCops0826.pdf},
HAL_ID = {hal-01627391},
HAL_VERSION = {v2},
}
-
Michele Borassi and Emanuele Natale.
KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation.
ACM Journal of Experimental Algorithmics,
24(1),
February 2019.
[WWW
] [PDF
]
Keywords:
shortest path algorithm,
graph mining,
sampling,
network analysis,
Betweenness centrality.
@article{borassi:hal-02043367,
TITLE = {{KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation}},
AUTHOR = {Borassi, Michele and Natale, Emanuele},
URL = {https://hal.inria.fr/hal-02043367},
JOURNAL = {{ACM Journal of Experimental Algorithmics}},
PUBLISHER = {{Association for Computing Machinery}},
VOLUME = {24},
NUMBER = {1},
YEAR = {2019},
MONTH = Feb,
DOI = {10.1145/3284359},
KEYWORDS = {shortest path algorithm ; graph mining ; sampling ; network analysis ; Betweenness centrality},
PDF = {https://hal.inria.fr/hal-02043367/file/kadabra_1604.08553.pdf},
HAL_ID = {hal-02043367},
HAL_VERSION = {v1},
}
-
Nicolas Bousquet,
William Lochet,
and Stéphan Thomassé.
A proof of the Erdös--Sands--Sauer--Woodrow conjecture.
Journal of Combinatorial Theory, Series B,
137:316-319,
July 2019.
[WWW
] [PDF
]
Keywords:
Tournaments,
Domination,
Transitive digraphs.
@article{bousquet:hal-02158330,
TITLE = {{A proof of the Erd{\"o}s--Sands--Sauer--Woodrow conjecture}},
AUTHOR = {Bousquet, Nicolas and Lochet, William and Thomass{\'e}, St{\'e}phan},
URL = {https://hal.archives-ouvertes.fr/hal-02158330},
JOURNAL = {{Journal of Combinatorial Theory, Series B}},
PUBLISHER = {{Elsevier}},
SERIES = {Elsevier Journal of Combinatorial Theory, Series B},
VOLUME = {137},
PAGES = {316-319},
YEAR = {2019},
MONTH = Jul,
DOI = {10.1016/j.jctb.2018.11.005},
KEYWORDS = {Tournaments ; Domination ; Transitive digraphs},
PDF = {https://hal.archives-ouvertes.fr/hal-02158330/file/monoPath.pdf},
HAL_ID = {hal-02158330},
HAL_VERSION = {v1},
}
-
Christelle Caillouet,
Frédéric Giroire,
and Tahiry Razafindralambo.
Efficient Data Collection and Tracking with Flying Drones.
Ad Hoc Networks,
89(C):35-46,
2019.
[WWW
] [PDF
]
Keywords:
Wireless Sensor Network,
Coverage,
UAV.
@article{caillouet:hal-02043136,
TITLE = {{Efficient Data Collection and Tracking with Flying Drones}},
AUTHOR = {Caillouet, Christelle and Giroire, Fr{\'e}d{\'e}ric and Razafindralambo, Tahiry},
URL = {https://hal.inria.fr/hal-02043136},
JOURNAL = {{Ad Hoc Networks}},
PUBLISHER = {{Elsevier}},
SERIES = {Ad Hoc Networks},
VOLUME = {89},
NUMBER = {C},
PAGES = {35-46},
YEAR = {2019},
DOI = {10.1016/j.adhoc.2019.01.011},
KEYWORDS = {Wireless Sensor Network ; Coverage ; UAV},
PDF = {https://hal.inria.fr/hal-02043136/file/main.pdf},
HAL_ID = {hal-02043136},
HAL_VERSION = {v1},
}
-
David Coudert,
Guillaume Ducoffe,
and Alexandru Popa.
P-FPT algorithms for bounded clique-width graphs.
ACM Transactions on Algorithms,
15(3):1-57,
June 2019.
[WWW
] [PDF
]
@article{coudert:hal-02152971,
TITLE = {{P-FPT algorithms for bounded clique-width graphs}},
AUTHOR = {Coudert, David and Ducoffe, Guillaume and Popa, Alexandru},
URL = {https://hal.archives-ouvertes.fr/hal-02152971},
JOURNAL = {{ACM Transactions on Algorithms}},
PUBLISHER = {{Association for Computing Machinery}},
VOLUME = {15},
NUMBER = {3},
PAGES = {1-57},
YEAR = {2019},
MONTH = Jun,
DOI = {10.1145/3310228},
PDF = {https://hal.archives-ouvertes.fr/hal-02152971/file/hal-version-talg.pdf},
HAL_ID = {hal-02152971},
HAL_VERSION = {v1},
}
-
François Dross and Frédéric Havet.
On the Unavoidability of Oriented Trees.
Electronic Notes in Theoretical Computer Science,
346:425-436,
August 2019.
[WWW
] [PDF
]
Keywords:
Tournament,
oriented trees,
unavoidability,
Ramsey theory.
@article{dross:hal-02350215,
TITLE = {{On the Unavoidability of Oriented Trees}},
AUTHOR = {Dross, Fran{\c c}ois and Havet, Fr{\'e}d{\'e}ric},
URL = {https://hal.inria.fr/hal-02350215},
JOURNAL = {{Electronic Notes in Theoretical Computer Science}},
PUBLISHER = {{Elsevier}},
VOLUME = {346},
PAGES = {425-436},
YEAR = {2019},
MONTH = Aug,
DOI = {10.1016/j.entcs.2019.08.038},
KEYWORDS = {Tournament ; oriented trees ; unavoidability ; Ramsey theory},
PDF = {https://hal.inria.fr/hal-02350215/file/ENTCS.pdf},
HAL_ID = {hal-02350215},
HAL_VERSION = {v1},
}
-
Pierre Fraigniaud and Emanuele Natale.
Noisy rumor spreading and plurality consensus.
Distributed Computing,
32(4):257-276,
2019.
[WWW
] [PDF
]
Keywords:
Noise,
Biological distributed algorithms,
PUSH model,
Plurality consensus,
Rumor spreading.
@article{fraigniaud:hal-02001830,
TITLE = {{Noisy rumor spreading and plurality consensus}},
AUTHOR = {Fraigniaud, Pierre and Natale, Emanuele},
URL = {https://hal.archives-ouvertes.fr/hal-02001830},
JOURNAL = {{Distributed Computing}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {32},
NUMBER = {4},
PAGES = {257-276},
YEAR = {2019},
DOI = {10.1007/s00446-018-0335-5},
KEYWORDS = {Noise ; Biological distributed algorithms ; PUSH model ; Plurality consensus ; Rumor spreading},
PDF = {https://hal.archives-ouvertes.fr/hal-02001830/file/Noisy_Plurality_Consensus.pdf},
HAL_ID = {hal-02001830},
HAL_VERSION = {v1},
}
-
Valentin Garnero,
Christophe Paul,
Ignasi Sau Valls,
and Dimitrios M. Thilikos.
Explicit Linear Kernels for Packing Problems.
Algorithmica,
81(4):1615-1656,
April 2019.
[WWW
] [PDF
]
Keywords:
Parameterized complexity,
linear kernels,
packing problems,
dynamic pro- gramming,
protrusion replacement,
graph minors.
@article{garnero:lirmm-02342736,
TITLE = {{Explicit Linear Kernels for Packing Problems}},
AUTHOR = {Garnero, Valentin and Paul, Christophe and Sau Valls, Ignasi and Thilikos, Dimitrios M.},
URL = {https://hal-lirmm.ccsd.cnrs.fr/lirmm-02342736},
JOURNAL = {{Algorithmica}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {81},
NUMBER = {4},
PAGES = {1615-1656},
YEAR = {2019},
MONTH = Apr,
DOI = {10.1007/s00453-018-0495-5},
KEYWORDS = {Parameterized complexity ; linear kernels ; packing problems ; dynamic pro- gramming ; protrusion replacement ; graph minors},
PDF = {https://hal-lirmm.ccsd.cnrs.fr/lirmm-02342736/file/ALGO-D-16-00298-R1.pdf},
HAL_ID = {lirmm-02342736},
HAL_VERSION = {v1},
}
-
Frédéric Havet and Nicolas Nisse.
Constrained ear decompositions in graphs and digraphs.
Discrete Mathematics and Theoretical Computer Science,
vol. 21 no. 4,
September 2019.
[WWW
] [PDF
]
@article{havet:hal-01798795,
TITLE = {{Constrained ear decompositions in graphs and digraphs}},
AUTHOR = {Havet, Fr{\'e}d{\'e}ric and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01798795},
JOURNAL = {{Discrete Mathematics and Theoretical Computer Science}},
PUBLISHER = {{DMTCS}},
VOLUME = {vol. 21 no. 4},
YEAR = {2019},
MONTH = Sep,
PDF = {https://hal.inria.fr/hal-01798795v3/file/oddEarDec-final.pdf},
HAL_ID = {hal-01798795},
HAL_VERSION = {v3},
}
-
Brigitte Jaumard,
Hamed Pouya,
and David Coudert.
Wavelength Defragmentation for Seamless Migration.
Journal of Lightwave Technology,
37(17):4382-4393,
September 2019.
[WWW
] [PDF
]
Keywords:
Network Reconfig- uration,
Network Reconfiguration,
Fragmented Network,
Routing and Wavelength Assignment,
Wavelength Defragmentation,
Seamless Defragmentation,
Make-Before-Break Rerouting.
@article{jaumard:hal-02167682,
TITLE = {{Wavelength Defragmentation for Seamless Migration}},
AUTHOR = {Jaumard, Brigitte and Pouya, Hamed and Coudert, David},
URL = {https://hal.inria.fr/hal-02167682},
JOURNAL = {{Journal of Lightwave Technology}},
PUBLISHER = {{Institute of Electrical and Electronics Engineers (IEEE)/Optical Society of America(OSA)}},
VOLUME = {37},
NUMBER = {17},
PAGES = {4382-4393},
YEAR = {2019},
MONTH = Sep,
DOI = {10.1109/JLT.2019.2924914},
KEYWORDS = {Network Reconfig- uration ; Network Reconfiguration ; Fragmented Network ; Routing and Wavelength Assignment ; Wavelength Defragmentation ; Seamless Defragmentation ; Make-Before-Break Rerouting},
PDF = {https://hal.inria.fr/hal-02167682/file/RWA_MBB_JLT_hal.pdf},
HAL_ID = {hal-02167682},
HAL_VERSION = {v1},
}
-
Kolja Knauer and Nicolas Nisse.
Computing metric hulls in graphs.
Discrete Mathematics and Theoretical Computer Science,
vol. 21 no. 1, ICGT 2018,
May 2019.
[WWW
] [PDF
]
@article{knauer:hal-01612515,
TITLE = {{Computing metric hulls in graphs}},
AUTHOR = {Knauer, Kolja and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01612515},
JOURNAL = {{Discrete Mathematics and Theoretical Computer Science}},
PUBLISHER = {{DMTCS}},
VOLUME = {vol. 21 no. 1, ICGT 2018},
YEAR = {2019},
MONTH = May,
PDF = {https://hal.inria.fr/hal-01612515v4/file/DMTCS_MetricHull_Final.pdf},
HAL_ID = {hal-01612515},
HAL_VERSION = {v4},
}
-
William Lochet.
Immersion of transitive tournaments in digraphs with large minimum outdegree.
Journal of Combinatorial Theory, Series B,
134:350-353,
January 2019.
[WWW
] [PDF
]
Keywords:
Immersions,
Digraphs,
Transitive tournaments.
@article{lochet:hal-01835124,
TITLE = {{Immersion of transitive tournaments in digraphs with large minimum outdegree}},
AUTHOR = {Lochet, William},
URL = {https://hal.archives-ouvertes.fr/hal-01835124},
JOURNAL = {{Journal of Combinatorial Theory, Series B}},
PUBLISHER = {{Elsevier}},
VOLUME = {134},
PAGES = {350-353},
YEAR = {2019},
MONTH = Jan,
DOI = {10.1016/j.jctb.2018.05.004},
KEYWORDS = {Immersions ; Digraphs ; Transitive tournaments},
PDF = {https://hal.archives-ouvertes.fr/hal-01835124/file/immersion_final.pdf},
HAL_ID = {hal-01835124},
HAL_VERSION = {v1},
}
-
Julien Bensmail,
Fionn Mc Inerney,
and Nicolas Nisse.
Dimension Métrique des Graphes Orientés.
In AlgoTel 2019 - 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
Saint Laurent de la Cabrerisse, France,
June 2019.
[WWW
] [PDF
]
Keywords:
Graphes,
Dimension Métrique,
Ensembles Resolvants,
Orientations fortement connexes.
@inproceedings{bensmail:hal-02118847,
TITLE = {{Dimension M{\'e}trique des Graphes Orient{\'e}s}},
AUTHOR = {Bensmail, Julien and Mc Inerney, Fionn and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-02118847},
BOOKTITLE = {{AlgoTel 2019 - 21{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Saint Laurent de la Cabrerisse, France},
YEAR = {2019},
MONTH = Jun,
KEYWORDS = {Graphes ; Dimension M{\'e}trique ; Ensembles Resolvants ; Orientations fortement connexes},
PDF = {https://hal.inria.fr/hal-02118847/file/corrected_algotel2019_md_oriente.pdf},
HAL_ID = {hal-02118847},
HAL_VERSION = {v1},
}
-
Julien Bensmail,
Fionn Mc Inerney,
and Nicolas Nisse.
Metric Dimension: from Graphs to Oriented Graphs.
In LAGOS 2019 - 10th Latin & American Algorithms, Graphs and Optimization Symposium,
volume 346 of Electronic Notes in Theoretical Computer Science,
Belo Horizonte, Brazil,
pages 111-123,
June 2019.
[WWW
] [PDF
]
Keywords:
Strongly-connected orientations,
Resolving sets,
Metric dimension.
@inproceedings{bensmail:hal-02098194,
TITLE = {{Metric Dimension: from Graphs to Oriented Graphs}},
AUTHOR = {Bensmail, Julien and Mc Inerney, Fionn and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-02098194},
BOOKTITLE = {{LAGOS 2019 - 10th Latin \& American Algorithms, Graphs and Optimization Symposium}},
ADDRESS = {Belo Horizonte, Brazil},
SERIES = {Electronic Notes in Theoretical Computer Science},
VOLUME = {346},
PAGES = {111-123},
YEAR = {2019},
MONTH = Jun,
KEYWORDS = {Strongly-connected orientations ; Resolving sets ; Metric dimension},
PDF = {https://hal.inria.fr/hal-02098194/file/oriented_metric_dimension_HAL_LAGOS.pdf},
HAL_ID = {hal-02098194},
HAL_VERSION = {v1},
}
-
Jean-Claude Bermond,
Takako Kodate,
and Joseph Yu.
Gossiping with interference in radio chain networks (upper bound algorithms).
In JCDCG-3 - 22th Japan Conference on Discrete and Computational Geometry, Graphs, and Games,
Tokyo, Japan,
September 2019.
[WWW
] [PDF
]
@inproceedings{bermond:hal-02316854,
TITLE = {{Gossiping with interference in radio chain networks (upper bound algorithms)}},
AUTHOR = {Bermond, Jean-Claude and Kodate, Takako and Yu, Joseph},
URL = {https://hal.inria.fr/hal-02316854},
BOOKTITLE = {{JCDCG-3 - 22th Japan Conference on Discrete and Computational Geometry, Graphs, and Games}},
ADDRESS = {Tokyo, Japan},
YEAR = {2019},
MONTH = Sep,
PDF = {https://hal.inria.fr/hal-02316854/file/abstractBKY2019.pdf},
HAL_ID = {hal-02316854},
HAL_VERSION = {v1},
}
-
Yann Busnel,
Christelle Caillouet,
and David Coudert.
Self-organized UAV-based Supervision and Connectivity: Challenges and Opportunities.
In NCA 2019 - 18th IEEE International Symposium on Network Computing and Applications,
Cambridge, United States,
pages 1-5,
September 2019.
IEEE.
[WWW
] [PDF
]
@inproceedings{busnel:hal-02267396,
TITLE = {{Self-organized UAV-based Supervision and Connectivity: Challenges and Opportunities}},
AUTHOR = {Busnel, Yann and Caillouet, Christelle and Coudert, David},
URL = {https://hal.inria.fr/hal-02267396},
BOOKTITLE = {{NCA 2019 - 18th IEEE International Symposium on Network Computing and Applications}},
ADDRESS = {Cambridge, United States},
PUBLISHER = {{IEEE}},
PAGES = {1-5},
YEAR = {2019},
MONTH = Sep,
DOI = {10.1109/NCA.2019.8935060},
PDF = {https://hal.inria.fr/hal-02267396/file/Position_Paper___NCA_2019%29.pdf},
HAL_ID = {hal-02267396},
HAL_VERSION = {v1},
}
-
Yann Busnel,
Christelle Caillouet,
and David Coudert.
Self-organized Disaster Management System by Distributed Deployment of Connected UAVs.
In ICT-DM 2019 - 6th International Conference on Information and Communication Technologies for Disaster Management,
Paris, France,
pages 1-8,
December 2019.
[WWW
] [PDF
]
@inproceedings{busnel:hal-02349396,
TITLE = {{Self-organized Disaster Management System by Distributed Deployment of Connected UAVs}},
AUTHOR = {Busnel, Yann and Caillouet, Christelle and Coudert, David},
URL = {https://hal.inria.fr/hal-02349396},
BOOKTITLE = {{ICT-DM 2019 - 6th International Conference on Information and Communication Technologies for Disaster Management}},
ADDRESS = {Paris, France},
PAGES = {1-8},
YEAR = {2019},
MONTH = Dec,
DOI = {10.1109/ICT-DM47966.2019.9032964},
PDF = {https://hal.inria.fr/hal-02349396/file/Spread_Shrink%29.pdf},
HAL_ID = {hal-02349396},
HAL_VERSION = {v1},
}
-
Christelle Caillouet,
Martin Heusse,
and Franck Rousseau.
Optimal SF Allocation in LoRaWAN Considering Physical Capture and Imperfect Orthogonality.
In GLOBECOM 2019 - IEEE Global Communications Conference,
Waikoloa, United States,
December 2019.
[WWW
] [PDF
]
@inproceedings{caillouet:hal-02267218,
TITLE = {{Optimal SF Allocation in LoRaWAN Considering Physical Capture and Imperfect Orthogonality}},
AUTHOR = {Caillouet, Christelle and Heusse, Martin and Rousseau, Franck},
URL = {https://hal.inria.fr/hal-02267218},
BOOKTITLE = {{GLOBECOM 2019 - IEEE Global Communications Conference}},
ADDRESS = {Waikoloa, United States},
YEAR = {2019},
MONTH = Dec,
DOI = {10.1109/GLOBECOM38437.2019.9013602},
PDF = {https://hal.inria.fr/hal-02267218/file/main.pdf},
HAL_ID = {hal-02267218},
HAL_VERSION = {v1},
}
-
Christelle Caillouet,
Tahiry Razafindralambo,
and Dimitrios Zorbas.
Optimal placement of drones for fast sensor energy replenishment using wireless power transfer.
In WD 2019 - Wireless Days 2019,
Manchester, United Kingdom,
April 2019.
Note: Best Paper Award.
[WWW
] [PDF
]
@inproceedings{caillouet:hal-02043123,
TITLE = {{Optimal placement of drones for fast sensor energy replenishment using wireless power transfer}},
AUTHOR = {Caillouet, Christelle and Razafindralambo, Tahiry and Zorbas, Dimitrios},
URL = {https://hal.inria.fr/hal-02043123},
NOTE = {Best Paper Award},
BOOKTITLE = {{WD 2019 - Wireless Days 2019}},
ADDRESS = {Manchester, United Kingdom},
YEAR = {2019},
MONTH = Apr,
DOI = {10.1109/WD.2019.8734203},
PDF = {https://hal.inria.fr/hal-02043123/file/cameraReady.pdf},
HAL_ID = {hal-02043123},
HAL_VERSION = {v1},
}
-
Christelle Caillouet,
Tahiry Razafindralambo,
and Dimitrios Zorbas.
Utiliser des drones pour recharger efficacement des capteurs.
In ALGOTEL 2019 - 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
Saint Laurent de la Cabrerisse, France,
June 2019.
[WWW
] [PDF
]
@inproceedings{caillouet:hal-02129960,
TITLE = {{Utiliser des drones pour recharger efficacement des capteurs}},
AUTHOR = {Caillouet, Christelle and Razafindralambo, Tahiry and Zorbas, Dimitrios},
URL = {https://hal.inria.fr/hal-02129960},
BOOKTITLE = {{ALGOTEL 2019 - 21{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Saint Laurent de la Cabrerisse, France},
YEAR = {2019},
MONTH = Jun,
PDF = {https://hal.inria.fr/hal-02129960/file/sample-algotel.pdf},
HAL_ID = {hal-02129960},
HAL_VERSION = {v1},
}
-
Emilio Cruciani,
Emanuele Natale,
and Giacomo Scornavacca.
Distributed Community Detection via Metastability of the 2-Choices Dynamics.
In AAAI 2019 - 33th AAAI Conference Association for the Advancement of Artificial Intelligence,
Honolulu, United States,
January 2019.
[WWW
] [PDF
]
@inproceedings{cruciani:hal-02002462,
TITLE = {{Distributed Community Detection via Metastability of the 2-Choices Dynamics}},
AUTHOR = {Cruciani, Emilio and Natale, Emanuele and Scornavacca, Giacomo},
URL = {https://hal.archives-ouvertes.fr/hal-02002462},
BOOKTITLE = {{AAAI 2019 - 33th AAAI Conference Association for the Advancement of Artificial Intelligence}},
ADDRESS = {Honolulu, United States},
YEAR = {2019},
MONTH = Jan,
PDF = {https://hal.archives-ouvertes.fr/hal-02002462/file/2_Choices_Metastability___AAAI19___HAL_version.pdf},
HAL_ID = {hal-02002462},
HAL_VERSION = {v1},
}
-
Giuseppe Di Lena,
Andrea Tomassilli,
Damien Saucez,
Frédéric Giroire,
Thierry Turletti,
and Chidung Lac.
Mininet on steroids: exploiting the cloud for Mininet performance.
In CloudNet 2019 - IEEE International Conference on Cloud Networking,
Coimbra, Portugal,
November 2019.
[WWW
] [PDF
]
@inproceedings{dilena:hal-02362997,
TITLE = {{Mininet on steroids: exploiting the cloud for Mininet performance}},
AUTHOR = {Di Lena, Giuseppe and Tomassilli, Andrea and Saucez, Damien and Giroire, Fr{\'e}d{\'e}ric and Turletti, Thierry and Lac, Chidung},
URL = {https://hal.inria.fr/hal-02362997},
BOOKTITLE = {{CloudNet 2019 - IEEE International Conference on Cloud Networking}},
ADDRESS = {Coimbra, Portugal},
YEAR = {2019},
MONTH = Nov,
PDF = {https://hal.inria.fr/hal-02362997/file/CloudNet%2815 (nil)df},
HAL_ID = {hal-02362997},
HAL_VERSION = {v1},
}
-
Adrien Gausseran,
Andrea Tomassilli,
Frédéric Giroire,
and Joanna Moulierac.
Reconfiguration de chaînes de fonctions de services sans interruption.
In CORES 2019 - Rencontres Francophones sur la Conception de Protocoles, lâÉvaluation de Performance et lâExpérimentation des Réseaux de Communication,
Saint Laurent de la Cabrerisse, France,
June 2019.
[WWW
] [PDF
]
Keywords:
NFV,
SDN,
Reconfiguration,
SFC.
@inproceedings{gausseran:hal-02118989,
TITLE = {{Reconfiguration de cha{\^i}nes de fonctions de services sans interruption}},
AUTHOR = {Gausseran, Adrien and Tomassilli, Andrea and Giroire, Fr{\'e}d{\'e}ric and Moulierac, Joanna},
URL = {https://hal.archives-ouvertes.fr/hal-02118989},
BOOKTITLE = {{CORES 2019 - Rencontres Francophones sur la Conception de Protocoles, lâ{\'E}valuation de Performance et lâExp{\'e}rimentation des R{\'e}seaux de Communication}},
ADDRESS = {Saint Laurent de la Cabrerisse, France},
YEAR = {2019},
MONTH = Jun,
KEYWORDS = {NFV ; SDN ; Reconfiguration ; SFC},
PDF = {https://hal.archives-ouvertes.fr/hal-02118989/file/AlgoTel.pdf},
HAL_ID = {hal-02118989},
HAL_VERSION = {v1},
}
-
Adrien Gausseran,
Andrea Tomassilli,
Frédéric Giroire,
and Joanna Moulierac.
Poster: Don't Interrupt Me When You Reconfigure my Service Function Chains.
In IFIP Networking Conference 2019,
Varsovie, Poland,
May 2019.
[WWW
] [PDF
]
Keywords:
Reconfiguration,
Service Function Chaining,
Networking,
Routing.
@inproceedings{gausseran:hal-02083579,
TITLE = {{Poster: Don't Interrupt Me When You Reconfigure my Service Function Chains}},
AUTHOR = {Gausseran, Adrien and Tomassilli, Andrea and Giroire, Fr{\'e}d{\'e}ric and Moulierac, Joanna},
URL = {https://hal.inria.fr/hal-02083579},
BOOKTITLE = {{IFIP Networking Conference 2019}},
ADDRESS = {Varsovie, Poland},
YEAR = {2019},
MONTH = May,
KEYWORDS = {Reconfiguration ; Service Function Chaining ; Networking ; Routing},
PDF = {https://hal.inria.fr/hal-02083579/file/networking-short.pdf},
HAL_ID = {hal-02083579},
HAL_VERSION = {v1},
}
-
Adrien Gausseran,
Andrea Tomassilli,
Frédéric Giroire,
and Joanna Moulierac.
No Interruption When Reconfiguring my SFCs.
In CloudNet 2019 - 8th IEEE International Conference on Cloud Networking,
Coimbra, Portugal,
November 2019.
Note: This work has been supported by the French government through the UCAJEDI (ANR-15-IDEX-01) and EUR DS4H (ANR-17-EURE-004) Investments in the Future projects, and by Inria associated team EfDyNet. [WWW
] [PDF
]
@inproceedings{gausseran:hal-02295967,
TITLE = {{No Interruption When Reconfiguring my SFCs}},
AUTHOR = {Gausseran, Adrien and Tomassilli, Andrea and Giroire, Fr{\'e}d{\'e}ric and Moulierac, Joanna},
URL = {https://hal.inria.fr/hal-02295967},
NOTE = {This work has been supported by the French government through the UCAJEDI (ANR-15-IDEX-01) and EUR DS4H (ANR-17-EURE-004) Investments in the Future projects, and by Inria associated team EfDyNet.},
BOOKTITLE = {{CloudNet 2019 - 8th IEEE International Conference on Cloud Networking}},
ADDRESS = {Coimbra, Portugal},
YEAR = {2019},
MONTH = Nov,
PDF = {https://hal.inria.fr/hal-02295967/file/PID6145639.pdf},
HAL_ID = {hal-02295967},
HAL_VERSION = {v1},
}
-
Frédéric Giroire,
Nicolas Huin,
Andrea Tomassilli,
and Stéphane Pérennes.
When Network Matters: Data Center Scheduling with Network Tasks.
In INFOCOM 2019 - IEEE International Conference on Computer Communications,
Paris, France,
April 2019.
[WWW
] [PDF
]
@inproceedings{giroire:hal-01989755,
TITLE = {{When Network Matters: Data Center Scheduling with Network Tasks}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and Huin, Nicolas and Tomassilli, Andrea and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.inria.fr/hal-01989755},
BOOKTITLE = {{INFOCOM 2019 - IEEE International Conference on Computer Communications}},
ADDRESS = {Paris, France},
YEAR = {2019},
MONTH = Apr,
PDF = {https://hal.inria.fr/hal-01989755/file/infocom2019_camera_ready.pdf},
HAL_ID = {hal-01989755},
HAL_VERSION = {v1},
}
-
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Eternal Domination in Grids.
In CIAC 2019 - 11th International Conference on Algorithms and Complexity,
volume 11485 of Algorithms and Complexity. Lecture Notes in Computer Science,
Rome, Italy,
pages 311-322,
May 2019.
[WWW
] [PDF
]
Keywords:
Grids,
Combinatorial Games,
Graphs,
Eternal Domination.
@inproceedings{mcinerney:hal-02098169,
TITLE = {{Eternal Domination in Grids}},
AUTHOR = {Mc Inerney, Fionn and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.inria.fr/hal-02098169},
BOOKTITLE = {{CIAC 2019 - 11th International Conference on Algorithms and Complexity}},
ADDRESS = {Rome, Italy},
SERIES = {Algorithms and Complexity. Lecture Notes in Computer Science},
VOLUME = {11485},
PAGES = {311-322},
YEAR = {2019},
MONTH = May,
KEYWORDS = {Grids ; Combinatorial Games ; Graphs ; Eternal Domination},
PDF = {https://hal.inria.fr/hal-02098169/file/eter_dom_grids_CIAC2019_Corrected.pdf},
HAL_ID = {hal-02098169},
HAL_VERSION = {v1},
}
-
Cedric Morin,
Géraldine Texier,
Christelle Caillouet,
Gilles Desmangles,
and Cao-Thanh Phan.
VNF placement algorithms to address the mono- and multi-tenant issues in edge and core networks.
In CLOUDNET 2019 : 8th IEEE International Conference on Cloud Networking,
Coimbra, Portugal,
November 2019.
[WWW
] [PDF
]
Keywords:
mono-tenant architecture,
multi- tenant architecture,
VNF placement optimization.
@inproceedings{morin:hal-02313403,
TITLE = {{VNF placement algorithms to address the mono- and multi-tenant issues in edge and core networks}},
AUTHOR = {Morin, Cedric and Texier, G{\'e}raldine and Caillouet, Christelle and Desmangles, Gilles and Phan, Cao-Thanh},
URL = {https://hal.archives-ouvertes.fr/hal-02313403},
BOOKTITLE = {{CLOUDNET 2019 : 8th IEEE International Conference on Cloud Networking}},
ADDRESS = {Coimbra, Portugal},
YEAR = {2019},
MONTH = Nov,
DOI = {10.1109/CloudNet47604.2019.9064108},
KEYWORDS = {mono-tenant architecture ; multi- tenant architecture ; VNF placement optimization},
PDF = {https://hal.archives-ouvertes.fr/hal-02313403/file/1570576684%282 0x4df},
HAL_ID = {hal-02313403},
HAL_VERSION = {v1},
}
-
Emanuele Natale and Iliad Ramezani.
On the Necessary Memory to Compute the Plurality in Multi-Agent Systems.
In CIAC 2019 - 11th International Conference Algorithms and Complexity,
Rome, Italy,
pages 323-338,
May 2019.
Note: 14 pages, accepted at CIAC 2019.
[WWW
] [PDF
]
@inproceedings{natale:hal-02002448,
TITLE = {{On the Necessary Memory to Compute the Plurality in Multi-Agent Systems}},
AUTHOR = {Natale, Emanuele and Ramezani, Iliad},
URL = {https://hal.archives-ouvertes.fr/hal-02002448},
NOTE = {14 pages, accepted at CIAC 2019},
BOOKTITLE = {{CIAC 2019 - 11th International Conference Algorithms and Complexity}},
ADDRESS = {Rome, Italy},
PAGES = {323-338},
YEAR = {2019},
MONTH = May,
DOI = {10.1007/978-3-030-17402-6\_27},
PDF = {https://hal.archives-ouvertes.fr/hal-02002448/file/ciac_1901.06549.pdf},
HAL_ID = {hal-02002448},
HAL_VERSION = {v1},
}
-
Andrea Tomassilli,
Giuseppe Di Lena,
Frédéric Giroire,
Issam Tahiri,
Damien Saucez,
Stéphane Pérennes,
Thierry Turletti,
Ruslan Sadykov,
François Vanderbeck,
and Chidung Lac.
Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks.
In CloudNet 2019 - 8th IEEE International Conference on Cloud Networking,
Coimbra, Portugal,
November 2019.
[WWW
] [PDF
]
@inproceedings{tomassilli:hal-02292971,
TITLE = {{Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks}},
AUTHOR = {Tomassilli, Andrea and Di Lena, Giuseppe and Giroire, Fr{\'e}d{\'e}ric and Tahiri, Issam and Saucez, Damien and P{\'e}rennes, St{\'e}phane and Turletti, Thierry and Sadykov, Ruslan and Vanderbeck, Fran{\c c}ois and Lac, Chidung},
URL = {https://hal.inria.fr/hal-02292971},
BOOKTITLE = {{CloudNet 2019 - 8th IEEE International Conference on Cloud Networking}},
ADDRESS = {Coimbra, Portugal},
YEAR = {2019},
MONTH = Nov,
PDF = {https://hal.inria.fr/hal-02292971/file/camera-ready-cloudnet.pdf},
HAL_ID = {hal-02292971},
HAL_VERSION = {v1},
}
-
Andrea Tomassilli,
Nicolas Huin,
and Frédéric Giroire.
The Structured Way of Dealing with Heterogeneous Live Streaming Systems.
In 3PGCIC - International Conference on P2P, Parallel, Grid, Cloud and Internet Computing,
Advances on P2P, Parallel, Grid, Cloud and Internet Computing,
Anvers, Belgium,
November 2019.
[WWW
] [PDF
]
@inproceedings{tomassilli:hal-02366221,
TITLE = {{The Structured Way of Dealing with Heterogeneous Live Streaming Systems}},
AUTHOR = {Tomassilli, Andrea and Huin, Nicolas and Giroire, Fr{\'e}d{\'e}ric},
URL = {https://hal.inria.fr/hal-02366221},
BOOKTITLE = {{3PGCIC - International Conference on P2P, Parallel, Grid, Cloud and Internet Computing}},
ADDRESS = {Anvers, Belgium},
SERIES = {Advances on P2P, Parallel, Grid, Cloud and Internet Computing},
YEAR = {2019},
MONTH = Nov,
PDF = {https://hal.inria.fr/hal-02366221/file/2019-3PGCIC-P2P-streaming.pdf},
HAL_ID = {hal-02366221},
HAL_VERSION = {v1},
}
