-
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.
@incollection{aboulker:hal-03424140,
TITLE = {{On the dichromatic number of surfaces}},
AUTHOR = {Aboulker, Pierre and Havet, Fr{\'e}d{\'e}ric and Knauer, Kolja and Rambaud, Cl{\'e}ment},
URL = {https://hal.inria.fr/hal-03424140},
BOOKTITLE = {{Extended Abstracts EuroComb 2021}},
PUBLISHER = {{Springer International Publishing}},
SERIES = {Trends in Mathematics},
VOLUME = {14},
PAGES = {181-187},
YEAR = {2021},
MONTH = Aug,
DOI = {10.1007/978-3-030-83823-2\_29},
KEYWORDS = {dichromatic number ; planar graphs ; graphs on surfaces},
PDF = {https://hal.inria.fr/hal-03424140/file/dichromatic-eurocomb.pdf},
HAL_ID = {hal-03424140},
HAL_VERSION = {v1},
}
-
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.
@article{arroyo:hal-03120899,
TITLE = {{Extending Drawings of Graphs to Arrangements of Pseudolines}},
AUTHOR = {Arroyo, Alan and Bensmail, Julien and Richter, Bruce R.},
URL = {https://hal.archives-ouvertes.fr/hal-03120899},
JOURNAL = {{Journal of Computational Geometry}},
PUBLISHER = {{Carleton University, Computational Geometry Laboratory}},
VOLUME = {12},
NUMBER = {2},
PAGES = {3-24},
YEAR = {2021},
DOI = {10.20382/jocg.v12i2a2},
KEYWORDS = {graphs ; graph drawings ; geometric graph drawings ; arrangements of pseudolines ; crossing numbers ; stretchability},
PDF = {https://hal.archives-ouvertes.fr/hal-03120899/file/pseudolines.pdf},
HAL_ID = {hal-03120899},
HAL_VERSION = {v1},
}
-
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.
@article{bensmail:hal-02373515,
TITLE = {{Pushable chromatic number of graphs with degree constraints}},
AUTHOR = {Bensmail, Julien and Das, Sandip and Nandi, Soumen and Paul, Soumyajit and Pierron, Th{\'e}o and Sen, Sagnik and Sopena, Eric},
URL = {https://hal.archives-ouvertes.fr/hal-02373515},
JOURNAL = {{Discrete Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {344},
NUMBER = {1},
PAGES = {112151},
YEAR = {2021},
DOI = {10.1016/j.disc.2020.112151 Get},
KEYWORDS = {graph homomorphism ; maximum degree ; subcubicgraph ; oriented coloring ; push operation},
PDF = {https://hal.archives-ouvertes.fr/hal-02373515v2/file/main.pdf},
HAL_ID = {hal-02373515},
HAL_VERSION = {v2},
}
-
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.
@article{bensmail:hal-02533537,
TITLE = {{Further Results on an Equitable 1-2-3 Conjecture}},
AUTHOR = {Bensmail, Julien and Fioravantes, Foivos and Mc Inerney, Fionn and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-02533537},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {297},
PAGES = {1-20},
YEAR = {2021},
DOI = {10.1016/j.dam.2021.02.037 Get},
KEYWORDS = {Proper labellings ; Equitable labellings ; 1-2-3 Conjecture},
PDF = {https://hal.archives-ouvertes.fr/hal-02533537v2/file/main.pdf},
HAL_ID = {hal-02533537},
HAL_VERSION = {v2},
}
-
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.
@article{bensmail:hal-02975031,
TITLE = {{On the Role of 3s for the 1-2-3 Conjecture}},
AUTHOR = {Bensmail, Julien and Fioravantes, Foivos and Mc Inerney, Fionn},
URL = {https://hal.archives-ouvertes.fr/hal-02975031},
TYPE = {Research Report},
JOURNAL = {{Theoretical Computer Science}},
PUBLISHER = {{Elsevier}},
VOLUME = {892},
PAGES = {238-257},
INSTITUTION = {{Universit{\'e} c{\^o}te d'azur ; Aix-Marseille Universite}},
YEAR = {2021},
DOI = {10.1016/j.tcs.2021.09.023},
KEYWORDS = {Proper labellings ; 3-chromatic graphs ; 1-2-3 Conjecture},
PDF = {https://hal.archives-ouvertes.fr/hal-02975031v3/file/main.pdf},
HAL_ID = {hal-02975031},
HAL_VERSION = {v3},
}
-
Julien Bensmail,
Foivos Fioravantes,
and Nicolas Nisse.
On Proper Labellings of Graphs with Minimum Label Sum.
Algorithmica,
2021.
[WWW
] [PDF
]
@article{bensmail:hal-03455908,
TITLE = {{On Proper Labellings of Graphs with Minimum Label Sum}},
AUTHOR = {Bensmail, Julien and Fioravantes, Foivos and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-03455908},
JOURNAL = {{Algorithmica}},
PUBLISHER = {{Springer Verlag}},
YEAR = {2021},
PDF = {https://hal.archives-ouvertes.fr/hal-03455908/file/Minimize_Sum_of_Edge_Labels%29.pdf},
HAL_ID = {hal-03455908},
HAL_VERSION = {v1},
}
-
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.
@article{bensmail:hal-02195028,
TITLE = {{On BMRN*-colouring of planar digraphs}},
AUTHOR = {Bensmail, Julien and Fioravantes, Foivos},
URL = {https://hal.archives-ouvertes.fr/hal-02195028},
TYPE = {Research Report},
JOURNAL = {{Discrete Mathematics and Theoretical Computer Science}},
PUBLISHER = {{DMTCS}},
VOLUME = {23},
NUMBER = {1},
PAGES = {\#4},
INSTITUTION = {{Universit{\'e} C{\^o}te d'Azur, CNRS, I3S, France}},
YEAR = {2021},
MONTH = Feb,
DOI = {10.46298/dmtcs.5798},
KEYWORDS = {BMRN*-colouring ; planar digraphs ; TDMA scheduling},
PDF = {https://hal.archives-ouvertes.fr/hal-02195028v6/file/bmrn-planar.pdf},
HAL_ID = {hal-02195028},
HAL_VERSION = {v6},
}
-
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
]
@article{bensmail:hal-02459377,
TITLE = {{An injective version of the 1-2-3 Conjecture}},
AUTHOR = {Bensmail, Julien and Li, Bi and Li, Binlong},
URL = {https://hal.archives-ouvertes.fr/hal-02459377},
TYPE = {Research Report},
JOURNAL = {{Graphs and Combinatorics}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {37},
PAGES = {281-311},
INSTITUTION = {{Universit{\'e} c{\^o}te d'azur}},
YEAR = {2021},
DOI = {10.1007/s00373-020-02252-y},
PDF = {https://hal.archives-ouvertes.fr/hal-02459377/file/injective123c.pdf},
HAL_ID = {hal-02459377},
HAL_VERSION = {v1},
}
-
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.
@article{bensmail:hal-02330418,
TITLE = {{On Minimizing the Maximum Color for the 1-2-3 Conjecture}},
AUTHOR = {Bensmail, Julien and Li, Bi and Li, Binlong and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-02330418},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {289},
PAGES = {32-51},
YEAR = {2021},
DOI = {10.1016/j.dam.2020.09.020},
KEYWORDS = {proper vertex-colorings ; edge labelings ; 1-2-3 Conjecture ; small vertex colors},
PDF = {https://hal.archives-ouvertes.fr/hal-02330418v2/file/maxWeightIndirectColoring_revised.pdf},
HAL_ID = {hal-02330418},
HAL_VERSION = {v2},
}
-
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.
@article{bensmail:hal-02554102,
TITLE = {{On a graph labelling conjecture involving coloured labels}},
AUTHOR = {Bensmail, Julien},
URL = {https://hal.archives-ouvertes.fr/hal-02554102},
JOURNAL = {{Discussiones Mathematicae Graph Theory}},
PUBLISHER = {{University of Zielona G{\'o}ra}},
YEAR = {2021},
KEYWORDS = {Proper labellings ; Coloured labels ; Weak (2 ; 2)-Conjecture ; 1-2-3 Conjecture},
PDF = {https://hal.archives-ouvertes.fr/hal-02554102v2/file/22weak.pdf},
HAL_ID = {hal-02554102},
HAL_VERSION = {v2},
}
-
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.
@article{bensmail:hal-02613858,
TITLE = {{On Generalisations of the AVD Conjecture to Digraphs}},
AUTHOR = {Bensmail, Julien and Mc Inerney, Fionn},
URL = {https://hal.archives-ouvertes.fr/hal-02613858},
JOURNAL = {{Graphs and Combinatorics}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {37},
PAGES = {545-558},
YEAR = {2021},
DOI = {10.1007/s00373-020-02263-9},
KEYWORDS = {Digraphs ; AVD Conjecture ; Proper edge-colourings ; proper edge-colourings ; digraphs},
PDF = {https://hal.archives-ouvertes.fr/hal-02613858v2/file/avd-directed.pdf},
HAL_ID = {hal-02613858},
HAL_VERSION = {v2},
}
-
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
]
@article{bermond:hal-03455881,
TITLE = {{Graphes et T{\'e}l{\'e}communications}},
AUTHOR = {Bermond, Jean-Claude and Giroire, Fr{\'e}d{\'e}ric and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-03455881},
JOURNAL = {{Biblioth{\`e}que Tangente}},
PUBLISHER = {{Editions P{\^o}le Paris}},
SERIES = {Hors Serie 75 La recherche op{\'e}rationnelle},
NUMBER = {Hors Serie 75},
PAGES = {120-125},
YEAR = {2021},
PDF = {https://hal.archives-ouvertes.fr/hal-03455881/file/Tangente.pdf},
HAL_ID = {hal-03455881},
HAL_VERSION = {v1},
}
-
Andrea Clementi,
Emanuele Natale,
and Isabella Ziccardi.
Parallel Load Balancing on constrained client-server topologies.
Theoretical Computer Science,
895:16-33,
December 2021.
[WWW
]
@article{clementi:hal-03548136,
TITLE = {{Parallel Load Balancing on constrained client-server topologies}},
AUTHOR = {Clementi, Andrea and Natale, Emanuele and Ziccardi, Isabella},
URL = {https://hal.archives-ouvertes.fr/hal-03548136},
JOURNAL = {{Theoretical Computer Science}},
PUBLISHER = {{Elsevier}},
VOLUME = {895},
PAGES = {16-33},
YEAR = {2021},
MONTH = Dec,
DOI = {10.1016/j.tcs.2021.09.026},
HAL_ID = {hal-03548136},
HAL_VERSION = {v1},
}
-
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
]
@article{cruciani:hal-03548134,
TITLE = {{Phase transition of the 2-Choices dynamics on core--periphery networks}},
AUTHOR = {Cruciani, Emilio and Natale, Emanuele and Nusser, Andr{\'e} and Scornavacca, Giacomo},
URL = {https://hal.archives-ouvertes.fr/hal-03548134},
JOURNAL = {{Distributed Computing}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {34},
NUMBER = {3},
PAGES = {207-225},
YEAR = {2021},
MONTH = Jun,
DOI = {10.1007/s00446-021-00396-5},
HAL_ID = {hal-03548134},
HAL_VERSION = {v1},
}
-
Ali Dehghan and Frédéric Havet.
On the semi-proper orientations of graphs.
Discrete Applied Mathematics,
296:9-25,
June 2021.
[WWW
] [PDF
]
@article{dehghan:hal-03035385,
TITLE = {{On the semi-proper orientations of graphs}},
AUTHOR = {Dehghan, Ali and Havet, Fr{\'e}d{\'e}ric},
URL = {https://hal.inria.fr/hal-03035385},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {296},
PAGES = {9-25},
YEAR = {2021},
MONTH = Jun,
DOI = {10.1016/j.dam.2020.07.003},
PDF = {https://hal.inria.fr/hal-03035385/file/semi-proper.pdf},
HAL_ID = {hal-03035385},
HAL_VERSION = {v1},
}
-
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
]
@article{dilena:hal-03000617,
TITLE = {{Distrinet: a Mininet Implementation for the Cloud}},
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-03000617},
JOURNAL = {{Computer Communication Review}},
PUBLISHER = {{Association for Computing Machinery}},
VOLUME = {51},
NUMBER = {1},
PAGES = {2-9},
YEAR = {2021},
MONTH = Jan,
DOI = {10.1145/3457175.3457177},
PDF = {https://hal.inria.fr/hal-03000617/file/CCR_New_version.pdf},
HAL_ID = {hal-03000617},
HAL_VERSION = {v1},
}
-
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
]
@article{draganic:hal-03269230,
TITLE = {{Powers of paths in tournaments}},
AUTHOR = {Dragani{\'c}, Nemanja and Dross, Fran{\c c}ois and Fox, Jacob and Gir{\~a}o, Ant{\'o}nio and Havet, Fr{\'e}d{\'e}ric and Kor{\'a}ndi, D{\'a}niel and Lochet, William and Correia, David Munh{\'a} and Scott, Alex and Sudakov, Benny},
URL = {https://hal.inria.fr/hal-03269230},
JOURNAL = {{Combinatorics, Probability and Computing}},
PUBLISHER = {{Cambridge University Press (CUP)}},
PAGES = {1-5},
YEAR = {2021},
DOI = {10.1017/S0963548321000067},
PDF = {https://hal.inria.fr/hal-03269230/file/powers-of-path-tournaments.pdf},
HAL_ID = {hal-03269230},
HAL_VERSION = {v1},
}
-
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.
@article{dross:hal-03269226,
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-03269226},
JOURNAL = {{Journal of Combinatorial Theory, Series B}},
PUBLISHER = {{Elsevier}},
VOLUME = {151},
PAGES = {83-110},
YEAR = {2021},
MONTH = Nov,
DOI = {10.1016/j.jctb.2021.06.003},
KEYWORDS = {Tournament ; Oriented tree ; Unavoidable},
PDF = {https://hal.inria.fr/hal-03269226/file/unavoidability-revise2.pdf},
HAL_ID = {hal-03269226},
HAL_VERSION = {v1},
}
-
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.
@article{duong:hal-03274803,
TITLE = {{Efficient Make-Before-Break Layer 2 Reoptimization}},
AUTHOR = {Duong, Huy and Jaumard, Brigitte and Coudert, David and Armolavicius, Romualdas},
URL = {https://hal.inria.fr/hal-03274803},
JOURNAL = {{IEEE/ACM Transactions on Networking}},
PUBLISHER = {{IEEE/ACM}},
VOLUME = {29},
NUMBER = {5},
PAGES = {1910-1921},
YEAR = {2021},
MONTH = Oct,
DOI = {10.1109/TNET.2021.3078581},
KEYWORDS = {Network reconfiguration ; rerouting ; reoptimization ; make-before-break},
PDF = {https://hal.inria.fr/hal-03274803/file/MBB_layer2_ToN.pdf},
HAL_ID = {hal-03274803},
HAL_VERSION = {v1},
}
-
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.
@article{frigo:hal-03033777,
TITLE = {{Network alignment and similarity reveal atlas-based topological differences in structural connectomes}},
AUTHOR = {Frigo, Matteo and Cruciani, Emilio and Coudert, David and Deriche, Rachid and Deslauriers-Gauthier, Samuel and Natale, Emanuele},
URL = {https://hal.archives-ouvertes.fr/hal-03033777},
JOURNAL = {{Network Neuroscience}},
PUBLISHER = {{MIT Press}},
YEAR = {2021},
MONTH = May,
DOI = {10.1162/netn\_a\_00199},
KEYWORDS = {Weisfeiler-Lehman ; graph Jaccard index ; graph alignment ; structural connectome ; brain network topology ; neuroscience ; OPAL-Meso ; brain parcellation ; brain network ; graph matching ; Network alignment},
PDF = {https://hal.archives-ouvertes.fr/hal-03033777v2/file/netn-manuscript.pdf},
HAL_ID = {hal-03033777},
HAL_VERSION = {v2},
}
-
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
]
@article{gausseran:hal-03430584,
TITLE = {{Be Scalable and Rescue My Slices During Reconfiguration}},
AUTHOR = {Gausseran, Adrien and Giroire, Frederic and Jaumard, Brigitte and Moulierac, Joanna},
URL = {https://hal.archives-ouvertes.fr/hal-03430584},
JOURNAL = {{The Computer Journal}},
PUBLISHER = {{Oxford University Press (UK)}},
VOLUME = {64},
NUMBER = {10},
PAGES = {1584-1599},
YEAR = {2021},
MONTH = Oct,
DOI = {10.1093/comjnl/bxab108},
PDF = {https://hal.archives-ouvertes.fr/hal-03430584/file/Journal_Chaining_Adrien%20- opie.pdf},
HAL_ID = {hal-03430584},
HAL_VERSION = {v1},
}
-
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.
@article{gausseran:hal-03430469,
TITLE = {{Don't Interrupt Me When You Reconfigure my Service Function Chains}},
AUTHOR = {Gausseran, Adrien and Tomassilli, Andrea and Giroire, Frederic and Moulierac, Joanna},
URL = {https://hal.archives-ouvertes.fr/hal-03430469},
JOURNAL = {{Computer Communications}},
PUBLISHER = {{Elsevier}},
VOLUME = {171},
PAGES = {39-53},
YEAR = {2021},
MONTH = Apr,
DOI = {10.1016/j.comcom.2021.02.008},
KEYWORDS = {Software Defined Networks ; Network Function Virtualization ; Service Function Chaining ; Network reconfiguration ; optimization},
PDF = {https://hal.archives-ouvertes.fr/hal-03430469/file/ComCom%20- opie.pdf},
HAL_ID = {hal-03430469},
HAL_VERSION = {v1},
}
-
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
]
@article{jaumard:hal-03345749,
TITLE = {{Dantzig--Wolfe decomposition for the design of filterless optical networks}},
AUTHOR = {Jaumard, Brigitte and Wang, Yan and Coudert, David},
URL = {https://hal.inria.fr/hal-03345749},
JOURNAL = {{Journal of Optical Communications and Networking}},
PUBLISHER = {{Piscataway, NJ ; Washington, DC : IEEE : Optical Society of America}},
VOLUME = {13},
NUMBER = {12},
PAGES = {10},
YEAR = {2021},
DOI = {10.1364/JOCN.424415},
PDF = {https://hal.inria.fr/hal-03345749/file/JOCN_2021_hal_2col.pdf},
HAL_ID = {hal-03345749},
HAL_VERSION = {v1},
}
-
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.
@article{mcinerney:hal-02801932,
TITLE = {{Eternal 'e}communications}},
ADDRESS = {La Rochelle, France},
YEAR = {2021},
MONTH = Sep,
KEYWORDS = {Similarit{\'e} entre chemins ; $k$ plus courts chemins simples},
PDF = {https://hal.archives-ouvertes.fr/hal-03219987v2/file/On_the_k_top_shortest_paths_with_diversity_constraints_c.pdf},
HAL_ID = {hal-03219987},
HAL_VERSION = {v2},
}
-
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.
@inproceedings{bensmail:hal-03219636,
TITLE = {{The Largest Connected Subgraph Game}},
AUTHOR = {Bensmail, Julien and Fioravantes, Foivos and Mc Inerney, Fionn and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-03219636},
BOOKTITLE = {{WG 2021 - The 47th International Workshop on Graph-Theoretic Concepts in Computer Science}},
ADDRESS = {Warsaw, Poland},
PUBLISHER = {{Springer}},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {12911},
PAGES = {296-307},
YEAR = {2021},
MONTH = Jun,
DOI = {10.1007/978-3-030-86838-3\_23},
KEYWORDS = {Games on graphs ; Scoring games ; Connection games ; PSPACE-complete},
PDF = {https://hal.inria.fr/hal-03219636/file/The_Largest_Connected_Subgraph_Game%29%281 0x4df},
HAL_ID = {hal-03219636},
HAL_VERSION = {v1},
}
-
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.
@inproceedings{bensmail:hal-03119119,
TITLE = {{On the Role of 3's for the 1-2-3 Conjecture}},
AUTHOR = {Bensmail, Julien and Fioravantes, Foivos and Mc Inerney, Fionn},
URL = {https://hal.archives-ouvertes.fr/hal-03119119},
BOOKTITLE = {{CIAC 2021 - 12th International Conference on Algorithms and Complexity}},
ADDRESS = {Larnaca, Cyprus},
PUBLISHER = {{Springer}},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {12701},
PAGES = {103-115},
YEAR = {2021},
MONTH = May,
DOI = {10.1007/978-3-030-75242-2\_7},
KEYWORDS = {3-chromatic graphs ; Proper labellings ; 1-2-3 Conjecture},
PDF = {https://hal.archives-ouvertes.fr/hal-03119119/file/Count3_CIAC2021%281 0x4df},
HAL_ID = {hal-03119119},
HAL_VERSION = {v1},
}
-
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.
@inproceedings{bensmail:hal-03211446,
TITLE = {{Connexions ! Le jeu du plus grand sous-graphe connexe}},
AUTHOR = {Bensmail, Julien and Fioravantes, Foivos and Mc Inerney, Fionn and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-03211446},
BOOKTITLE = {{ALGOTEL 2021 - 23{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {La Rochelle, France},
YEAR = {2021},
MONTH = Sep,
KEYWORDS = {Games on graphs ; Scoring games ; Connection games ; PSPACE-complete ; Jeux {\`a} deux joueurs dans les graphes ; Jeux de connexion ; Jeux {\`a} score},
PDF = {https://hal.inria.fr/hal-03211446v2/file/The_Largest_Connected_Subgraph_Game_AlgoTel2.pdf},
HAL_ID = {hal-03211446},
HAL_VERSION = {v2},
}
-
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.
@inproceedings{caillouet:hal-03213988,
TITLE = {{Optimiser l'{\'e}quit{\'e} dans les r{\'e}seaux LoRaWAN}},
AUTHOR = {Caillouet, Christelle and Heusse, Martin and Rousseau, Franck},
URL = {https://hal.archives-ouvertes.fr/hal-03213988},
BOOKTITLE = {{CORES 2021 - 6{\`e}me Rencontres Francophones sur la Conception de Protocoles, lâ{\'E}valuation de Performance et lâExp{\'e}rimentation des R{\'e}seaux de Communication}},
ADDRESS = {La Rochelle, France},
SERIES = {CORES 2021 - 6{\`e}me Rencontres Francophones sur la Conception de Protocoles, lâ{\'E}valuation de Performance et lâExp{\'e}rimentation des R{\'e}seaux de Communication},
YEAR = {2021},
MONTH = May,
KEYWORDS = {LoRaWAN ; optimization ; fairness},
PDF = {https://hal.archives-ouvertes.fr/hal-03213988/file/CoRes2021_Fairness_LoRa-2.pdf},
HAL_ID = {hal-03213988},
HAL_VERSION = {v1},
}
-
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
]
@inproceedings{clementi:hal-02530253,
TITLE = {{Search via Parallel L{\'e}vy Walks on ${\mathbb Z}^2$}},
AUTHOR = {Clementi, Andrea and d'Amore, Francesco and Giakkoupis, George and Natale, Emanuele},
URL = {https://hal.archives-ouvertes.fr/hal-02530253},
TYPE = {Research Report},
BOOKTITLE = {{PODC 2021 - ACM Symposium on Principles of Distributed Computing}},
ADDRESS = {Salerno, Italy},
PAGES = {81--91},
INSTITUTION = {{Inria \& Universit{\'e} Cote d'Azur, CNRS, I3S, Sophia Antipolis, France ; Universit{\`a} degli Studi di Roma ''Tor Vergata'' ; Univ Rennes, Inria, CNRS, IRISA, France}},
YEAR = {2021},
MONTH = Jul,
DOI = {10.1145/3465084.3467921},
PDF = {https://hal.archives-ouvertes.fr/hal-02530253v5/file/levy.pdf},
HAL_ID = {hal-02530253},
HAL_VERSION = {v5},
}
-
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
]
@inproceedings{cruciani:hal-03007242,
TITLE = {{Phase Transitions of the $k$-Majority Dynamics in a Biased Communication Model}},
AUTHOR = {Cruciani, Emilio and Mimun, Hlafo Alfie and Quattropani, Matteo and Rizzo, Sara},
URL = {https://hal.archives-ouvertes.fr/hal-03007242},
BOOKTITLE = {{ICDCN 2021 - 22nd International Conference on Distributed Computing and Networking}},
ADDRESS = {Nara / Virtual, Japan},
PUBLISHER = {{ACM}},
PAGES = {146-155},
YEAR = {2021},
MONTH = Jan,
DOI = {10.1145/3427796.3427811},
PDF = {https://hal.archives-ouvertes.fr/hal-03007242/file/2007.15306.pdf},
HAL_ID = {hal-03007242},
HAL_VERSION = {v1},
}
-
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
]
@inproceedings{dilena:hal-03001913,
TITLE = {{A Right Placement Makes a Happy Emulator: a Placement Module for Distributed SDN/NFV Emulation}},
AUTHOR = {Di Lena, Giuseppe and Tomassilli, Andrea and Giroire, Fr{\'e}d{\'e}ric and Saucez, Damien and Turletti, Thierry and Lac, Chidung},
URL = {https://hal.inria.fr/hal-03001913},
BOOKTITLE = {{ICC 2021 - IEEE International Conference on Communications}},
ADDRESS = {Montr{\'e}al, Canada},
PUBLISHER = {{IEEE}},
YEAR = {2021},
MONTH = Jun,
DOI = {10.1109/ICC42927.2021.9500359},
PDF = {https://hal.inria.fr/hal-03001913v2/file/distributed-emulation-placement-ICC-2021.pdf},
HAL_ID = {hal-03001913},
HAL_VERSION = {v2},
}
-
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.
@inproceedings{diasdasilva:hal-03461101,
TITLE = {{Optimizing FANET deployment for mobile sensor tracking in disaster management scenario}},
AUTHOR = {Dias Da Silva, Igor and Caillouet, Christelle and Coudert, David},
URL = {https://hal.inria.fr/hal-03461101},
BOOKTITLE = {{7th International Conference on Information and Communication Technologies for Disaster Management (ICT-DM)}},
ADDRESS = {Hangzhou, China},
PUBLISHER = {{IEEE}},
PAGES = {134-141},
YEAR = {2021},
MONTH = Dec,
DOI = {10.1109/ICT-DM52643.2021.9664204},
KEYWORDS = {UAVs ; disaster management ; linear programming ; column generation},
PDF = {https://hal.inria.fr/hal-03461101/file/ICTDM21.pdf},
HAL_ID = {hal-03461101},
HAL_VERSION = {v1},
}
-
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.
@inproceedings{dissaux:hal-03217731,
TITLE = {{Longueur Arborescente des Graphes S{\'e}rie-Parall{\`e}les}},
AUTHOR = {Dissaux, Thomas and Ducoffe, Guillaume and Nisse, Nicolas and Nivelle, Simon},
URL = {https://hal.archives-ouvertes.fr/hal-03217731},
BOOKTITLE = {{ALGOTEL 2021 - 23{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {La Rochelle, France},
YEAR = {2021},
MONTH = Sep,
KEYWORDS = {d{\'e}composition arborescente ; longueur arborescente ; graphes s{\'e}rie-parall{\`e}les ; sous-graphes isom{\'e}triques},
PDF = {https://hal.archives-ouvertes.fr/hal-03217731v2/file/algotel.pdf},
HAL_ID = {hal-03217731},
HAL_VERSION = {v2},
}
-
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
]
@inproceedings{dissaux:hal-03175837,
TITLE = {{Treelength of Series-parallel graphs}},
AUTHOR = {Dissaux, Thomas and Ducoffe, Guillaume and Nisse, Nicolas and Nivelle, Simon},
URL = {https://hal.inria.fr/hal-03175837},
BOOKTITLE = {{LAGOS 2021 - XI Latin and American Algorithms, Graphs and Optimization Symposium}},
ADDRESS = {S{\~a}o Paulo / Virtual, Brazil},
YEAR = {2021},
MONTH = May,
PDF = {https://hal.inria.fr/hal-03175837/file/Lagos_2021%29.pdf},
HAL_ID = {hal-03175837},
HAL_VERSION = {v1},
}
-
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.
@inproceedings{duong:hal-03311598,
TITLE = {{Minimum Disturbance Rerouting to Optimize Bandwidth Usage}},
AUTHOR = {Duong, Huy and Jaumard, Brigitte and Coudert, David},
URL = {https://hal.inria.fr/hal-03311598},
BOOKTITLE = {{ONDM 2021 - International Conference on Optical Network Design and Modeling}},
ADDRESS = {Gothenburg, Sweden},
PUBLISHER = {{IEEE}},
PAGES = {1-6},
YEAR = {2021},
MONTH = Jun,
DOI = {10.23919/ONDM51796.2021.9492388},
KEYWORDS = {Network reconfiguration ; rerouting ; reoptimization ; make-before-break},
PDF = {https://hal.inria.fr/hal-03311598/file/ONDM_2021_hal.pdf},
HAL_ID = {hal-03311598},
HAL_VERSION = {v1},
}
-
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
]
@inproceedings{lesfari:hal-03364714,
TITLE = {{A multidimensional colored packing approach for network slicing with dedicated protection}},
AUTHOR = {Lesfari, Hicham and Giroire, Fr{\'e}d{\'e}ric and Lena, Giuseppe Di and Lac, Chidung},
URL = {https://hal.inria.fr/hal-03364714},
BOOKTITLE = {{IEEE Global Communications Conference (GLOBECOM)}},
ADDRESS = {Madrid, Spain},
YEAR = {2021},
MONTH = Dec,
PDF = {https://hal.inria.fr/hal-03364714/file/VNFC_Protection_New%282 (nil)df},
HAL_ID = {hal-03364714},
HAL_VERSION = {v1},
}
-
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.
@inproceedings{lesfari:hal-03221201,
TITLE = {{Une rencontre entre les noyaux de graphes et la detection dâanomalies dans les reseaux}},
AUTHOR = {Lesfari, Hicham and Giroire, Fr{\'e}d{\'e}ric},
URL = {https://hal.archives-ouvertes.fr/hal-03221201},
BOOKTITLE = {{ALGOTEL 2021 - 23{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {La Rochelle, France},
YEAR = {2021},
MONTH = Sep,
KEYWORDS = {Noyaux de graphe ; D{\'e}tection d'anomalies ; Apprentissage automatique ; R{\'e}seaux informatiques},
PDF = {https://hal.archives-ouvertes.fr/hal-03221201/file/algotel_2021.pdf},
HAL_ID = {hal-03221201},
HAL_VERSION = {v1},
}
-
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.
@inproceedings{ma:hal-03441537,
TITLE = {{When Locality is not enough: Boosting Peer Selection of Hybrid CDN-P2P Live Streaming Systems using Machine Learning}},
AUTHOR = {Ma, Zhejiayu and Roubia, Soufiane and Giroire, Fr{\'e}d{\'e}ric and Urvoy-Keller, Guillaume},
URL = {https://hal.inria.fr/hal-03441537},
BOOKTITLE = {{Network Traffic Measurement and Analysis Conference (IFIP TMA 2021)}},
ADDRESS = {Virtual, France},
PUBLISHER = {{IFIP}},
YEAR = {2021},
MONTH = Sep,
KEYWORDS = {hybrid P2P ; live streaming ; peer selection ; machine learning},
PDF = {https://hal.inria.fr/hal-03441537/file/2021-TMA-Peer-Selection-Hybrid DN-P2P-Streaming-Systems.pdf},
HAL_ID = {hal-03441537},
HAL_VERSION = {v1},
}
-
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.
@inproceedings{trolliet:hal-03220068,
TITLE = {{Un mod{\`e}le de graphes al{\'e}atoires croissants pour n'importe quelle distribution des degr{\'e}s}},
AUTHOR = {Trolliet, Thibaud and Giroire, Fr{\'e}d{\'e}ric and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.archives-ouvertes.fr/hal-03220068},
BOOKTITLE = {{ALGOTEL 2021 - 23{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {La Rochelle, France},
YEAR = {2021},
MONTH = Sep,
KEYWORDS = {Syst{\`e}mes Complexes ; Mod{\'e}lisation ; Attachement Pr{\'e}f{\'e}rentiel ; Distribution des degr{\'e}s ; Twitter},
PDF = {https://hal.archives-ouvertes.fr/hal-03220068/file/Algotel_Trolliet_Submission7.pdf},
HAL_ID = {hal-03220068},
HAL_VERSION = {v1},
}
-
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
]
@inproceedings{xu:hal-03364766,
TITLE = {{What else is leaked when eavesdropping Federated Learning?}},
AUTHOR = {Xu, Chuan and Neglia, Giovanni},
URL = {https://hal.archives-ouvertes.fr/hal-03364766},
NOTE = {Virtual, Contributed talk},
BOOKTITLE = {{CCS workshop Privacy Preserving Machine Learning (PPML)}},
ADDRESS = {Soeul, South Korea},
YEAR = {2021},
MONTH = Nov,
DOI = {10.1145/1122445.1122456},
PDF = {https://hal.archives-ouvertes.fr/hal-03364766v2/file/What_else_is_leaked_in_FL_ACM%29.pdf},
HAL_ID = {hal-03364766},
HAL_VERSION = {v2},
}
-
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
]
@inproceedings{zari:hal-03410152,
TITLE = {{Efficient passive membership inference attack in federated learning}},
AUTHOR = {Zari, Oualid and Xu, Chuan and Neglia, Giovanni},
URL = {https://hal.archives-ouvertes.fr/hal-03410152},
BOOKTITLE = {{Privacy in Machine Learning - NeurIPS PriML workshop}},
ADDRESS = {Virtual, France},
YEAR = {2021},
MONTH = Dec,
PDF = {https://hal.archives-ouvertes.fr/hal-03410152/file/Passive_inference_attack%29.pdf},
HAL_ID = {hal-03410152},
HAL_VERSION = {v1},
}
-
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
]
@techreport{aboulker:hal-03269426,
TITLE = {{On the dichromatic number of surfaces}},
AUTHOR = {Aboulker, Pierre and Havet, Fr{\'e}d{\'e}ric and Knauer, Kolja and Rambaud, Cl{\'e}ment},
URL = {https://hal.inria.fr/hal-03269426},
NOTE = {25 pages, 5 figures, improved asymptotic bounds},
TYPE = {Research Report},
INSTITUTION = {{Inria ; CNRS ; I3S ; Universit{\'e} C{\^o}te D'Azur}},
YEAR = {2021},
HAL_ID = {hal-03269426},
HAL_VERSION = {v1},
}
-
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.
@techreport{alzoobi:hal-03196830,
TITLE = {{Finding the k Shortest Simple Paths: Time and Space trade-offs}},
AUTHOR = {Al Zoobi, Ali and Coudert, David and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-03196830},
TYPE = {Research Report},
INSTITUTION = {{Inria ; I3S, Universit{\'e} C{\^o}te d'Azur}},
YEAR = {2021},
MONTH = Apr,
KEYWORDS = {k shortest simple paths ; graph algorithm ; space-time trade-off},
PDF = {https://hal.archives-ouvertes.fr/hal-03196830/file/Journal-kssp.pdf},
HAL_ID = {hal-03196830},
HAL_VERSION = {v1},
}
-
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
]
@techreport{alzoobi:hal-03187276,
TITLE = {{On the complexity of finding $k$ shortest dissimilar paths in a graph}},
AUTHOR = {Al Zoobi, Ali and Coudert, David and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-03187276},
TYPE = {Research Report},
PAGES = {9},
INSTITUTION = {{Inria ; CNRS ; I3S ; Universit{\'e} C{\^o}te dâAzur}},
YEAR = {2021},
PDF = {https://hal.archives-ouvertes.fr/hal-03187276v2/file/On_the_k_top_shortest_paths_with_dissimilarity_constraints-v2.pdf},
HAL_ID = {hal-03187276},
HAL_VERSION = {v2},
}
-
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
]
@techreport{benevides:hal-03161419,
TITLE = {{Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation}},
AUTHOR = {Benevides, Fabricio and Bermond, Jean-Claude and Lesfari, Hicham and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-03161419},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} C{\^o}te d'Azur}},
YEAR = {2021},
PDF = {https://hal.archives-ouvertes.fr/hal-03161419v4/file/virality__contamination_game_%29.pdf},
HAL_ID = {hal-03161419},
HAL_VERSION = {v4},
}
-
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.
@techreport{bensmail:hal-03355826,
TITLE = {{Generalising the achromatic number to Zaslavsky's colourings of signed graphs}},
AUTHOR = {Bensmail, Julien and Dross, Fran{\c c}ois and Oijid, Nacim and Sopena, {\'E}ric},
URL = {https://hal.archives-ouvertes.fr/hal-03355826},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} c{\^o}te d'azur ; Universit{\'e} de Bordeaux ; Universit{\'e} lyon 1}},
YEAR = {2021},
KEYWORDS = {chromatic number ; achromatic number ; complete colouring ; Zaslavsky's colouring ; signed graph},
PDF = {https://hal.archives-ouvertes.fr/hal-03355826/file/achromatic-signed.pdf},
HAL_ID = {hal-03355826},
HAL_VERSION = {v1},
}
-
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.
@techreport{bensmail:hal-03500888,
TITLE = {{The Maker-Breaker Largest Connected Subgraph Game}},
AUTHOR = {Bensmail, Julien and Fioravantes, Foivos and Mc Inerney, Fionn and Nisse, Nicolas and Oijid, Nacim},
URL = {https://hal.inria.fr/hal-03500888},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} C{\^o}te dâAzur, CNRS, Inria, I3S, Biot, France}},
YEAR = {2021},
DOI = {10.1007/978-3-030-86838-3\_23},
KEYWORDS = {Maker-Breaker games ; Largest connected subgraph game ; Connection games ; PSPACE-complete},
PDF = {https://hal.inria.fr/hal-03500888/file/The_Largest_Connected_Subgraph_Game__maker_breaker_version%29.pdf},
HAL_ID = {hal-03500888},
HAL_VERSION = {v1},
}
-
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.
@techreport{bensmail:hal-03137305,
TITLE = {{The Largest Connected Subgraph Game}},
AUTHOR = {Bensmail, Julien and Fioravantes, Foivos and Mc Inerney, Fionn and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-03137305},
TYPE = {Research Report},
INSTITUTION = {{Inria \& Universit{\'e} Cote d'Azur, CNRS, I3S, Sophia Antipolis, France ; CISPA Helmholtz Center for Information Security, Saarbr{\"u}cken, Germany}},
YEAR = {2021},
KEYWORDS = {Games on graphs ; Scoring games ; Connection games ; PSPACE-complete ; GI-hard},
PDF = {https://hal.inria.fr/hal-03137305v4/file/The_Largest_Connected_Subgraph_Game.pdf},
HAL_ID = {hal-03137305},
HAL_VERSION = {v4},
}
-
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.
@techreport{bensmail:hal-03120800,
TITLE = {{On a List Variant of the Multiplicative 1-2-3 Conjecture}},
AUTHOR = {Bensmail, Julien and Hocquard, Herv{\'e} and Lajou, Dimitri and Sopena, Eric},
URL = {https://hal.archives-ouvertes.fr/hal-03120800},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} de bordeaux ; Universit{\'e} c{\^o}te d'azur}},
YEAR = {2021},
KEYWORDS = {proper labelling ; 1-2-3 Conjecture ; product ; list},
PDF = {https://hal.archives-ouvertes.fr/hal-03120800/file/main.pdf},
HAL_ID = {hal-03120800},
HAL_VERSION = {v1},
}
-
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.
@techreport{bensmail:hal-03324458,
TITLE = {{A proof of the Multiplicative 1-2-3 Conjecture}},
AUTHOR = {Bensmail, Julien and Hocquard, Herv{\'e} and Lajou, Dimitri and Sopena, {\'E}ric},
URL = {https://hal.archives-ouvertes.fr/hal-03324458},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} c{\^o}te d'azur ; Universit{\'e} de bordeaux}},
YEAR = {2021},
KEYWORDS = {1-2-3 Conjecture ; product version ; labels 1-2-3},
PDF = {https://hal.archives-ouvertes.fr/hal-03324458/file/proof123p.pdf},
HAL_ID = {hal-03324458},
HAL_VERSION = {v1},
}
-
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.
@techreport{bensmail:hal-03225353,
TITLE = {{Going Wide with the 1-2-3 Conjecture}},
AUTHOR = {Bensmail, Julien and Hocquard, Herv{\'e} and Marcille, Pierre-Marie},
URL = {https://hal.archives-ouvertes.fr/hal-03225353},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} C{\^o}te d'Azur ; Universit{\'e} de Bordeaux ; ENS Lyon}},
YEAR = {2021},
KEYWORDS = {Distinguishing labelling ; 1-2-3 Conjecture ; fixed radius},
PDF = {https://hal.archives-ouvertes.fr/hal-03225353/file/radius123.pdf},
HAL_ID = {hal-03225353},
HAL_VERSION = {v1},
}
-
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.
@techreport{bensmail:hal-03262227,
TITLE = {{The Vertex-Capturing Game}},
AUTHOR = {Bensmail, Julien and Mc Inerney, Fionn},
URL = {https://hal.archives-ouvertes.fr/hal-03262227},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} C{\^o}te d'Azur ; CISPA Helmholtz Center for Information Security}},
YEAR = {2021},
KEYWORDS = {scoring game ; combinatorial game ; 2-player game ; graph},
PDF = {https://hal.archives-ouvertes.fr/hal-03262227/file/main.pdf},
HAL_ID = {hal-03262227},
HAL_VERSION = {v1},
}
-
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.
@techreport{coudert:hal-03264788,
TITLE = {{On finding $k$ earliest arrival time journeys in public transit networks}},
AUTHOR = {Coudert, David and Al Zoobi, Ali and Finkelstein, Arthur},
URL = {https://hal.archives-ouvertes.fr/hal-03264788},
TYPE = {Research Report},
INSTITUTION = {{Inria}},
YEAR = {2021},
MONTH = Jun,
KEYWORDS = {Journey planning ; shortest path ; routing ; timetables},
PDF = {https://hal.archives-ouvertes.fr/hal-03264788/file/Multimod_kssp_Hal.pdf},
HAL_ID = {hal-03264788},
HAL_VERSION = {v1},
}
-
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.
@techreport{coudert:hal-03201405,
TITLE = {{Enumeration of far-apart pairs by decreasing distance for faster hyperbolicity computation}},
AUTHOR = {Coudert, David and Nusser, Andr{\'e} and Viennot, Laurent},
URL = {https://hal.inria.fr/hal-03201405},
TYPE = {Research Report},
INSTITUTION = {{Inria ; I3S, Universit{\'e} C{\^o}te d'Azur}},
YEAR = {2021},
MONTH = Apr,
KEYWORDS = {Gromov hyperbolicity ; Graph algorithms ; Far-apart pairs ; Enumeration algorithms},
PDF = {https://hal.inria.fr/hal-03201405/file/main-hal.pdf},
HAL_ID = {hal-03201405},
HAL_VERSION = {v1},
}
-
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
]
@techreport{damore:hal-03479582,
TITLE = {{Planning with Biological Neurons and Synapses}},
AUTHOR = {d'Amore, Francesco and Mitropolsky, Daniel and Crescenzi, Pierluigi and Natale, Emanuele and Papadimitriou, Christos H},
URL = {https://hal.archives-ouvertes.fr/hal-03479582},
NOTE = {To appear in AAAI 2022},
TYPE = {Research Report},
INSTITUTION = {{Inria \& Universit{\'e} Cote d'Azur, CNRS, I3S, Sophia Antipolis, France ; Gran Sasso Science Institute (L'Aquila, Italie) ; Department of Computer Science, Columbia University, New York}},
YEAR = {2021},
MONTH = Dec,
PDF = {https://hal.archives-ouvertes.fr/hal-03479582v2/file/Planning_in_AC.pdf},
HAL_ID = {hal-03479582},
HAL_VERSION = {v2},
}
-
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.
@techreport{damore:hal-03467403,
TITLE = {{Phase Transition of the 3-Majority Dynamics with Uniform Communication Noise}},
AUTHOR = {d'Amore, Francesco and Ziccardi, Isabella},
URL = {https://hal.archives-ouvertes.fr/hal-03467403},
TYPE = {Research Report},
INSTITUTION = {{Inria \& Universit{\'e} Cote d'Azur, CNRS, I3S, Sophia Antipolis, France ; Universit{\`a} degli Studi dell'Aquila}},
YEAR = {2021},
MONTH = Dec,
KEYWORDS = {Opinion Dynamics ; Uniform Communication Noise ; Consensus Problem ; Distributed Computing ; Randomized Algorithms},
PDF = {https://hal.archives-ouvertes.fr/hal-03467403v2/file/3maj.pdf},
HAL_ID = {hal-03467403},
HAL_VERSION = {v2},
}
-
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
]
@techreport{dacunha:hal-03157141,
TITLE = {{Neural Network Information Leakage through Hidden Learning}},
AUTHOR = {Da Cunha, Arthur and Natale, Emanuele and Viennot, Laurent},
URL = {https://hal.archives-ouvertes.fr/hal-03157141},
TYPE = {Research Report},
INSTITUTION = {{Inria ; CNRS ; I3S ; Universit{\'e} C{\^o}te d'Azur}},
YEAR = {2021},
PDF = {https://hal.archives-ouvertes.fr/hal-03157141/file/hidden_learning.pdf},
HAL_ID = {hal-03157141},
HAL_VERSION = {v1},
}
-
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.
@techreport{dilena:hal-03132873,
TITLE = {{Placement Module for Distributed SDN/NFV Network Emulation}},
AUTHOR = {Di Lena, Giuseppe and Tomassilli, Andrea and Giroire, Fr{\'e}d{\'e}ric and Saucez, Damien and Turletti, Thierry and Lac, Chidung},
URL = {https://hal.inria.fr/hal-03132873},
TYPE = {Research Report},
NUMBER = {RR-9391},
PAGES = {32},
INSTITUTION = {{Inria Sophia Antipolis - M{\'e}diterran{\'e}e ; I3S, Universit{\'e} C{\^o}te d'Azur ; Orange Labs R\&D [Lannion] (France T{\'e}l{\'e}com)}},
YEAR = {2021},
MONTH = Feb,
KEYWORDS = {Virtualization ; Emulation ; Placement ; Approximation algorithms ; Virtualisation r{\'e}seau ; Emulation distribu{\'e}e ; Algorithmes de placement},
PDF = {https://hal.inria.fr/hal-03132873/file/DistrinetPlacement_Long_version-10.pdf},
HAL_ID = {hal-03132873},
HAL_VERSION = {v1},
}
-
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.
@techreport{fioravantes:hal-03358273,
TITLE = {{Complexity of Finding Maximum Locally Irregular Induced Subgraphs}},
AUTHOR = {Fioravantes, Foivos and Melissinos, Nikolaos and Triommatis, Theofilos},
URL = {https://hal.archives-ouvertes.fr/hal-03358273},
TYPE = {Research Report},
INSTITUTION = {{Inria ; I3S ; Universit{\'e} C{\^o}te d'Azur}},
YEAR = {2021},
MONTH = Sep,
KEYWORDS = {FPT ; largest induced subgraph ; Locally irregular ; treewidth ; W-hardness},
PDF = {https://hal.archives-ouvertes.fr/hal-03358273/file/Largest_locally_irregular_induced_subgraph%29.pdf},
HAL_ID = {hal-03358273},
HAL_VERSION = {v1},
}
-
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.
@techreport{giroire:hal-03154836,
TITLE = {{Preferential attachment hypergraph with high modularity}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and Nisse, Nicolas and Trolliet, Thibaud and Sulkowska, Malgorzata},
URL = {https://hal.archives-ouvertes.fr/hal-03154836},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} Cote d'Azur}},
YEAR = {2021},
KEYWORDS = {Complex network ; Hypergraph ; Preferential attachment ; Modularity},
PDF = {https://hal.archives-ouvertes.fr/hal-03154836/file/Projet_SNIF___Hypergraph_Model_with_Modularity%29.pdf},
HAL_ID = {hal-03154836},
HAL_VERSION = {v1},
}
-
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.
@techreport{havet:hal-03472923,
TITLE = {{Spanning eulerian subdigraphs in semicomplete digraphs}},
AUTHOR = {Havet, Fr{\'e}d{\'e}ric and Bang-Jensen, J{{\o}}rgen and Yeo, Anders},
URL = {https://hal.inria.fr/hal-03472923},
TYPE = {Research Report},
INSTITUTION = {{Inria ; CNRS ; I3S ; Universit{\'e} c{\^o}te d'azur}},
YEAR = {2021},
MONTH = Dec,
KEYWORDS = {Arc-connectivity ; Eulerian subdigraph ; Tournament ; Semicomplete digraph ; polynomial algorithm},
PDF = {https://hal.inria.fr/hal-03472923/file/supereulerian-revise.pdf},
HAL_ID = {hal-03472923},
HAL_VERSION = {v1},
}
-
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
]
@techreport{havet:hal-03368214,
TITLE = {{On the complexity of overlaying a hypergraph with a graph with bounded maximum degree}},
AUTHOR = {Havet, Fr{\'e}d{\'e}ric and Mazauric, Dorian and Nguyen, Viet-Ha},
URL = {https://hal.inria.fr/hal-03368214},
TYPE = {Research Report},
INSTITUTION = {{Inria ; CNRS ; I3S ; Universit{\'e} C{\^o}te d'Azur}},
YEAR = {2021},
PDF = {https://hal.inria.fr/hal-03368214v2/file/article_appendice.pdf},
HAL_ID = {hal-03368214},
HAL_VERSION = {v2},
}
-
Viet-Ha Nguyen and Kévin Perrot.
Rikudo is NP-complete.
Research Report,
Inria ; Université Côte d'Azur ; I3S ; CNRS,
2021.
[WWW
]
@techreport{nguyen:hal-03512769,
TITLE = {{Rikudo is NP-complete}},
AUTHOR = {Nguyen, Viet-Ha and Perrot, K{\'e}vin},
URL = {https://hal.inria.fr/hal-03512769},
TYPE = {Research Report},
INSTITUTION = {{Inria ; Universit{\'e} C{\^o}te d'Azur ; I3S ; CNRS}},
YEAR = {2021},
HAL_ID = {hal-03512769},
HAL_VERSION = {v1},
}
-
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
]
@techreport{sulkowska:hal-03462575,
TITLE = {{Counting embeddings of rooted trees into families of rooted trees}},
AUTHOR = {Sulkowska, Malgorzata and Gittenberger, Bernhard and GolÄbiewski, Zbigniew and Larcher, Isabella},
URL = {https://hal.archives-ouvertes.fr/hal-03462575},
NOTE = {20 pages, 6 figures},
TYPE = {Research Report},
INSTITUTION = {{Combinatorics, Optimization and Algorithms for Telecommunications [researchteam] (211142) ; Wroclaw University of Science and Technology ; Technische Universit{\"a}t Wien}},
YEAR = {2021},
MONTH = Sep,
PDF = {https://hal.archives-ouvertes.fr/hal-03462575/file/tree_embeddings.pdf},
HAL_ID = {hal-03462575},
HAL_VERSION = {v1},
}
-
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
]
@techreport{sulkowska:hal-03462375,
TITLE = {{Running minimum in the best-choice problem}},
AUTHOR = {Sulkowska, Malgorzata and Gnedin, Alexander and Koziel, Patryk},
URL = {https://hal.archives-ouvertes.fr/hal-03462375},
NOTE = {22 pages, 9 figures},
TYPE = {Research Report},
INSTITUTION = {{Wroclaw University of Science and Technology ; University of London, Queen Mary ; Combinatorics, Optimization and Algorithms for Telecommunications [researchteam] (211142)}},
YEAR = {2021},
MONTH = Oct,
PDF = {https://hal.archives-ouvertes.fr/hal-03462375/file/HittingTimes.pdf},
HAL_ID = {hal-03462375},
HAL_VERSION = {v1},
}
-
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
]
@techreport{sulkowska:hal-03462572,
TITLE = {{What Do Our Choices Say About Our Preferences?}},
AUTHOR = {Sulkowska, Malgorzata and Grining, Krzysztof and Klonowski, Marek},
URL = {https://hal.archives-ouvertes.fr/hal-03462572},
NOTE = {22 pages, 6 figures},
TYPE = {Research Report},
INSTITUTION = {{Combinatorics, Optimization and Algorithms for Telecommunications [researchteam] (211142) ; Wroclaw University of Science and Technology}},
YEAR = {2021},
MONTH = Jun,
PDF = {https://hal.archives-ouvertes.fr/hal-03462572/file/main.pdf},
HAL_ID = {hal-03462572},
HAL_VERSION = {v1},
}
-
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
]
@techreport{sulkowska:hal-03462570,
TITLE = {{Modularity of minor-free graphs}},
AUTHOR = {Sulkowska, Malgorzata and Laso{\'n}, Michal},
URL = {https://hal.archives-ouvertes.fr/hal-03462570},
NOTE = {7 pages, 1 figure},
TYPE = {Research Report},
INSTITUTION = {{Combinatorics, Optimization and Algorithms for Telecommunications [researchteam] (211142) ; Institute of Mathematics of the Polish Academy of Sciences ; Wroclaw University of Science and Technology}},
YEAR = {2021},
MONTH = Feb,
PDF = {https://hal.archives-ouvertes.fr/hal-03462570/file/modularity.pdf},
HAL_ID = {hal-03462570},
HAL_VERSION = {v1},
}
