BACK TO COATI PUBLICATION INDEX
Publications of year 2018
-
Frédéric Giroire.
Optimization of Network Infrastructures.
Habilitation à diriger des recherches,
Université Côte D'Azur,
October 2018.
[WWW
] [PDF
]
Keywords:
Network optimization,
Energy efficiency,
Algorithmics,
Optimization,
Software Defined Networks SDN,
Network Function Virtualization NFV,
Service Function Chaining SFC,
Optimisation des réseaux,
Efficacité énergétique,
Algorithmique,
Optimisation,
Réseaux logiciels SDN,
Virtualisation des fonctions réseau NFV,
Chaîne de fonction de services SFC.
[bibtex-entry]
-
William Lochet.
Substructures in digraphs.
Theses,
Université Côte d'Azur,
July 2018.
[WWW
] [PDF
]
Keywords:
Digraphs,
Entropy compression,
Tournaments,
Graphes dirigés,
Compression d'entropie,
Tournois.
[bibtex-entry]
-
Frédéric Havet and Joergen Bang-Jensen.
Tournaments and Semicomplete Digraphs..
In Classes of Directed Graphs.
2018.
[WWW
] [bibtex-entry]
-
P. Aboulker,
J. Bang-Jensen,
Nicolas Bousquet,
Pierre Charbit,
Frédéric Havet,
F. Maffray,
and J. Zamora.
$$\chi$$-bounded families of oriented graphs.
Journal of Graph Theory,
89(3):304 - 326,
September 2018.
[WWW
] [PDF
] [bibtex-entry]
-
Julio Araujo,
Guillaume Ducoffe,
Nicolas Nisse,
and Karol Suchan.
On interval number in cycle convexity.
Discrete Mathematics and Theoretical Computer Science,
Vol. 20 no. 1(1):1-28,
May 2018.
[WWW
] [PDF
]
Keywords:
convexity,
domination problems in graphs,
interval number,
graph convexity,
complexity,
complexity and algorithms,
dominating set,
graph.
[bibtex-entry]
-
J. Araujo,
Frédéric Havet,
and M. Schmitt.
Steinberg-like theorems for backbone colouring.
Discrete Applied Mathematics,
2018.
[WWW
] [PDF
] [bibtex-entry]
-
Evripidis Bampis,
Alexander Kononov,
Dimitrios Letsios,
Giorgio Lucarelli,
and Maxim Sviridenko.
Energy Efficient Scheduling and Routing via Randomized Rounding.
Journal of Scheduling,
21(1):35-51,
February 2018.
[WWW
] [PDF
] [bibtex-entry]
-
Joergen Bang-Jensen,
Stéphane Bessy,
Frédéric Havet,
and Anders Yeo.
Out-degree reducing partitions of digraphs.
Theoretical Computer Science,
719:64-72,
April 2018.
[WWW
] [PDF
]
Keywords:
Polynomial algorithm,
2-partition,
Maximum out-degree reducing partition,
NP-complete.
[bibtex-entry]
-
Olivier Baudon,
Julien Bensmail,
Hervé Hocquard,
Mohammed Senhaji,
and Eric Sopena.
On locally irregular decompositions of subcubic graphs.
Opuscula Mathematica,
38(6):795-817,
July 2018.
[WWW
] [PDF
] [bibtex-entry]
-
Olivier Baudon,
Julien Bensmail,
Jakub Przybylo,
and Mariusz Wozniak.
On locally irregular decompositions and the 1-2 Conjecture in digraphs.
Discrete Mathematics and Theoretical Computer Science,
vol. 20 no. 2,
October 2018.
[WWW
] [PDF
]
Keywords:
1-2 Conjecture,
locally irregular decompositions,
digraphs.
[bibtex-entry]
-
Olivier Baudon,
Julien Bensmail,
Mohammed Senhaji,
and Eric Sopena.
Neighbour-Sum-2-Distinguishing Edge-Weightings: Doubling the 1-2-3 Conjecture.
Discrete Applied Mathematics,
251(83-92),
November 2018.
[WWW
] [PDF
]
Keywords:
Bipartite graphs,
1-2-3 Conjecture,
Difference-2 distinction.
[bibtex-entry]
-
Julien Bensmail and Nick Brettell.
Orienting edges to fight fire in graphs.
The Australasian Journal of Combinatorics,
71(1):12-42,
March 2018.
[WWW
] [PDF
] [bibtex-entry]
-
Julien Bensmail,
Valentin Garnero,
and Nicolas Nisse.
On improving matchings in trees, via bounded-length augmentations.
Discrete Applied Mathematics,
250(11):110-129,
2018.
[WWW
] [PDF
]
Keywords:
trees,
maximum matchings,
bounded-length augmentations.
[bibtex-entry]
-
Julien Bensmail,
Ararat Harutyunyan,
Tien-Nam Le,
and Stéphan Thomassé.
Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture.
Combinatorica,
2018.
[WWW
] [PDF
] [bibtex-entry]
-
Julien Bensmail,
Ararat Harutyunyan,
and Ngoc Khang Le.
List coloring digraphs.
Journal of Graph Theory,
87(4):492-508,
April 2018.
[WWW
] [PDF
]
Keywords:
dichromatic number,
list dichromatic number,
list coloring,
digraphs.
[bibtex-entry]
-
Anthony Bonato,
Nancy Clarke,
Danielle Cox,
Stephen Finbow,
Fionn Mc Inerney,
and Margaret-Ellen Messinger.
Hyperopic Cops and Robbers.
Theoretical Computer Science,
2018.
[WWW
] [PDF
] [bibtex-entry]
-
Bartlomiej Bosek,
Przemyslaw Gordinowicz,
Jaroslaw Grytczuk,
Nicolas Nisse,
Joanna Sokol,
and Malgorzata Sleszynska-Nowak.
Localization game on geometric and planar graphs.
Discrete Applied Mathematics,
2018.
[WWW
] [PDF
] [bibtex-entry]
-
Bartlomiej Bosek,
Przemyslaw Gordinowicz,
Jaroslaw Grytczuk,
Nicolas Nisse,
Joanna Sokol,
and Malgorzata Sleszynska-Nowak.
Centroidal Localization Game.
The Electronic Journal of Combinatorics,
2018.
[WWW
] [PDF
] [bibtex-entry]
-
Nathann Cohen,
Frédéric Havet,
William Lochet,
and Raul Lopes.
Bispindles in strongly connected digraphs with large chromatic number.
The Electronic Journal of Combinatorics,
June 2018.
[WWW
] [PDF
] [bibtex-entry]
-
Nathann Cohen,
Frédéric Havet,
William Lochet,
and Nicolas Nisse.
Subdivisions of oriented cycles in digraphs with large chromatic number.
Journal of Graph Theory,
89(4):439-456,
April 2018.
[WWW
] [PDF
] [bibtex-entry]
-
Nathann Cohen,
Frédéric Havet,
Dorian Mazauric,
Ignasi Sau,
and Rémi Watrigant.
Complexity dichotomies for the Minimum F -Overlay problem.
Journal of Discrete Algorithms,
52-53:133-142,
September 2018.
[WWW
] [PDF
] [bibtex-entry]
-
Nathann Cohen and Frédéric Havet.
On the minimum size of an identifying code over all orientations of a graph.
The Electronic Journal of Combinatorics,
25(1):#P1.49,
2018.
[WWW
] [PDF
]
Keywords:
identifying code,
orientations,
NP-complete.
[bibtex-entry]
-
Nathann Cohen,
Nicolas Martins,
Fionn Mc Inerney,
Nicolas Nisse,
Stéphane Pérennes,
and Rudini Sampaio.
Spy-game on graphs: Complexity and simple topologies.
Theoretical Computer Science,
725:1 - 15,
May 2018.
[WWW
] [PDF
]
Keywords:
Graphs,
Cops and Robber games,
PSPACE-hard.
[bibtex-entry]
-
Nathann Cohen,
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Study of a Combinatorial Game in Graphs Through Linear Programming.
Algorithmica,
August 2018.
[WWW
] [PDF
]
Keywords:
Domination,
Graphs,
Spy game,
Cops and Robber games,
Linear Programming,
Tree,
Grid.
[bibtex-entry]
-
David Coudert and Guillaume Ducoffe.
Revisiting Decomposition by Clique Separators.
Siam Journal on Discrete Mathematics,
32(1):682 - 694,
January 2018.
[WWW
] [PDF
]
Keywords:
Keyword: clique minimal separator decomposition,
minimal triangulation,
clique-number,
treewidth,
planar graphs,
bounded-degree graphs.
[bibtex-entry]
-
David Coudert,
Guillaume Ducoffe,
Nicolas Nisse,
and Mauricio Soto.
On distance-preserving elimination orderings in graphs: Complexity and algorithms.
Discrete Applied Mathematics,
243:140-153,
March 2018.
[WWW
] [PDF
]
Keywords:
bounded treewidth,
integer linear programming,
Keyword: distance-preserving elimination ordering,
metric graph theory,
NP-complete,
exact exponential algorithm.
[bibtex-entry]
-
Rennan Dantas,
Frédéric Havet,
and Rudini Sampaio.
Minimum density of identifying codes of king grids.
Discrete Mathematics,
341(10):2708 - 2719,
October 2018.
[WWW
] [PDF
]
Keywords:
identifying codes,
king grids,
Discharging Method.
[bibtex-entry]
-
Guillaume Ducoffe.
A short note on the complexity of computing strong pathbreadth.
Information Processing Letters,
133:56-58,
2018.
[WWW
] [PDF
]
Keywords:
NP-complete,
strong pathbreadth,
path decomposition,
acyclic clustering,
graph theory.
[bibtex-entry]
-
Pierre Fraigniaud and Emanuele Natale.
Noisy rumor spreading and plurality consensus.
Distributed Computing,
June 2018.
[WWW
] [bibtex-entry]
-
Frédéric Giroire,
Frédéric Havet,
and Joanna Moulierac.
On the Complexity of Compressing Two Dimensional Routing Tables with Order.
Algorithmica,
80(1):209 - 233,
January 2018.
[WWW
] [PDF
] [bibtex-entry]
-
Frédéric Giroire,
Nicolas Huin,
Joanna Moulierac,
and Truong Khoa Phan.
Energy-Aware Routing in Software-Defined Network using Compression.
The Computer Journal,
61(10):1537 - 1556,
October 2018.
[WWW
] [PDF
]
Keywords:
Software defined networks,
Energy-aware Routing,
Forwarding tables,
Compression with wildcards,
Algorithms,
Green Networking.
[bibtex-entry]
-
Frédéric Havet,
A. Karolinna Maia,
and Bojan Mohar.
Finding a subdivision of a prescribed digraph of order 4.
Journal of Graph Theory,
87(4):536-560,
April 2018.
[WWW
] [PDF
] [bibtex-entry]
-
Nicolas Huin,
Brigitte Jaumard,
and Frédéric Giroire.
Optimal Network Service Chain Provisioning.
IEEE/ACM Transactions on Networking,
26(3):1320 - 1333,
June 2018.
[WWW
] [PDF
]
Keywords:
Service Function Chains,
Column Generation,
Soft-ware Defined Network,
Network Function Virtualization,
Optimiza-tion.
[bibtex-entry]
-
N. Huin,
M. Rifai,
Frédéric Giroire,
D. Lopez Pacheco,
Guillaume Urvoy-Keller,
and Joanna Moulierac.
Bringing Energy Aware Routing closer to Reality with SDN Hybrid Networks.
IEEE Transactions on Green Communications and Networking,
pp 1128 - 1139,
May 2018.
[WWW
] [PDF
] [bibtex-entry]
-
Nicolas Huin,
Andrea Tomassilli,
Frédéric Giroire,
and Brigitte Jaumard.
Energy-Efficient Service Function Chain Provisioning.
Journal of optical communications and networking,
10(3),
2018.
[WWW
] [PDF
] [bibtex-entry]
-
William Lochet.
Immersion of transitive tournaments in digraphs with large minimum outdegree.
Journal of Combinatorial Theory, Series B,
pp 4,
May 2018.
[WWW
] [PDF
]
Keywords:
Transitive tournaments,
Digraphs,
Immersions.
[bibtex-entry]
-
Julien Bensmail,
Dorian Mazauric,
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Sequential Metric Dimension.
In 16th Workshop on Approximation and Online Algorithms (WAOA 2018),
Helsinki, Finland,
August 2018.
[WWW
] [PDF
]
Keywords:
metric dimension,
Games in graphs,
complexity.
[bibtex-entry]
-
Julien Bensmail,
Dorian Mazauric,
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Localiser une cible dans un graphe.
In ALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
Roscoff, France,
May 2018.
[WWW
] [PDF
]
Keywords:
Mots-clefs : Graphes,
Dimension Métrique,
Dimension Centro¨idaleCentro¨idale,
Jeux dans les graphes.
[bibtex-entry]
-
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?.
In 9th International Conference on Fun with Algorithms (FUN 2018),
La Maddalena, Italy,
2018.
[WWW
] [PDF
]
Keywords:
graphs,
communities,
social networks,
integer partitions,
coloring games.
[bibtex-entry]
-
Jean-Claude Bermond,
Takako Kodate,
and Joseph Yu.
Gossiping with interference in radio chain networks.
In 21th Japan Conference on Discrete and Computational Geometry, Graphs, and Games,
Manila, Philippines,
September 2018.
[WWW
] [PDF
] [bibtex-entry]
-
Christelle Caillouet,
Frédéric Giroire,
and Tahiry Razafindralambo.
Déploiement efficace de drones pour la collecte de données de capteurs mobiles.
In Rencontres Francophones sur la Conception de Protocoles, lâÉvaluation de Performance et lâExpérimentation des Réseaux de Communication,
Roscoff, France,
May 2018.
[WWW
] [PDF
] [bibtex-entry]
-
Christelle Caillouet,
Frédéric Giroire,
and Tahiry Razafindralambo.
Optimization of mobile sensor coverage with UAVs.
In 11th International Workshop on Wireless Sensor, Robot and UAV Networks (WiSARN@IEEE INFOCOM 2018),
Honolulu, United States,
April 2018.
[WWW
] [PDF
] [bibtex-entry]
-
Christelle Caillouet,
Tahiry Razafindralambo,
and Dimitrios Zorbas.
Recharging wireless sensor networks using drones and wireless power transfer.
In 29th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE PIMRC 2018) Recent Results track,
Bologne, Italy,
September 2018.
[WWW
] [PDF
] [bibtex-entry]
-
Christelle Caillouet and Tahiry Razafindralambo.
Analyse bi-objectif pour la couverture de cibles par des drones.
In Rencontres Francophones sur la Conception de Protocoles, lâÉvaluation de Performance et lâExpérimentation des Réseaux de Communication,
Roscoff, France,
May 2018.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert,
Guillaume Ducoffe,
and Alexandru Popa.
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs.
In ACM-SIAM Symposium on Discrete Algorithms,
New Orleans, United States,
pages 20,
January 2018.
SIAM.
[WWW
] [PDF
] [bibtex-entry]
-
Huy Duong,
Brigitte Jaumard,
David Coudert,
and Ron Armolavicius.
Modèle d'optimisation pour la défragmentation de la capacité.
In ALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
Roscoff, France,
May 2018.
[WWW
] [PDF
]
Keywords:
Fragmentation des ressources,
réseau optique,
couche utilisateur,
reroutage transparent,
reroutage MBB.
[bibtex-entry]
-
Huy Duong,
Brigitte Jaumard,
David Coudert,
and Ron Armolavicius.
Efficient Make Before Break Capacity Defragmentation.
In IEEE International Conference on High Performance Switching and Routing,
Bucharest, Romania,
pages 6,
June 2018.
IEEE.
[WWW
] [PDF
]
Keywords:
Network reconfiguration,
rerouting,
defragmentation,
make-before-break.
[bibtex-entry]
-
Nicolas Huin,
Brigitte Jaumard,
and Frédéric Giroire.
Optimisation pour le Provisionnement de Chaînes de Services Réseau.
In ALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
Roscoff, France,
May 2018.
[WWW
] [PDF
]
Keywords:
SFC,
NFV,
column generation.
[bibtex-entry]
-
Brigitte Jaumard,
Hamed Pouya,
and David Coudert.
Make-Before-Break Wavelength Defragmentation.
In 20th International Conference on Transparent Optical Networks (ICTON),
Bucharest, Romania,
pages 5,
July 2018.
IEEE.
[WWW
] [PDF
]
Keywords:
Wavelength Defragmentation,
Seamless Defragmentation,
Make Before Break Rerouting,
Routing and Wavelength Assignment,
Fragmented Network,
Network Reconfiguration.
[bibtex-entry]
-
Andrea Tomassilli,
Frédéric Giroire,
Nicolas Huin,
and Stéphane Pérennes.
Provably Efficient Algorithms for Placement of Service Function Chains with Ordering Constraints.
In IEEE INFOCOM 2018 - IEEE Conference on Computer Communications,
Honolulu, United States,
April 2018.
IEEE.
[WWW
] [PDF
] [bibtex-entry]
-
Andrea Tomassilli,
Frédéric Giroire,
Nicolas Huin,
and Stéphane Pérennes.
Algorithmes d'approximation pour le placement de chaînes de fonctions de services avec des contraintes d'ordre.
In ALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
Roscoff, France,
May 2018.
[WWW
] [PDF
]
Keywords:
Virtualisation des fonctions réseaux,
chaînes de fonctions de service,
Réseaux logiciels,
Optimisation.
[bibtex-entry]
-
Andrea Tomassilli,
Nicolas Huin,
Frédéric Giroire,
and Brigitte Jaumard.
Resource Requirements for Reliable Service Function Chaining.
In 2018 IEEE International Conference on Communications (ICC 2018),
Kansas City, United States,
May 2018.
IEEE.
[WWW
] [PDF
] [bibtex-entry]
-
Andrea Tomassilli,
Brigitte Jaumard,
and Frédéric Giroire.
Path protection in optical flexible networks with distance-adaptive modulation formats.
In 2018 International Conference on Optical Network Design and Modeling (ONDM),
Dublin, France,
May 2018.
IEEE.
[WWW
] [PDF
] [bibtex-entry]
-
Julien Bensmail,
Dorian Mazauric,
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Sequential Metric Dimension.
Research Report,
Inria,
2018.
[WWW
] [PDF
]
Keywords:
complexity,
Metric dimension,
Games in graphs.
[bibtex-entry]
-
Julien Bensmail,
Fionn Mc Inerney,
and Nicolas Nisse.
Metric Dimension: from Graphs to Oriented Graphs.
Research Report,
Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France,
November 2018.
[WWW
] [PDF
]
Keywords:
Strongly-connected orientations,
Metric dimension,
Resolving sets.
[bibtex-entry]
-
Andrea Clementi,
Luciano Gualà,
Emanuele Natale,
Francesco Pasquale,
Giacomo Scornavacca,
and Luca Trevisan.
Consensus Needs Broadcast in Noiseless Models but can be Exponentially Easier in the Presence of Noise.
Research Report,
CNRS,
2018.
[WWW
] [PDF
] [bibtex-entry]
-
Adrien Gausseran,
Andrea Tomassilli,
Frédéric Giroire,
and Joanna Moulierac.
Don't Interrupt Me When You Reconfigure my Service Function Chains.
Research Report RR-9241,
UCA, Inria ; Université de Nice Sophia-Antipolis (UNS) ; CNRS ; UCA,I3S,
December 2018.
[WWW
] [PDF
]
Keywords:
Software Defined Networking,
Service Function Chains,
Network Function Virtualization,
Reconfiguration,
SDN (réseaux logiciels),
SFC (chaînes de service),
NFV (fonctions réseaux virtuelles).
[bibtex-entry]
-
Frédéric Havet and Nicolas Nisse.
Constrained ear decompositions in graphs and digraphs.
Research Report,
Inria - Sophia Antipolis,
2018.
[WWW
] [PDF
] [bibtex-entry]
-
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Eternal Domination in Grids.
Research Report,
Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France,
May 2018.
[WWW
] [PDF
]
Keywords:
Eternal Domination,
Combinatorial Games,
Graphs,
Grids.
[bibtex-entry]
-
Nicolas Nisse.
Network Decontamination.
Research Report,
Inria & Université Nice Sophia Antipolis, CNRS, I3S, Sophia Antipolis, France,
2018.
[WWW
] [PDF
]
Keywords:
Graph Searching,
Computational Complexity,
(Distributed) Graph Algorithms.
[bibtex-entry]
-
Andrea Tomassilli,
Frédéric Giroire,
Nicolas Huin,
and Stéphane Pérennes.
Provably Efficient Algorithms for Placement of Service Function Chains with Ordering Constraints.
Research Report RR-9141,
Université Côte d'Azur, CNRS, I3S, France ; Inria Sophia Antipolis,
January 2018.
[WWW
] [PDF
]
Keywords:
network function virtualization,
service function chaining,
placement,
approximation algorithms,
Réseaux logiciels,
Optimisation,
Virtualisation des fonctions réseaux,
Chaînes de fonctions de service.
[bibtex-entry]
-
Olivier Baudon,
Julien Bensmail,
Hervé Hocquard,
Mohammed Senhaji,
and Eric Sopena.
Edge Weights and Vertex Colours: Minimizing Sum Count.
Note: Working paper or preprint,
July 2018.
[WWW
] [PDF
] [bibtex-entry]
-
Julien Bensmail and Binlong Li.
More Aspects of Arbitrarily Partitionable Graphs.
Note: Working paper or preprint,
November 2018.
[WWW
] [PDF
]
Keywords:
arbitrarily partitionable graphs,
partition into connected subgraphs,
Hamiltonicity.
[bibtex-entry]
-
Julien Bensmail,
Soumen Nandi,
Mithun Roy,
and Sagnik Sen.
On homomorphisms of planar signed graphs and absolute cliques.
Note: Working paper or preprint,
November 2018.
[WWW
] [PDF
]
Keywords:
absolute signed cliques,
planar graphs,
graph homomorphisms,
signed graphs.
[bibtex-entry]
BACK TO COATI PUBLICATION INDEX
Last modified: Sat Jan 29 19:00:41 2022
