BACK TO COATI PUBLICATION INDEX
Publications of year 2021
-
David Coudert and Emanuele Natale, editors.
19th International Symposium on Experimental Algorithms (SEA 2021),
volume 190,
Nice, France,
June 2021.
David Coudert and Emanuele Natale,
Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
[WWW
] [bibtex-entry]
-
Giuseppe Di Lena.
Distributed and trustable SDN-NFV-enabled network emulation on testbeds and cloud infrastructures.
Theses,
Université Côte d'Azur,
March 2021.
[WWW
] [PDF
]
Keywords:
Emulation,
SDN,
NFV,
Mininet,
Virtualization,
Emulation,
SDN,
NFV,
Mininet,
Virtualisation.
[bibtex-entry]
-
Adrien Gausseran.
Optimization algorithms for network slicing for 5G.
Theses,
Université Côte d'Azur,
November 2021.
[WWW
] [PDF
]
Keywords:
SDN,
NFV,
SFC,
5G,
Slicing,
Reconfiguration,
SDN,
NFV,
SFC,
5G,
Slicing,
Reconfiguration.
[bibtex-entry]
-
Viet-Ha Nguyen.
Graph problems motivated by (low and high) resolution models of large protein assemblies.
Theses,
I3S, Université Côte d'Azur ; ABS, Inria Sophia Antipolis ; COATI, Inria Sophia Antipolis,
December 2021.
[WWW
] [PDF
]
Keywords:
esolution of protein assembly,
structural biology,
complexity,
algorithm,
graph,
hypergraph,
coloring.,
complexité,
algorithme,
résolution dâassemblage de protéines,
biologie structurale,
graphe,
hypergraphe,
coloration..
[bibtex-entry]
-
Thibaud Trolliet.
Study of the properties and modeling of complex social graphs.
Theses,
Université Côte d'Azur,
June 2021.
[WWW
] [PDF
]
Keywords:
Complex networks,
Social networks,
Twitter,
Modelling,
Directed graphs,
Hypergraphs,
Systèmes complexes,
Réseaux sociaux,
Twitter,
Modélisation,
Graphes dirigés,
Hypergraphes.
[bibtex-entry]
-
Pierre Aboulker,
Frédéric Havet,
Kolja Knauer,
and Clément Rambaud.
On the dichromatic number of surfaces.
In Extended Abstracts EuroComb 2021,
volume 14 of Trends in Mathematics,
pages 181-187.
Springer International Publishing,
August 2021.
[WWW
] [PDF
]
Keywords:
dichromatic number,
planar graphs,
graphs on surfaces.
[bibtex-entry]
-
Alan Arroyo,
Julien Bensmail,
and Bruce R. Richter.
Extending Drawings of Graphs to Arrangements of Pseudolines.
Journal of Computational Geometry,
12(2):3-24,
2021.
[WWW
] [PDF
]
Keywords:
graphs,
graph drawings,
geometric graph drawings,
arrangements of pseudolines,
crossing numbers,
stretchability.
[bibtex-entry]
-
Julien Bensmail,
Sandip Das,
Soumen Nandi,
Soumyajit Paul,
Théo Pierron,
Sagnik Sen,
and Eric Sopena.
Pushable chromatic number of graphs with degree constraints.
Discrete Mathematics,
344(1):112151,
2021.
[WWW
] [PDF
]
Keywords:
graph homomorphism,
maximum degree,
subcubicgraph,
oriented coloring,
push operation.
[bibtex-entry]
-
Julien Bensmail,
Foivos Fioravantes,
Fionn Mc Inerney,
and Nicolas Nisse.
Further Results on an Equitable 1-2-3 Conjecture.
Discrete Applied Mathematics,
297:1-20,
2021.
[WWW
] [PDF
]
Keywords:
Proper labellings,
Equitable labellings,
1-2-3 Conjecture.
[bibtex-entry]
-
Julien Bensmail,
Foivos Fioravantes,
and Fionn Mc Inerney.
On the Role of 3s for the 1-2-3 Conjecture.
Theoretical Computer Science,
892:238-257,
2021.
[WWW
] [PDF
]
Keywords:
Proper labellings,
3-chromatic graphs,
1-2-3 Conjecture.
[bibtex-entry]
-
Julien Bensmail,
Foivos Fioravantes,
and Nicolas Nisse.
On Proper Labellings of Graphs with Minimum Label Sum.
Algorithmica,
2021.
[WWW
] [PDF
] [bibtex-entry]
-
Julien Bensmail and Foivos Fioravantes.
On BMRN*-colouring of planar digraphs.
Discrete Mathematics and Theoretical Computer Science,
23(1):#4,
February 2021.
[WWW
] [PDF
]
Keywords:
BMRN*-colouring,
planar digraphs,
TDMA scheduling.
[bibtex-entry]
-
Julien Bensmail,
Bi Li,
and Binlong Li.
An injective version of the 1-2-3 Conjecture.
Graphs and Combinatorics,
37:281-311,
2021.
[WWW
] [PDF
] [bibtex-entry]
-
Julien Bensmail,
Bi Li,
Binlong Li,
and Nicolas Nisse.
On Minimizing the Maximum Color for the 1-2-3 Conjecture.
Discrete Applied Mathematics,
289:32-51,
2021.
[WWW
] [PDF
]
Keywords:
proper vertex-colorings,
edge labelings,
1-2-3 Conjecture,
small vertex colors.
[bibtex-entry]
-
Julien Bensmail.
On a graph labelling conjecture involving coloured labels.
Discussiones Mathematicae Graph Theory,
2021.
[WWW
] [PDF
]
Keywords:
Proper labellings,
Coloured labels,
Weak (2,
2)-Conjecture,
1-2-3 Conjecture.
[bibtex-entry]
-
Julien Bensmail and Fionn Mc Inerney.
On Generalisations of the AVD Conjecture to Digraphs.
Graphs and Combinatorics,
37:545-558,
2021.
[WWW
] [PDF
]
Keywords:
Digraphs,
AVD Conjecture,
Proper edge-colourings,
proper edge-colourings,
digraphs.
[bibtex-entry]
-
Jean-Claude Bermond,
Frédéric Giroire,
and Nicolas Nisse.
Graphes et Télécommunications.
Bibliothèque Tangente,
(Hors Serie 75):120-125,
2021.
[WWW
] [PDF
] [bibtex-entry]
-
Andrea Clementi,
Emanuele Natale,
and Isabella Ziccardi.
Parallel Load Balancing on constrained client-server topologies.
Theoretical Computer Science,
895:16-33,
December 2021.
[WWW
] [bibtex-entry]
-
Emilio Cruciani,
Emanuele Natale,
André Nusser,
and Giacomo Scornavacca.
Phase transition of the 2-Choices dynamics on core--periphery networks.
Distributed Computing,
34(3):207-225,
June 2021.
[WWW
] [bibtex-entry]
-
Ali Dehghan and Frédéric Havet.
On the semi-proper orientations of graphs.
Discrete Applied Mathematics,
296:9-25,
June 2021.
[WWW
] [PDF
] [bibtex-entry]
-
Giuseppe Di Lena,
Andrea Tomassilli,
Damien Saucez,
Frédéric Giroire,
Thierry Turletti,
and Chidung Lac.
Distrinet: a Mininet Implementation for the Cloud.
Computer Communication Review,
51(1):2-9,
January 2021.
[WWW
] [PDF
] [bibtex-entry]
-
Nemanja Draganic,
François Dross,
Jacob Fox,
António Girão,
Frédéric Havet,
Dániel Korándi,
William Lochet,
David Munhá Correia,
Alex Scott,
and Benny Sudakov.
Powers of paths in tournaments.
Combinatorics, Probability and Computing,
pp 1-5,
2021.
[WWW
] [PDF
] [bibtex-entry]
-
François Dross and Frédéric Havet.
On the unavoidability of oriented trees.
Journal of Combinatorial Theory, Series B,
151:83-110,
November 2021.
[WWW
] [PDF
]
Keywords:
Tournament,
Oriented tree,
Unavoidable.
[bibtex-entry]
-
Huy Duong,
Brigitte Jaumard,
David Coudert,
and Romualdas Armolavicius.
Efficient Make-Before-Break Layer 2 Reoptimization.
IEEE/ACM Transactions on Networking,
29(5):1910-1921,
October 2021.
[WWW
] [PDF
]
Keywords:
Network reconfiguration,
rerouting,
reoptimization,
make-before-break.
[bibtex-entry]
-
Matteo Frigo,
Emilio Cruciani,
David Coudert,
Rachid Deriche,
Samuel Deslauriers-Gauthier,
and Emanuele Natale.
Network alignment and similarity reveal atlas-based topological differences in structural connectomes.
Network Neuroscience,
May 2021.
[WWW
] [PDF
]
Keywords:
Weisfeiler-Lehman,
graph Jaccard index,
graph alignment,
structural connectome,
brain network topology,
neuroscience,
OPAL-Meso,
brain parcellation,
brain network,
graph matching,
Network alignment.
[bibtex-entry]
-
Adrien Gausseran,
Frederic Giroire,
Brigitte Jaumard,
and Joanna Moulierac.
Be Scalable and Rescue My Slices During Reconfiguration.
The Computer Journal,
64(10):1584-1599,
October 2021.
[WWW
] [PDF
] [bibtex-entry]
-
Adrien Gausseran,
Andrea Tomassilli,
Frederic Giroire,
and Joanna Moulierac.
Don't Interrupt Me When You Reconfigure my Service Function Chains.
Computer Communications,
171:39-53,
April 2021.
[WWW
] [PDF
]
Keywords:
Software Defined Networks,
Network Function Virtualization,
Service Function Chaining,
Network reconfiguration,
optimization.
[bibtex-entry]
-
Brigitte Jaumard,
Yan Wang,
and David Coudert.
Dantzig--Wolfe decomposition for the design of filterless optical networks.
Journal of Optical Communications and Networking,
13(12):10,
2021.
[WWW
] [PDF
] [bibtex-entry]
-
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between.
Algorithmica,
83(5):1459-1492,
2021.
[WWW
] [PDF
]
Keywords:
King's graph,
Strong grid,
Cartesian grid,
Grids,
Graphs,
Eternal Domination,
Combinatorial Games.
[bibtex-entry]
-
Malgorzata Sulkowska,
Bernhard Gittenberger,
Zbigniew GolÄbiewski,
and Isabella Larcher.
Protection numbers in simply generated trees and Pólya trees.
Applicable Analysis and Discrete Mathematics,
(00):10-10,
2021.
[WWW
] [PDF
] [bibtex-entry]
-
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.
Design of Robust Programmable Networks with Bandwidth-optimal Failure Recovery Scheme.
Computer Networks,
192(108043),
June 2021.
[WWW
] [PDF
] [bibtex-entry]
-
Thibaud Trolliet,
Nathann Cohen,
Frédéric Giroire,
Luc Hogie,
and Stéphane Pérennes.
Interest clustering coefficient: a new metric for directed networks like Twitter.
Journal of Complex Networks,
2021.
[WWW
] [PDF
]
Keywords:
complex networks,
clustering coefficient,
directed networks,
social networks,
Twitter,
link recommendation.
[bibtex-entry]
-
Dimitrios Zorbas,
Christelle Caillouet,
Khaled Abdelfadeel Hassan,
and Dirk Pesch.
Fast Data Collection in LoRa Networks: a Time-Slotted Approach.
Sensors,
21(4):1193,
February 2021.
[WWW
] [PDF
] [bibtex-entry]
-
Ali Al Zoobi,
David Coudert,
and Nicolas Nisse.
De la difficulté de trouver des chemins dissimilaires.
In ALGOTEL 2021 - 23èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
La Rochelle, France,
September 2021.
[WWW
] [PDF
]
Keywords:
Similarité entre chemins,
$k$ plus courts chemins simples.
[bibtex-entry]
-
Julien Bensmail,
Foivos Fioravantes,
Fionn Mc Inerney,
and Nicolas Nisse.
The Largest Connected Subgraph Game.
In WG 2021 - The 47th International Workshop on Graph-Theoretic Concepts in Computer Science,
volume 12911 of Lecture Notes in Computer Science,
Warsaw, Poland,
pages 296-307,
June 2021.
Springer.
[WWW
] [PDF
]
Keywords:
Games on graphs,
Scoring games,
Connection games,
PSPACE-complete.
[bibtex-entry]
-
Julien Bensmail,
Foivos Fioravantes,
and Fionn Mc Inerney.
On the Role of 3's for the 1-2-3 Conjecture.
In CIAC 2021 - 12th International Conference on Algorithms and Complexity,
volume 12701 of Lecture Notes in Computer Science,
Larnaca, Cyprus,
pages 103-115,
May 2021.
Springer.
[WWW
] [PDF
]
Keywords:
3-chromatic graphs,
Proper labellings,
1-2-3 Conjecture.
[bibtex-entry]
-
Julien Bensmail,
Foivos Fioravantes,
Fionn Mc Inerney,
and Nicolas Nisse.
Connexions ! Le jeu du plus grand sous-graphe connexe.
In ALGOTEL 2021 - 23èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
La Rochelle, France,
September 2021.
[WWW
] [PDF
]
Keywords:
Games on graphs,
Scoring games,
Connection games,
PSPACE-complete,
Jeux à deux joueurs dans les graphes,
Jeux de connexion,
Jeux à score.
[bibtex-entry]
-
Christelle Caillouet,
Martin Heusse,
and Franck Rousseau.
Optimiser l'équité dans les réseaux LoRaWAN.
In CORES 2021 - 6ème Rencontres Francophones sur la Conception de Protocoles, lâÉvaluation de Performance et lâExpérimentation des Réseaux de Communication,
CORES 2021 - 6ème Rencontres Francophones sur la Conception de Protocoles, lâÉvaluation de Performance et lâExpérimentation des Réseaux de Communication,
La Rochelle, France,
May 2021.
[WWW
] [PDF
]
Keywords:
LoRaWAN,
optimization,
fairness.
[bibtex-entry]
-
Andrea Clementi,
Francesco d'Amore,
George Giakkoupis,
and Emanuele Natale.
Search via Parallel Lévy Walks on ${\mathbb Z}^2$.
In PODC 2021 - ACM Symposium on Principles of Distributed Computing,
Salerno, Italy,
pages 81--91,
July 2021.
[WWW
] [PDF
] [bibtex-entry]
-
Emilio Cruciani,
Hlafo Alfie Mimun,
Matteo Quattropani,
and Sara Rizzo.
Phase Transitions of the $k$-Majority Dynamics in a Biased Communication Model.
In ICDCN 2021 - 22nd International Conference on Distributed Computing and Networking,
Nara / Virtual, Japan,
pages 146-155,
January 2021.
ACM.
[WWW
] [PDF
] [bibtex-entry]
-
Giuseppe Di Lena,
Andrea Tomassilli,
Frédéric Giroire,
Damien Saucez,
Thierry Turletti,
and Chidung Lac.
A Right Placement Makes a Happy Emulator: a Placement Module for Distributed SDN/NFV Emulation.
In ICC 2021 - IEEE International Conference on Communications,
Montréal, Canada,
June 2021.
IEEE.
[WWW
] [PDF
] [bibtex-entry]
-
Igor Dias Da Silva,
Christelle Caillouet,
and David Coudert.
Optimizing FANET deployment for mobile sensor tracking in disaster management scenario.
In 7th International Conference on Information and Communication Technologies for Disaster Management (ICT-DM),
Hangzhou, China,
pages 134-141,
December 2021.
IEEE.
[WWW
] [PDF
]
Keywords:
UAVs,
disaster management,
linear programming,
column generation.
[bibtex-entry]
-
Thomas Dissaux,
Guillaume Ducoffe,
Nicolas Nisse,
and Simon Nivelle.
Longueur Arborescente des Graphes Série-Parallèles.
In ALGOTEL 2021 - 23èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
La Rochelle, France,
September 2021.
[WWW
] [PDF
]
Keywords:
décomposition arborescente,
longueur arborescente,
graphes série-parallèles,
sous-graphes isométriques.
[bibtex-entry]
-
Thomas Dissaux,
Guillaume Ducoffe,
Nicolas Nisse,
and Simon Nivelle.
Treelength of Series-parallel graphs.
In LAGOS 2021 - XI Latin and American Algorithms, Graphs and Optimization Symposium,
São Paulo / Virtual, Brazil,
May 2021.
[WWW
] [PDF
] [bibtex-entry]
-
Huy Duong,
Brigitte Jaumard,
and David Coudert.
Minimum Disturbance Rerouting to Optimize Bandwidth Usage.
In ONDM 2021 - International Conference on Optical Network Design and Modeling,
Gothenburg, Sweden,
pages 1-6,
June 2021.
IEEE.
[WWW
] [PDF
]
Keywords:
Network reconfiguration,
rerouting,
reoptimization,
make-before-break.
[bibtex-entry]
-
Hicham Lesfari,
Frédéric Giroire,
Giuseppe Di Lena,
and Chidung Lac.
A multidimensional colored packing approach for network slicing with dedicated protection.
In IEEE Global Communications Conference (GLOBECOM),
Madrid, Spain,
December 2021.
[WWW
] [PDF
] [bibtex-entry]
-
Hicham Lesfari and Frédéric Giroire.
Une rencontre entre les noyaux de graphes et la detection dâanomalies dans les reseaux.
In ALGOTEL 2021 - 23èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
La Rochelle, France,
September 2021.
[WWW
] [PDF
]
Keywords:
Noyaux de graphe,
Détection d'anomalies,
Apprentissage automatique,
Réseaux informatiques.
[bibtex-entry]
-
Zhejiayu Ma,
Soufiane Roubia,
Frédéric Giroire,
and Guillaume Urvoy-Keller.
When Locality is not enough: Boosting Peer Selection of Hybrid CDN-P2P Live Streaming Systems using Machine Learning.
In Network Traffic Measurement and Analysis Conference (IFIP TMA 2021),
Virtual, France,
September 2021.
IFIP.
[WWW
] [PDF
]
Keywords:
hybrid P2P,
live streaming,
peer selection,
machine learning.
[bibtex-entry]
-
Thibaud Trolliet,
Frédéric Giroire,
and Stéphane Pérennes.
Un modèle de graphes aléatoires croissants pour n'importe quelle distribution des degrés.
In ALGOTEL 2021 - 23èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
La Rochelle, France,
September 2021.
[WWW
] [PDF
]
Keywords:
Systèmes Complexes,
Modélisation,
Attachement Préférentiel,
Distribution des degrés,
Twitter.
[bibtex-entry]
-
Chuan Xu and Giovanni Neglia.
What else is leaked when eavesdropping Federated Learning?.
In CCS workshop Privacy Preserving Machine Learning (PPML),
Soeul, South Korea,
November 2021.
Note: Virtual, Contributed talk.
[WWW
] [PDF
] [bibtex-entry]
-
Oualid Zari,
Chuan Xu,
and Giovanni Neglia.
Efficient passive membership inference attack in federated learning.
In Privacy in Machine Learning - NeurIPS PriML workshop,
Virtual, France,
December 2021.
[WWW
] [PDF
] [bibtex-entry]
-
Pierre Aboulker,
Frédéric Havet,
Kolja Knauer,
and Clément Rambaud.
On the dichromatic number of surfaces.
Research Report,
Inria ; CNRS ; I3S ; Université Côte D'Azur,
2021.
Note: 25 pages, 5 figures, improved asymptotic bounds.
[WWW
] [bibtex-entry]
-
Ali Al Zoobi,
David Coudert,
and Nicolas Nisse.
Finding the k Shortest Simple Paths: Time and Space trade-offs.
Research Report,
Inria ; I3S, Université Côte d'Azur,
April 2021.
[WWW
] [PDF
]
Keywords:
k shortest simple paths,
graph algorithm,
space-time trade-off.
[bibtex-entry]
-
Ali Al Zoobi,
David Coudert,
and Nicolas Nisse.
On the complexity of finding $k$ shortest dissimilar paths in a graph.
Research Report,
Inria ; CNRS ; I3S ; Université Côte dâAzur,
2021.
[WWW
] [PDF
] [bibtex-entry]
-
Fabricio Benevides,
Jean-Claude Bermond,
Hicham Lesfari,
and Nicolas Nisse.
Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation.
Research Report,
Université Côte d'Azur,
2021.
[WWW
] [PDF
] [bibtex-entry]
-
Julien Bensmail,
François Dross,
Nacim Oijid,
and Éric Sopena.
Generalising the achromatic number to Zaslavsky's colourings of signed graphs.
Research Report,
Université côte d'azur ; Université de Bordeaux ; Université lyon 1,
2021.
[WWW
] [PDF
]
Keywords:
chromatic number,
achromatic number,
complete colouring,
Zaslavsky's colouring,
signed graph.
[bibtex-entry]
-
Julien Bensmail,
Foivos Fioravantes,
Fionn Mc Inerney,
Nicolas Nisse,
and Nacim Oijid.
The Maker-Breaker Largest Connected Subgraph Game.
Research Report,
Université Côte dâAzur, CNRS, Inria, I3S, Biot, France,
2021.
[WWW
] [PDF
]
Keywords:
Maker-Breaker games,
Largest connected subgraph game,
Connection games,
PSPACE-complete.
[bibtex-entry]
-
Julien Bensmail,
Foivos Fioravantes,
Fionn Mc Inerney,
and Nicolas Nisse.
The Largest Connected Subgraph Game.
Research Report,
Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France ; CISPA Helmholtz Center for Information Security, Saarbrücken, Germany,
2021.
[WWW
] [PDF
]
Keywords:
Games on graphs,
Scoring games,
Connection games,
PSPACE-complete,
GI-hard.
[bibtex-entry]
-
Julien Bensmail,
Hervé Hocquard,
Dimitri Lajou,
and Eric Sopena.
On a List Variant of the Multiplicative 1-2-3 Conjecture.
Research Report,
Université de bordeaux ; Université côte d'azur,
2021.
[WWW
] [PDF
]
Keywords:
proper labelling,
1-2-3 Conjecture,
product,
list.
[bibtex-entry]
-
Julien Bensmail,
Hervé Hocquard,
Dimitri Lajou,
and Éric Sopena.
A proof of the Multiplicative 1-2-3 Conjecture.
Research Report,
Université côte d'azur ; Université de bordeaux,
2021.
[WWW
] [PDF
]
Keywords:
1-2-3 Conjecture,
product version,
labels 1-2-3.
[bibtex-entry]
-
Julien Bensmail,
Hervé Hocquard,
and Pierre-Marie Marcille.
Going Wide with the 1-2-3 Conjecture.
Research Report,
Université Côte d'Azur ; Université de Bordeaux ; ENS Lyon,
2021.
[WWW
] [PDF
]
Keywords:
Distinguishing labelling,
1-2-3 Conjecture,
fixed radius.
[bibtex-entry]
-
Julien Bensmail and Fionn Mc Inerney.
The Vertex-Capturing Game.
Research Report,
Université Côte d'Azur ; CISPA Helmholtz Center for Information Security,
2021.
[WWW
] [PDF
]
Keywords:
scoring game,
combinatorial game,
2-player game,
graph.
[bibtex-entry]
-
David Coudert,
Ali Al Zoobi,
and Arthur Finkelstein.
On finding $k$ earliest arrival time journeys in public transit networks.
Research Report,
Inria,
June 2021.
[WWW
] [PDF
]
Keywords:
Journey planning,
shortest path,
routing,
timetables.
[bibtex-entry]
-
David Coudert,
André Nusser,
and Laurent Viennot.
Enumeration of far-apart pairs by decreasing distance for faster hyperbolicity computation.
Research Report,
Inria ; I3S, Université Côte d'Azur,
April 2021.
[WWW
] [PDF
]
Keywords:
Gromov hyperbolicity,
Graph algorithms,
Far-apart pairs,
Enumeration algorithms.
[bibtex-entry]
-
Francesco d'Amore,
Daniel Mitropolsky,
Pierluigi Crescenzi,
Emanuele Natale,
and Christos H Papadimitriou.
Planning with Biological Neurons and Synapses.
Research Report,
Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France ; Gran Sasso Science Institute (L'Aquila, Italie) ; Department of Computer Science, Columbia University, New York,
December 2021.
Note: To appear in AAAI 2022.
[WWW
] [PDF
] [bibtex-entry]
-
Francesco d'Amore and Isabella Ziccardi.
Phase Transition of the 3-Majority Dynamics with Uniform Communication Noise.
Research Report,
Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France ; Università degli Studi dell'Aquila,
December 2021.
[WWW
] [PDF
]
Keywords:
Opinion Dynamics,
Uniform Communication Noise,
Consensus Problem,
Distributed Computing,
Randomized Algorithms.
[bibtex-entry]
-
Arthur Da Cunha,
Emanuele Natale,
and Laurent Viennot.
Neural Network Information Leakage through Hidden Learning.
Research Report,
Inria ; CNRS ; I3S ; Université Côte d'Azur,
2021.
[WWW
] [PDF
] [bibtex-entry]
-
Giuseppe Di Lena,
Andrea Tomassilli,
Frédéric Giroire,
Damien Saucez,
Thierry Turletti,
and Chidung Lac.
Placement Module for Distributed SDN/NFV Network Emulation.
Research Report RR-9391,
Inria Sophia Antipolis - Méditerranée ; I3S, Université Côte d'Azur ; Orange Labs R&D [Lannion] (France Télécom),
February 2021.
[WWW
] [PDF
]
Keywords:
Virtualization,
Emulation,
Placement,
Approximation algorithms,
Virtualisation réseau,
Emulation distribuée,
Algorithmes de placement.
[bibtex-entry]
-
Foivos Fioravantes,
Nikolaos Melissinos,
and Theofilos Triommatis.
Complexity of Finding Maximum Locally Irregular Induced Subgraphs.
Research Report,
Inria ; I3S ; Université Côte d'Azur,
September 2021.
[WWW
] [PDF
]
Keywords:
FPT,
largest induced subgraph,
Locally irregular,
treewidth,
W-hardness.
[bibtex-entry]
-
Frédéric Giroire,
Nicolas Nisse,
Thibaud Trolliet,
and Malgorzata Sulkowska.
Preferential attachment hypergraph with high modularity.
Research Report,
Université Cote d'Azur,
2021.
[WWW
] [PDF
]
Keywords:
Complex network,
Hypergraph,
Preferential attachment,
Modularity.
[bibtex-entry]
-
Frédéric Havet,
Jorgen Bang-Jensen,
and Anders Yeo.
Spanning eulerian subdigraphs in semicomplete digraphs.
Research Report,
Inria ; CNRS ; I3S ; Université côte d'azur,
December 2021.
[WWW
] [PDF
]
Keywords:
Arc-connectivity,
Eulerian subdigraph,
Tournament,
Semicomplete digraph,
polynomial algorithm.
[bibtex-entry]
-
Frédéric Havet,
Dorian Mazauric,
and Viet-Ha Nguyen.
On the complexity of overlaying a hypergraph with a graph with bounded maximum degree.
Research Report,
Inria ; CNRS ; I3S ; Université Côte d'Azur,
2021.
[WWW
] [PDF
] [bibtex-entry]
-
Viet-Ha Nguyen and Kévin Perrot.
Rikudo is NP-complete.
Research Report,
Inria ; Université Côte d'Azur ; I3S ; CNRS,
2021.
[WWW
] [bibtex-entry]
-
Malgorzata Sulkowska,
Bernhard Gittenberger,
Zbigniew GolÄbiewski,
and Isabella Larcher.
Counting embeddings of rooted trees into families of rooted trees.
Research Report,
Combinatorics, Optimization and Algorithms for Telecommunications [researchteam] (211142) ; Wroclaw University of Science and Technology ; Technische Universität Wien,
September 2021.
Note: 20 pages, 6 figures.
[WWW
] [PDF
] [bibtex-entry]
-
Malgorzata Sulkowska,
Alexander Gnedin,
and Patryk Koziel.
Running minimum in the best-choice problem.
Research Report,
Wroclaw University of Science and Technology ; University of London, Queen Mary ; Combinatorics, Optimization and Algorithms for Telecommunications [researchteam] (211142),
October 2021.
Note: 22 pages, 9 figures.
[WWW
] [PDF
] [bibtex-entry]
-
Malgorzata Sulkowska,
Krzysztof Grining,
and Marek Klonowski.
What Do Our Choices Say About Our Preferences?.
Research Report,
Combinatorics, Optimization and Algorithms for Telecommunications [researchteam] (211142) ; Wroclaw University of Science and Technology,
June 2021.
Note: 22 pages, 6 figures.
[WWW
] [PDF
] [bibtex-entry]
-
Malgorzata Sulkowska and Michal Lason.
Modularity of minor-free graphs.
Research Report,
Combinatorics, Optimization and Algorithms for Telecommunications [researchteam] (211142) ; Institute of Mathematics of the Polish Academy of Sciences ; Wroclaw University of Science and Technology,
February 2021.
Note: 7 pages, 1 figure.
[WWW
] [PDF
] [bibtex-entry]
-
Ali Al Zoobi,
David Coudert,
and Nicolas Nisse.
k shortest simple paths,
2021.
Note: Software.
[WWW
]
Keywords:
k shortest simple paths,
Graph algorithms,
Space-time trade-off.
[bibtex-entry]
-
David Coudert,
André Nusser,
and Laurent Viennot.
Hyperbolicity,
2021.
Note: Software.
[WWW
]
Keywords:
Gromov hyperbolicity,
Graph algorithms,
Algorithm engineering.
[bibtex-entry]
-
Emilio Cruciani,
Francesco d'Amore,
and Emanuele Natale.
On some Opinion Dynamics in Multi-Agent Systems.
MOMI2021: Le Monde des Mathematiques Industrielles,
March 2021.
Note: Poster.
[WWW
] [PDF
] [bibtex-entry]
-
Giuseppe Di Lena,
Frédéric Giroire,
Thierry Turletti,
and Chidung Lac.
CloudTrace Demo: Tracing Cloud Network Delay.
IEEE International Conference on Network Softwarization (NetSoft),
June 2021.
Note: Poster.
[WWW
] [PDF
] [bibtex-entry]
BACK TO COATI PUBLICATION INDEX
Last modified: Sat Jan 29 19:00:41 2022
