BACK TO COATI PUBLICATION INDEX
Publications of year 2017
-
Nicolas Huin.
Energy efficient software defined networks.
Theses,
Université Côte d'Azur,
September 2017.
[WWW
] [PDF
]
Keywords:
Energy aware routing,
Software defined networks,
Virtualization,
Économie d'énergie,
Routage vert,
Réseaux pilotés par logiciel,
Virtualisation.
[bibtex-entry]
-
Pierre Aboulker,
Nick Brettell,
Frédéric Havet,
Dániel Marx,
and Nicolas Trotignon.
Colouring graphs with constraints on connectivity.
Journal of Graph Theory,
85(4):814-838,
2017.
[WWW
] [PDF
]
Keywords:
colouring,
local connectivity,
local edge-connectivity,
Brooks' theorem,
minimally k-connected,
vertex degree.
[bibtex-entry]
-
Susanne Albers,
Evripidis Bampis,
Dimitrios Letsios,
Giorgio Lucarelli,
and Richard Stotz.
Scheduling on power-heterogeneous processors.
Information and Computation,
257:22-33,
December 2017.
[WWW
] [PDF
] [bibtex-entry]
-
Emma Barme,
Julien Bensmail,
Jakub Przybylo,
and Mariusz Wozniak.
On a directed variation of the 1-2-3 and 1-2 Conjectures.
Discrete Applied Mathematics,
217(2):123-131,
January 2017.
[WWW
] [PDF
] [bibtex-entry]
-
Olivier Baudon,
Julien Bensmail,
Florent Foucaud,
and Monika Pilsniak.
Structural properties of recursively partitionable graphs with connectivity 2.
Discussiones Mathematicae Graph Theory,
37:89-115,
February 2017.
[WWW
] [PDF
]
Keywords:
balloon graph,
graph with connectivity 2,
online arbitrarily partitionable graph,
recursively arbitrarily partitionable graph,
balloon,
structural properties.
[bibtex-entry]
-
Julien Bensmail,
Christopher Duffy,
and Sagnik Sen.
Analogues of Cliques for (m,n)-colored Mixed Graphs.
Graphs and Combinatorics,
33(4):735--750,
May 2017.
[WWW
] [PDF
]
Keywords:
graph homomorphisms,
planar graphs,
colored mixed graphs,
signed graphs,
graph homomorphism,
chromatic number,
clique number.
[bibtex-entry]
-
Julien Bensmail,
Ararat Harutyunyan,
Ngoc Khang Le,
Binlong Li,
and Nicolas Lichiardopol.
Disjoint cycles of different lengths in graphs and digraphs.
The Electronic Journal of Combinatorics,
24(4),
December 2017.
[WWW
] [PDF
]
Keywords:
minimum degree,
vertex-disjoint cycles,
different lengths.
[bibtex-entry]
-
Julien Bensmail,
Ararat Harutyunyan,
Tien-Nam Le,
Martin Merker,
and Stéphan Thomassé.
A Proof of the Barát--Thomassen Conjecture.
Journal of Combinatorial Theory, Series B,
124:39 - 55,
May 2017.
[WWW
] [PDF
]
Keywords:
large edge-connectivity,
Barát-Thomassen Conjecture,
tree-decomposition.
[bibtex-entry]
-
Julien Bensmail,
Martin Merker,
and Carsten Thomassen.
Decomposing graphs into a constant number of locally irregular subgraphs.
European Journal of Combinatorics,
60:124 - 134,
February 2017.
[WWW
] [PDF
] [bibtex-entry]
-
Julien Bensmail.
On q-power cycles in cubic graphs.
Discussiones Mathematicae Graph Theory,
37(1):211 - 220,
2017.
[WWW
] [PDF
] [bibtex-entry]
-
Julien Bensmail,
Soumen Nandi,
and Sagnik Sen.
On oriented cliques with respect to push operation.
Discrete Applied Mathematics,
232:50 - 63,
December 2017.
[WWW
] [PDF
]
Keywords:
oriented graphs,
oriented cliques,
push operation,
planar graphs.
[bibtex-entry]
-
Julien Bensmail,
Mohammed Senhaji,
and Kasper Szabo Lyngsie.
On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture.
Discrete Mathematics and Theoretical Computer Science,
19(1),
August 2017.
[WWW
] [PDF
]
Keywords:
equitable edge-weightings,
1-2-3 Conjecture,
Antimagic Labelling Conjecture.
[bibtex-entry]
-
Lélia Blin,
Janna Burman,
and Nicolas Nisse.
Exclusive Graph Searching.
Algorithmica,
77(3):942-969,
2017.
[WWW
] [PDF
] [bibtex-entry]
-
Nathann Cohen and David Coudert.
Le défi des 1001 graphes.
Interstices,
December 2017.
[WWW
]
Keywords:
théorie des graphes,
cycle hamiltonien,
algorithmes.
[bibtex-entry]
-
Nathann Cohen,
David Coudert,
Guillaume Ducoffe,
and Aurélien Lancin.
Applying clique-decomposition for computing Gromov hyperbolicity.
Theoretical Computer Science,
690:114-139,
2017.
[WWW
] [PDF
]
Keywords:
clique-decomposition,
graph algorithms,
outerplanar graphs,
Gromov hyperbolicity.
[bibtex-entry]
-
Nathann Cohen,
Frédéric Havet,
William Lochet,
and Raul Lopes.
Bispindle in strongly connected digraphs with large chromatic number.
Electronic Notes in Discrete Mathematics,
62:69 - 74,
November 2017.
[WWW
] [PDF
]
Keywords:
subdivision,
Digraph,
chromatic number.
[bibtex-entry]
-
Gianlorenzo D 'angelo,
Alfredo Navarra,
and Nicolas Nisse.
A unified approach for Gathering and Exclusive Searching on rings under weak assumptions.
Distributed Computing,
30(1):17-48,
2017.
[WWW
] [PDF
] [bibtex-entry]
-
Rennan Dantas,
Frédéric Havet,
and Rudini M Sampaio.
Identifying codes for infinite triangular grids with a finite number of rows.
Discrete Mathematics,
340:1584 - 1597,
2017.
[WWW
] [PDF
] [bibtex-entry]
-
Rennan Dantas,
Rudini Sampaio,
and Frédéric Havet.
Minimum density of identifying codes of king grids.
Electronic Notes in Discrete Mathematics,
62:51 - 56,
November 2017.
[WWW
] [PDF
]
Keywords:
Identifying code,
King grid,
Discharging Method.
[bibtex-entry]
-
Frédéric Giroire and Juan-Carlos Maureira.
Analysis of the Failure Tolerance of Linear Access Networks.
IEEE Transactions on Intelligent Transportation Systems,
pp 1 - 10,
August 2017.
[WWW
] [PDF
]
Keywords:
maintenance cost,
Access networks,
failure tolerance,
telecommuting,
connectivity analysis.
[bibtex-entry]
-
Frédéric Giroire,
Remigiusz Modrzejewski,
Nicolas Nisse,
and Stéphane Pérennes.
Maintaining Balanced Trees for Structured Distributed Streaming Systems.
Discrete Applied Mathematics,
232:176 - 188,
December 2017.
[WWW
] [PDF
]
Keywords:
Peer-to-peer,
Distributed Live Streaming System,
Graph Algorithm,
Balanced Trees.
[bibtex-entry]
-
Frédéric Giroire,
Stéphane Pérennes,
and Issam Tahiri.
Grid spanners with low forwarding index for energy efficient networks.
Discrete Applied Mathematics,
March 2017.
[WWW
] [PDF
]
Keywords:
grid,
routing,
energy saving,
spanning subgraphs,
forwarding index.
[bibtex-entry]
-
Brigitte Jaumard,
Mejdi Kaddour,
Alvinice Kodjo,
Napoleão Nepomuceno,
and David Coudert.
Cost-effective Bandwidth Provisioning in Microwave Wireless Networks under Unreliable Channel Conditions.
Pesquisa Operacional,
37(3):525 - 544,
September 2017.
[WWW
] [PDF
]
Keywords:
column generation,
microwave networks,
mixed-integer linear programming.
[bibtex-entry]
-
Bi Li,
Fatima Zahra Moataz,
Nicolas Nisse,
and Karol Suchan.
Minimum Size Tree-Decompositions.
Discrete Applied Mathematics,
February 2017.
[WWW
] [PDF
] [bibtex-entry]
-
Euripides Markou,
Nicolas Nisse,
and Stéphane Pérennes.
Exclusive graph searching vs. pathwidth.
Information and Computation,
252:243 - 260,
2017.
[WWW
] [PDF
]
Keywords:
graph searching,
pathwidth.
[bibtex-entry]
-
Bruce Reed,
X. Cai,
G. Perarnau,
and A. B. Watts.
Acyclic edge colourings of graphs with large girth.
Random Structures & Algorithms,
50(4):511 - 533,
July 2017.
[WWW
] [bibtex-entry]
-
Bruce Reed,
Felix Joos,
Guillem Perarnau,
and Dieter Rautenbach.
How to determine if a random graph with a fixed degree sequence has a giant component.
Probability Theory and Related Fields,
January 2017.
[WWW
] [bibtex-entry]
-
Bruce Reed and G. Perarnau.
Existence of Spanning â±-Free Subgraphs with Large Minimum Degree.
Combinatorics, Probability and Computing,
26(03):448 - 467,
May 2017.
[WWW
] [bibtex-entry]
-
Bruce Reed,
Jonas Witt,
and Marco E. Lübbecke.
Polyhedral results on the stable set problem in graphs containing even or odd pairs.
Mathematical Programming,
June 2017.
[WWW
] [bibtex-entry]
-
Myriana Rifai,
Nicolas Huin,
Christelle Caillouet,
Frédéric Giroire,
Joanna Moulierac,
Dino Lopez Pacheco,
and Guillaume Urvoy-Keller.
Minnie : An SDN world with few compressed forwarding rules.
Computer Networks,
121:185 - 207,
July 2017.
[WWW
] [PDF
]
Keywords:
Software Defined Networks,
data center networks,
routing tables,
compression,
TCAM.
[bibtex-entry]
-
Sahel Sahhaf,
Wouter Tavernier,
Dimitri Papadimitriou,
Davide Careglio,
Alok Kumar,
Christian Glacet,
David Coudert,
Nicolas Nisse,
Lluis Fàbrega,
Pere Vilà,
Miguel Camelo,
Pieter Audenaert,
Didier Colle,
and Piet Demeester.
Routing at Large Scale: Advances and Challenges for Complex Networks.
IEEE Network,
pp 12 - 22,
2017.
[WWW
] [PDF
]
Keywords:
Complex networks,
Geometric routing,
Compact routing,
Algebraic routing,
Path-vector routing.
[bibtex-entry]
-
Julien Bensmail,
Valentin Garnero,
Nicolas Nisse,
Alexandre Salch,
and Valentin Weber.
Recovery of disrupted airline operations using k-Maximum Matching in graphs.
In IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS),
volume 62 of Electronic Notes in Discrete Mathematics (IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS)),
Marseille, France,
pages 3-8,
September 2017.
[WWW
] [PDF
]
Keywords:
Graph,
Matching,
Augmenting paths,
Complexity,
Trees.
[bibtex-entry]
-
Pierre Bergé,
Jason Crampton,
Gregory Gutin,
and Rémi Watrigant.
The Authorization Policy Existence Problem.
In CODASPY: Conference on Data and Application Security and Privacy,
Scottsdale, United States,
pages 163-165,
March 2017.
ACM Press.
[WWW
] [bibtex-entry]
-
Jean-Claude Bermond,
Takako Kodate,
and Joseph Yu.
Gossiping with interference in radio ring networks.
In 20th Anniversary of Japan Conference on Discrete and Computational Geometry, Graphs, and Games,
TOKYO, Japan,
August 2017.
[WWW
] [PDF
]
Keywords:
gossiping,
radio networks,
ring,
interference.
[bibtex-entry]
-
Christelle Caillouet and Tahiry Razafindralambo.
Efficient Deployment of Connected Unmanned Aerial Vehicles for Optimal Target Coverage.
In IEEE, editor,
GIIS 2017 - Global Information Infrastructure and Networking Symposium,
Saint-Pierre, France,
October 2017.
[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.
In IWOCA: International Workshop on Combinatorial Algorithms,
Newcastle, Australia,
pages 12,
July 2017.
[WWW
] [PDF
]
Keywords:
Fixed-parameter tractability,
Hypergraph,
Minimum F-Overlay Problem,
NP-completeness.
[bibtex-entry]
-
Nathann Cohen,
Nìcolas A Martins,
Fionn Mc Inerney,
Nicolas Nisse,
Stéphane Pérennes,
and Rudini Sampaio.
Enquêter dans les graphes.
In ALGOTEL 2017 - 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
Quiberon, France,
May 2017.
[WWW
] [PDF
]
Keywords:
Jeu de Gendarmes et Voleur,
Programmation Linéaire,
Mots-clefs : Jeux combinatoires à deux joueurs dans les graphes.
[bibtex-entry]
-
Nathann Cohen,
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Study of a combinatorial game in graphs through Linear Programming.
In 28th International Symposium on Algorithms and Computation (ISAAC 2017),
Phuket, Thailand,
2017.
[WWW
] [PDF
]
Keywords:
Turn-by-turn games in graphs,
Graph algorithms,
Linear Programming.
[bibtex-entry]
-
David Coudert and Guillaume Ducoffe.
A simple approach for lower-bounding the distortion in any Hyperbolic embedding.
In EUROCOMB'17 -- The European Conference on Combinatorics, Graph Theory and Applications,
volume 61,
Vienna, Austria,
pages 293 - 299,
August 2017.
Elsevier.
[WWW
] [PDF
]
Keywords:
Gromov hyperbolicity,
Hyperbolic space,
Cop and Robber games.
[bibtex-entry]
-
David Coudert,
James Luedtke,
Eduardo Moreno,
and Konstantinos Priftis.
Computing and maximizing the exact reliability of wireless backhaul networks.
In International Network Optimization Conference,
volume 64 of Electronic Notes in Discrete Mathematics,
Lisbon, Portugal,
pages 85-94,
February 2017.
Elsevier.
[WWW
] [PDF
]
Keywords:
Network design,
Backhaul network,
Reliability,
Optimization.
[bibtex-entry]
-
Guillaume Ducoffe.
Finding cut-vertices in the square roots of a graph.
In 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2017),
volume 10520 of Graph-Theoretic Concepts in Computer Science,
Eindhoven, Netherlands,
pages 234--248,
June 2017.
[WWW
] [PDF
] [bibtex-entry]
-
Guillaume Ducoffe,
Ruxandra Marinescu-Ghemeci,
and ALEXANDRU POPA.
On the (di)graphs with (directed) proper connection number two.
In IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS),
volume 62,
Marseille, France,
pages 237 - 242,
September 2017.
[WWW
] [PDF
]
Keywords:
NP-complete,
proper connection,
digraphs,
bipartite,
even dicycles.
[bibtex-entry]
-
Nicolas Huin,
Brigitte Jaumard,
and Frédéric Giroire.
Optimization of Network Service Chain Provisioning.
In IEEE International Conference on Communications 2017,
Paris, France,
May 2017.
[WWW
] [PDF
]
Keywords:
service function chaining,
SFC,
column generation.
[bibtex-entry]
-
Nicolas Huin,
Myriana Rifai,
Frédéric Giroire,
Dino Lopez Pacheco,
Guillaume Urvoy-Keller,
and Joanna Moulierac.
Bringing Energy Aware Routing closer to Reality with SDN Hybrid Networks.
In GLOBECOM 2017 - IEEE Global Communications Conference,
Singapore, Singapore,
pages 7,
December 2017.
[WWW
] [PDF
] [bibtex-entry]
-
Nicolas Huin,
Andrea Tomassilli,
Frédéric Giroire,
and Brigitte Jaumard.
Energy-Efficient Service Function Chain Provisioning.
In International Network Optimization Conference 2017,
Lisbonne, Portugal,
February 2017.
[WWW
] [PDF
]
Keywords:
Network Function Virtualization,
Service Function Chains,
Software Defined Networks,
Energy Efficiency,
Optimization,
Column Generation.
[bibtex-entry]
-
Julien Bensmail,
Valentin Garnero,
and Nicolas Nisse.
On improving matchings in trees, via bounded-length augmentations.
Research Report,
Université Côte d'Azur,
July 2017.
[WWW
] [PDF
]
Keywords:
trees,
bounded-length augmentations,
maximum matchings.
[bibtex-entry]
-
Bartlomiej Bosek,
Przemyslaw Gordinowicz,
Jaroslaw Grytczuk,
Nicolas Nisse,
Joanna Sokol,
and Malgorzata Sleszynska-Nowak.
Localization Game on Geometric and Planar Graphs.
Research Report,
Inria,
2017.
[WWW
] [PDF
] [bibtex-entry]
-
Nathann Cohen,
Nìcolas A Martins,
Fionn Mc Inerney,
Nicolas Nisse,
Stéphane Pérennes,
and Rudini Sampaio.
Spy-Game on graphs: complexity and simple topologies.
Research Report,
Inria Sophia Antipolis,
2017.
[WWW
] [PDF
]
Keywords:
PSPACE-hard,
Cops and Robber games,
graphs.
[bibtex-entry]
-
Nathann Cohen,
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Study of a combinatorial game in graphs through Linear Programming.
Research Report,
Inria Sophia Antipolis,
2017.
[WWW
] [PDF
]
Keywords:
Linear Programming,
Cops and Robber games,
Graphs.
[bibtex-entry]
-
David Coudert,
Guillaume Ducoffe,
and Alexandru Popa.
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs.
Research Report,
Inria - Sophia antipolis ; Universite Cote d'Azur ; University of Bucharest, Faculty of Mathematics and Computer Science ; National Institute for Research and Development in Informatics, Romania,
July 2017.
[WWW
] [PDF
]
Keywords:
Fully polynomial FPT,
Graph algorithms,
Hardness in P,
Split decomposition,
Neighbourhood diversity,
Primeval decomposition,
Clique-width,
Modular decomposition.
[bibtex-entry]
-
Guillaume Ducoffe.
Finding cut-vertices in the square roots of a graph.
Research Report,
Université Côte dâAzur, Inria, CNRS, I3S, France,
February 2017.
[WWW
] [PDF
]
Keywords:
square root,
biconnected components,
clique cutset,
cactus-block graph,
Gallai tree,
cycle-power graph,
circular-arc graph.
[bibtex-entry]
-
Guillaume Ducoffe,
Ruxandra Marinescu-Ghemeci,
and Alexandru Popa.
On the (di)graphs with (directed) proper connection number two.
Research Report,
Université Côte dâAzur, Inria, CNRS, I3S, France ; University of Bucharest, Faculty of Mathematics and Computer Science ; National Institute for Research and Development in Informatics, Romania ; The Research Institute of the University of Bucharest ICUB, Romania,
March 2017.
[WWW
] [PDF
] [bibtex-entry]
-
Frédéric Giroire,
Nicolas Huin,
and Andrea Tomassilli.
The Structured Way of Dealing with Heterogeneous Live Streaming Systems.
Research Report RR-9070,
Inria Sophia Antipolis ; Cnrs ; Universite Cote d'Azur,
June 2017.
[WWW
] [PDF
]
Keywords:
distributed algorithms,
reliability,
diffusion tree,
protocols,
churn,
peer-to-peer,
video streaming,
pair-à-pair,
diffusion video en direct,
protocoles,
fiabilité,
arbre de diffusion,
algorithmes distribués.
[bibtex-entry]
-
Nicolas Huin,
Myriana Rifai,
Frédéric Giroire,
Dino Lopez Pacheco,
Guillaume Urvoy-Keller,
and Joanna Moulierac.
Bringing Energy Aware Routing closer to Reality with SDN Hybrid Networks.
Research Report RR-9020,
INRIA Sophia Antipolis - I3S ; I3S,
January 2017.
[WWW
] [PDF
]
Keywords:
Software Defined Network,
energy saving,
energy aware routing,
hybrid network,
packet loss.
[bibtex-entry]
-
Kolja Knauer and Nicolas Nisse.
Computing metric hulls in graphs.
Research Report,
Inria - Sophia Antipolis,
2017.
[WWW
] [PDF
] [bibtex-entry]
-
Nicolas Nisse.
Posters de médiation scientifique IV : Jeux dans les Graphes,
2017.
Note: Posters de médiation scientifiques.
[WWW
] [PDF
] [bibtex-entry]
-
Nicolas Nisse.
Posters de médiation scientifique III : Réseaux de Tri,
2017.
Note: Posters de médiation scientifique.
[WWW
] [PDF
] [bibtex-entry]
-
Nicolas Nisse.
Posters de médiation scientifique I : Deux Jeux Combinatoires,
2017.
Note: Poster de médiation scientifique.
[WWW
] [PDF
] [bibtex-entry]
-
Nicolas Nisse.
Posters de médiation scientifique II : Tour de Magie et Binaire,
2017.
Note: Posters de médiation scientifiques.
[WWW
] [PDF
] [bibtex-entry]
-
Nicolas Bousquet,
William Lochet,
and Stéphan Thomassé.
A proof of the Erdos-Sands-Sauer-Woodrow conjecture.
Note: Working paper or preprint,
2017.
[WWW
]
Keywords:
Erdos-Sands-Sauer-Woodrow conjecture,
tournament,
dominating set.
[bibtex-entry]
BACK TO COATI PUBLICATION INDEX
Last modified: Sat Jan 29 19:00:41 2022
