-
Ron Aharoni,
Eli Berger,
Maria Chudnovsky,
Frédéric Havet,
and Zilin Jiang.
Cooperative colorings of trees and of bipartite graphs.
The Electronic Journal of Combinatorics,
February 2020.
[WWW
] [PDF
]
@article{aharoni:hal-02497425,
TITLE = {{Cooperative colorings of trees and of bipartite graphs}},
AUTHOR = {Aharoni, Ron and Berger, Eli and Chudnovsky, Maria and Havet, Fr{\'e}d{\'e}ric and Jiang, Zilin},
URL = {https://hal.inria.fr/hal-02497425},
JOURNAL = {{The Electronic Journal of Combinatorics}},
PUBLISHER = {{Open Journal Systems}},
YEAR = {2020},
MONTH = Feb,
PDF = {https://hal.inria.fr/hal-02497425/file/ejc-cooperative_coloring.pdf},
HAL_ID = {hal-02497425},
HAL_VERSION = {v1},
}
-
Luca Becchetti,
Andrea Clementi,
Emanuele Natale,
Francesco Pasquale,
and Luca Trevisan.
Find Your Place: Simple Distributed Algorithms for Community Detection.
SIAM Journal on Computing,
49(4):821-864,
January 2020.
[WWW
] [PDF
]
Keywords:
Distributed Algorithms,
Averaging Dynamics,
Community Detection,
Spectral Analysis,
Stochastic Block Models.
@article{becchetti:hal-03025943,
TITLE = {{Find Your Place: Simple Distributed Algorithms for Community Detection}},
AUTHOR = {Becchetti, Luca and Clementi, Andrea and Natale, Emanuele and Pasquale, Francesco and Trevisan, Luca},
URL = {https://hal.archives-ouvertes.fr/hal-03025943},
JOURNAL = {{SIAM Journal on Computing}},
PUBLISHER = {{Society for Industrial and Applied Mathematics}},
VOLUME = {49},
NUMBER = {4},
PAGES = {821-864},
YEAR = {2020},
MONTH = Jan,
DOI = {10.1137/19M1243026},
KEYWORDS = {Distributed Algorithms ; Averaging Dynamics ; Community Detection ; Spectral Analysis ; Stochastic Block Models},
PDF = {https://hal.archives-ouvertes.fr/hal-03025943/file/find_your_place_preprint.pdf},
HAL_ID = {hal-03025943},
HAL_VERSION = {v1},
}
-
Luca Becchetti,
Andrea Clementi,
and Emanuele Natale.
Consensus Dynamics: An Overview.
ACM SIGACT News,
51(1):57,
March 2020.
Note: Distributed Computing Column 77.
[WWW
] [PDF
]
Keywords:
distributed computing,
computational dynamics.
@article{becchetti:hal-02507613,
TITLE = {{Consensus Dynamics: An Overview}},
AUTHOR = {Becchetti, Luca and Clementi, Andrea and Natale, Emanuele},
URL = {https://hal.archives-ouvertes.fr/hal-02507613},
NOTE = {Distributed Computing Column 77},
JOURNAL = {{ACM SIGACT News}},
PUBLISHER = {{Association for Computing Machinery (ACM)}},
VOLUME = {51},
NUMBER = {1},
PAGES = {57},
YEAR = {2020},
MONTH = Mar,
DOI = {10.1145/3388392.3388402},
KEYWORDS = {distributed computing ; computational dynamics},
PDF = {https://hal.archives-ouvertes.fr/hal-02507613/file/preprint_Dynamics_Survey.pdf},
HAL_ID = {hal-02507613},
HAL_VERSION = {v1},
}
-
Luca Becchetti,
Emilio Cruciani,
Francesco Pasquale,
and Sara Rizzo.
Step-by-step community detection in volume-regular graphs.
Theoretical Computer Science,
847:49-67,
December 2020.
[WWW
] [PDF
]
Keywords:
Community detection,
Distributed algorithms,
Dynamics,
Markov chains,
Spectral analysis.
@article{becchetti:hal-03007156,
TITLE = {{Step-by-step community detection in volume-regular graphs}},
AUTHOR = {Becchetti, Luca and Cruciani, Emilio and Pasquale, Francesco and Rizzo, Sara},
URL = {https://hal.archives-ouvertes.fr/hal-03007156},
JOURNAL = {{Theoretical Computer Science}},
PUBLISHER = {{Elsevier}},
VOLUME = {847},
PAGES = {49-67},
YEAR = {2020},
MONTH = Dec,
DOI = {10.1016/j.tcs.2020.09.036},
KEYWORDS = {Community detection ; Distributed algorithms ; Dynamics ; Markov chains ; Spectral analysis},
PDF = {https://hal.archives-ouvertes.fr/hal-03007156/file/1907.07149.pdf},
HAL_ID = {hal-03007156},
HAL_VERSION = {v1},
}
-
Julien Bensmail,
François Dross,
Hervé Hocquard,
and Eric Sopena.
From light edges to strong edge-colouring of 1-planar graphs.
Discrete Mathematics and Theoretical Computer Science,
vol. 22 no. 1(2),
January 2020.
[WWW
] [PDF
]
Keywords:
1-planar graphs,
Light edges,
Strong edge-colouring,
Strong chromatic index.
@article{bensmail:hal-02112188,
TITLE = {{From light edges to strong edge-colouring of 1-planar graphs}},
AUTHOR = {Bensmail, Julien and Dross, Fran{\c c}ois and Hocquard, Herv{\'e} and Sopena, Eric},
URL = {https://hal.archives-ouvertes.fr/hal-02112188},
JOURNAL = {{Discrete Mathematics and Theoretical Computer Science}},
PUBLISHER = {{DMTCS}},
VOLUME = {vol. 22 no. 1},
NUMBER = {2},
YEAR = {2020},
MONTH = Jan,
KEYWORDS = {1-planar graphs ; Light edges ; Strong edge-colouring ; Strong chromatic index},
PDF = {https://hal.archives-ouvertes.fr/hal-02112188v3/file/1planar-strong.pdf},
HAL_ID = {hal-02112188},
HAL_VERSION = {v3},
}
-
Julien Bensmail,
François Dross,
and Nicolas Nisse.
Decomposing degenerate graphs into locally irregular subgraphs.
Graphs and Combinatorics,
36(6):1869--1889,
2020.
[WWW
] [PDF
]
Keywords:
planar graphs,
k-trees,
locally irregular decompositions,
degenerate graphs,
cacti.
@article{bensmail:hal-02090804,
TITLE = {{Decomposing degenerate graphs into locally irregular subgraphs}},
AUTHOR = {Bensmail, Julien and Dross, Fran{\c c}ois and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-02090804},
JOURNAL = {{Graphs and Combinatorics}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {36},
NUMBER = {6},
PAGES = {1869--1889},
YEAR = {2020},
KEYWORDS = {planar graphs ; k-trees ; locally irregular decompositions ; degenerate graphs ; cacti},
PDF = {https://hal.archives-ouvertes.fr/hal-02090804v3/file/irregular-degenerate.pdf},
HAL_ID = {hal-02090804},
HAL_VERSION = {v3},
}
-
Julien Bensmail,
Bi Li,
and Binlong Li.
An injective version of the 1-2-3 Conjecture.
Graphs and Combinatorics,
2020.
[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}},
INSTITUTION = {{Universit{\'e} c{\^o}te d'azur}},
YEAR = {2020},
PDF = {https://hal.archives-ouvertes.fr/hal-02459377/file/injective123c.pdf},
HAL_ID = {hal-02459377},
HAL_VERSION = {v1},
}
-
Julien Bensmail and Binlong Li.
More Aspects of Arbitrarily Partitionable Graphs.
Discussiones Mathematicae Graph Theory,
2020.
[WWW
] [PDF
]
Keywords:
arbitrarily partitionable graphs,
partition into connected subgraphs,
Hamiltonicity.
@article{bensmail:hal-01915633,
TITLE = {{More Aspects of Arbitrarily Partitionable Graphs}},
AUTHOR = {Bensmail, Julien and Li, Binlong},
URL = {https://hal.archives-ouvertes.fr/hal-01915633},
JOURNAL = {{Discussiones Mathematicae Graph Theory}},
PUBLISHER = {{University of Zielona G{\'o}ra}},
YEAR = {2020},
KEYWORDS = {arbitrarily partitionable graphs ; partition into connected subgraphs ; Hamiltonicity},
PDF = {https://hal.archives-ouvertes.fr/hal-01915633v2/file/moreAP.pdf},
HAL_ID = {hal-01915633},
HAL_VERSION = {v2},
}
-
Julien Bensmail and Kasper Lyngsie.
1-2-3 Conjecture in Digraphs: More Results and Directions.
Discrete Applied Mathematics,
284:124-137,
2020.
[WWW
] [PDF
]
Keywords:
Choosability,
Complexity,
1-2-3 Conjecture,
Directed variants,
Bounds.
@article{bensmail:hal-02269482,
TITLE = {{1-2-3 Conjecture in Digraphs: More Results and Directions}},
AUTHOR = {Bensmail, Julien and Lyngsie, Kasper},
URL = {https://hal.archives-ouvertes.fr/hal-02269482},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
VOLUME = {284},
PAGES = {124-137},
YEAR = {2020},
KEYWORDS = {Choosability ; Complexity ; 1-2-3 Conjecture ; Directed variants ; Bounds},
PDF = {https://hal.archives-ouvertes.fr/hal-02269482v2/file/inverse-luczak.pdf},
HAL_ID = {hal-02269482},
HAL_VERSION = {v2},
}
-
Julien Bensmail,
Dorian Mazauric,
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Sequential Metric Dimension.
Algorithmica,
82(10):2867-2901,
2020.
[WWW
] [PDF
]
Keywords:
Complexity,
Metric dimension,
Games in graphs.
@article{bensmail:hal-01717629,
TITLE = {{Sequential Metric Dimension}},
AUTHOR = {Bensmail, Julien and Mazauric, Dorian and Mc Inerney, Fionn and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.archives-ouvertes.fr/hal-01717629},
JOURNAL = {{Algorithmica}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {82},
NUMBER = {10},
PAGES = {2867-2901},
YEAR = {2020},
KEYWORDS = {Complexity ; Metric dimension ; Games in graphs},
PDF = {https://hal.archives-ouvertes.fr/hal-01717629v3/file/seq_metric_dim_Algorithmica_with_corrections.pdf},
HAL_ID = {hal-01717629},
HAL_VERSION = {v3},
}
-
Julien Bensmail and Fionn Mc Inerney.
On Generalisations of the AVD Conjecture to Digraphs.
Graphs and Combinatorics,
2020.
[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}},
YEAR = {2020},
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},
}
-
Julien Bensmail,
Fionn Mc Inerney,
and Nicolas Nisse.
Metric Dimension: from Graphs to Oriented Graphs.
Discrete Applied Mathematics,
2020.
[WWW
] [PDF
]
Keywords:
Strongly-connected orientations,
Metric dimension,
Resolving sets.
@article{bensmail:hal-01938290,
TITLE = {{Metric Dimension: from Graphs to Oriented Graphs}},
AUTHOR = {Bensmail, Julien and Mc Inerney, Fionn and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-01938290},
JOURNAL = {{Discrete Applied Mathematics}},
PUBLISHER = {{Elsevier}},
YEAR = {2020},
KEYWORDS = {Strongly-connected orientations ; Metric dimension ; Resolving sets},
PDF = {https://hal.inria.fr/hal-01938290v3/file/ori_md_DAM_version_HAL.pdf},
HAL_ID = {hal-01938290},
HAL_VERSION = {v3},
}
-
Julien Bensmail,
Soumen Nandi,
Mithun Roy,
and Sagnik Sen.
Classification of edge-critical underlying absolute planar cliques for signed graphs.
The Australasian Journal of Combinatorics,
77(1):117-135,
June 2020.
[WWW
] [PDF
]
Keywords:
planar graphs,
absolute cliques,
signed graphs,
graph homomorphisms.
@article{bensmail:hal-01919007,
TITLE = {{Classification of edge-critical underlying absolute planar cliques for signed graphs}},
AUTHOR = {Bensmail, Julien and Nandi, Soumen and Roy, Mithun and Sen, Sagnik},
URL = {https://hal.archives-ouvertes.fr/hal-01919007},
JOURNAL = {{The Australasian Journal of Combinatorics}},
PUBLISHER = {{Combinatorial Mathematics Society of Australasia (Inc.)}},
VOLUME = {77},
NUMBER = {1},
PAGES = {117-135},
YEAR = {2020},
MONTH = Jun,
KEYWORDS = {planar graphs ; absolute cliques ; signed graphs ; graph homomorphisms},
PDF = {https://hal.archives-ouvertes.fr/hal-01919007v2/file/BNRS_revision2_v1.pdf},
HAL_ID = {hal-01919007},
HAL_VERSION = {v2},
}
-
Jean-Claude Bermond,
Dorian Mazauric,
Vishal Misra,
and Philippe Nain.
Distributed Link Scheduling in Wireless Networks.
Discrete Mathematics, Algorithms and Applications,
12(5):1-38,
2020.
[WWW
] [PDF
]
Keywords:
Stability,
Distributed algorithm,
Wireless network,
Link scheduling algorithm,
Binary interference,
Graph.
@article{bermond:hal-01977266,
TITLE = {{Distributed Link Scheduling in Wireless Networks}},
AUTHOR = {Bermond, Jean-Claude and Mazauric, Dorian and Misra, Vishal and Nain, Philippe},
URL = {https://hal.inria.fr/hal-01977266},
JOURNAL = {{Discrete Mathematics, Algorithms and Applications}},
PUBLISHER = {{World Scientific Publishing}},
VOLUME = {12},
NUMBER = {5},
PAGES = {1-38},
YEAR = {2020},
DOI = {10.1142/S1793830920500585},
KEYWORDS = {Stability ; Distributed algorithm ; Wireless network ; Link scheduling algorithm ; Binary interference ; Graph},
PDF = {https://hal.inria.fr/hal-01977266v2/file/sans-format.pdf},
HAL_ID = {hal-01977266},
HAL_VERSION = {v2},
}
-
Nathann Cohen,
Fionn Mc Inerney,
Nicolas Nisse,
and Stéphane Pérennes.
Study of a Combinatorial Game in Graphs Through Linear Programming.
Algorithmica,
82(2):212-244,
2020.
[WWW
] [PDF
]
Keywords:
Grid,
Tree,
Linear Programming,
Domination,
Graphs,
Spy game,
Cops and Robber games.
@article{cohen:hal-01881473,
TITLE = {{Study of a Combinatorial Game in Graphs Through Linear Programming}},
AUTHOR = {Cohen, Nathann and Mc Inerney, Fionn and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.archives-ouvertes.fr/hal-01881473},
JOURNAL = {{Algorithmica}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {82},
NUMBER = {2},
PAGES = {212-244},
YEAR = {2020},
DOI = {10.1007/s00453-018-0503-9},
KEYWORDS = {Grid ; Tree ; Linear Programming ; Domination ; Graphs ; Spy game ; Cops and Robber games},
PDF = {https://hal.archives-ouvertes.fr/hal-01881473/file/spygame_trees_grids_July18.pdf},
HAL_ID = {hal-01881473},
HAL_VERSION = {v1},
}
-
Ali Dehghan and Frédéric Havet.
On the semi-proper orientations of graphs.
Discrete Applied Mathematics,
March 2020.
[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}},
YEAR = {2020},
MONTH = Mar,
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},
}
-
Guillaume Ducoffe,
Sylvain Legay,
and Nicolas Nisse.
On the Complexity of Computing Treebreadth.
Algorithmica,
82(6):1574-1600,
2020.
[WWW
] [PDF
]
@article{ducoffe:hal-02528905,
TITLE = {{On the Complexity of Computing Treebreadth}},
AUTHOR = {Ducoffe, Guillaume and Legay, Sylvain and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-02528905},
JOURNAL = {{Algorithmica}},
PUBLISHER = {{Springer Verlag}},
VOLUME = {82},
NUMBER = {6},
PAGES = {1574-1600},
YEAR = {2020},
DOI = {10.1007/s00453-019-00657-7},
PDF = {https://hal.inria.fr/hal-02528905/file/DLN-AlgorithmicaRevised_submitted.pdf},
HAL_ID = {hal-02528905},
HAL_VERSION = {v1},
}
-
Alizée Gagnon,
Alexander Hassler,
Jerry Huang,
Aaron Krim-Yee,
Fionn Mc Inerney,
Andrés Mejìa Zacarìas,
Ben Seamone,
and Virgélot Virgile.
A method for eternally dominating strong grids.
Discrete Mathematics and Theoretical Computer Science,
vol. 22(1),
March 2020.
[WWW
] [PDF
]
Keywords:
Graphs,
Graph Protection,
Eternal Domination,
Combinatorial Games.
@article{gagnon:hal-02004770,
TITLE = {{A method for eternally dominating strong grids}},
AUTHOR = {Gagnon, Aliz{\'e}e and Hassler, Alexander and Huang, Jerry and Krim-Yee, Aaron and Mc Inerney, Fionn and Zacar{\'i}as, Andr{\'e}s Mej{\'i}a and Seamone, Ben and Virgile, Virg{\'e}lot},
URL = {https://hal.archives-ouvertes.fr/hal-02004770},
JOURNAL = {{Discrete Mathematics and Theoretical Computer Science}},
PUBLISHER = {{DMTCS}},
VOLUME = {vol. 22},
NUMBER = {1},
YEAR = {2020},
MONTH = Mar,
KEYWORDS = {Graphs ; Graph Protection ; Eternal Domination ; Combinatorial Games},
PDF = {https://hal.archives-ouvertes.fr/hal-02004770v3/file/final.pdf},
HAL_ID = {hal-02004770},
HAL_VERSION = {v3},
}
-
Frédéric Havet,
Bruce Reed,
Maya Stein,
and David R Wood.
A variant of the Erdös-Sós conjecture.
Journal of Graph Theory,
94(1):131-158,
May 2020.
[WWW
] [PDF
]
@article{havet:hal-02497401,
TITLE = {{A variant of the Erd{\"o}s-S{\'o}s conjecture}},
AUTHOR = {Havet, Fr{\'e}d{\'e}ric and Reed, Bruce and Stein, Maya and Wood, David R},
URL = {https://hal.inria.fr/hal-02497401},
JOURNAL = {{Journal of Graph Theory}},
PUBLISHER = {{Wiley}},
VOLUME = {94},
NUMBER = {1},
PAGES = {131-158},
YEAR = {2020},
MONTH = May,
DOI = {10.1002/jgt.22511},
PDF = {https://hal.inria.fr/hal-02497401/file/ErdosSosVariant.pdf},
HAL_ID = {hal-02497401},
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,
2020.
[WWW
] [PDF
]
Keywords:
King's graph,
Strong grid,
Cartesian grid,
Grids,
Graphs,
Eternal Domination,
Combinatorial Games.
@article{mcinerney:hal-02801932,
TITLE = {{Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between}},
AUTHOR = {Mc Inerney, Fionn and Nisse, Nicolas and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.inria.fr/hal-02801932},
TYPE = {Research Report},
JOURNAL = {{Algorithmica}},
PUBLISHER = {{Springer Verlag}},
INSTITUTION = {{Inria \& Universit{\'e} Cote d'Azur, CNRS, I3S, Sophia Antipolis, France ; Aix-Marseille Universite}},
YEAR = {2020},
KEYWORDS = {King's graph ; Strong grid ; Cartesian grid ; Grids ; Graphs ; Eternal Domination ; Combinatorial Games},
PDF = {https://hal.inria.fr/hal-02801932/file/eter_dom_grids_journal.pdf},
HAL_ID = {hal-02801932},
HAL_VERSION = {v1},
}
-
Mohammad Abouei Mehrizi,
Federico Corò,
Emilio Cruciani,
and Gianlorenzo DâAngelo.
Election Control Through Social Influence with Unknown Preferences.
In COCOON 2020 - 26th International Conference on Computing and Combinatorics,
Atlanta / Online, United States,
pages 397-410,
August 2020.
[WWW
] [PDF
]
@inproceedings{aboueimehrizi:hal-03007175,
TITLE = {{Election Control Through Social Influence with Unknown Preferences}},
AUTHOR = {Abouei Mehrizi, Mohammad and Cor{\`o}, Federico and Cruciani, Emilio and DâAngelo, Gianlorenzo},
URL = {https://hal.archives-ouvertes.fr/hal-03007175},
BOOKTITLE = {{COCOON 2020 - 26th International Conference on Computing and Combinatorics}},
ADDRESS = {Atlanta / Online, United States},
PAGES = {397-410},
YEAR = {2020},
MONTH = Aug,
DOI = {10.1007/978-3-030-58150-3\_32},
PDF = {https://hal.archives-ouvertes.fr/hal-03007175/file/1905.04694.pdf},
HAL_ID = {hal-03007175},
HAL_VERSION = {v1},
}
-
Ali Al Zoobi,
David Coudert,
and Nicolas Nisse.
Space and Time Trade-Off for the k Shortest Simple Paths Problem.
In SEA 2020 - 18th International Symposium on Experimental Algorithms,
volume 160 of Leibniz International Proceedings in Informatics (LIPIcs),
Catania, Italy,
pages 13,
June 2020.
Schloss Dagstuhl--Leibniz-Zentrum f'ur Informatik.
[WWW
] [PDF
]
Keywords:
k shortest simple paths,
graph algorithm,
space-time trade-off.
@inproceedings{alzoobi:hal-02865918,
TITLE = {{Space and Time Trade-Off for the k Shortest Simple Paths Problem}},
AUTHOR = {Al Zoobi , Ali and Coudert, David and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-02865918},
BOOKTITLE = {{SEA 2020 - 18th International Symposium on Experimental Algorithms}},
ADDRESS = {Catania, Italy},
PUBLISHER = {{Schloss Dagstuhl--Leibniz-Zentrum f{\''u}r Informatik}},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {160},
NUMBER = {18},
PAGES = {13},
YEAR = {2020},
MONTH = Jun,
DOI = {10.4230/LIPIcs.SEA.2020.18},
KEYWORDS = {k shortest simple paths ; graph algorithm ; space-time trade-off},
PDF = {https://hal.inria.fr/hal-02865918/file/LIPIcs-SEA-2020-18.pdf},
HAL_ID = {hal-02865918},
HAL_VERSION = {v1},
}
-
Ali Al Zoobi,
David Coudert,
and Nicolas Nisse.
Compromis espace-temps pour le problème de k plus courts chemins simples.
In ALGOTEL 2020 -- 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
Lyon, France,
pages 4,
September 2020.
[WWW
] [PDF
]
Keywords:
k plus courts chemins simples,
algorithmes de graphes,
compromis complexité espace-temps.
@inproceedings{alzoobi:hal-02835953,
TITLE = {{Compromis espace-temps pour le probl{\`e}me de k plus courts chemins simples}},
AUTHOR = {Al Zoobi, Ali and Coudert, David and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-02835953},
BOOKTITLE = {{ALGOTEL 2020 -- 22{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Lyon, France},
PAGES = {4},
YEAR = {2020},
MONTH = Sep,
KEYWORDS = {k plus courts chemins simples ; algorithmes de graphes ; compromis complexit{\'e} espace-temps},
PDF = {https://hal.inria.fr/hal-02835953/file/algotel-FinalVersion.pdf},
HAL_ID = {hal-02835953},
HAL_VERSION = {v1},
}
-
Aris Anagnostopoulos,
Luca Becchetti,
Emilio Cruciani,
Francesco Pasquale,
and Sara Rizzo.
Biased Opinion Dynamics: When the Devil is in the Details.
In IJCAI 2020 - 29th International Joint Conference on Artificial Intelligence,
Yokohama, Japan,
pages 53-59,
July 2020.
International Joint Conferences on Artificial Intelligence Organization.
[WWW
] [PDF
]
@inproceedings{anagnostopoulos:hal-03007205,
TITLE = {{Biased Opinion Dynamics: When the Devil is in the Details}},
AUTHOR = {Anagnostopoulos, Aris and Becchetti, Luca and Cruciani, Emilio and Pasquale, Francesco and Rizzo, Sara},
URL = {https://hal.archives-ouvertes.fr/hal-03007205},
BOOKTITLE = {{IJCAI 2020 - 29th International Joint Conference on Artificial Intelligence}},
ADDRESS = {Yokohama, Japan},
PUBLISHER = {{International Joint Conferences on Artificial Intelligence Organization}},
PAGES = {53-59},
YEAR = {2020},
MONTH = Jul,
DOI = {10.24963/ijcai.2020/8},
PDF = {https://hal.archives-ouvertes.fr/hal-03007205/file/2008.13589.pdf},
HAL_ID = {hal-03007205},
HAL_VERSION = {v1},
}
-
Alan Arroyo,
Julien Bensmail,
and R. Bruce Richter.
Extending Drawings of Graphs to Arrangements of Pseudolines.
In SoCG 2020 - 36th International Symposium on Computational Geometry,
Zürich, Switzerland,
June 2020.
[WWW
] [PDF
]
Keywords:
graph drawings,
geometric graph drawings,
arrangements of pseudolines,
crossing numbers,
stretchability,
graphs.
@inproceedings{arroyo:hal-02471760,
TITLE = {{Extending Drawings of Graphs to Arrangements of Pseudolines}},
AUTHOR = {Arroyo, Alan and Bensmail, Julien and Richter, R. Bruce},
URL = {https://hal.archives-ouvertes.fr/hal-02471760},
BOOKTITLE = {{SoCG 2020 - 36th International Symposium on Computational Geometry}},
ADDRESS = {Z{\"u}rich, Switzerland},
YEAR = {2020},
MONTH = Jun,
KEYWORDS = {graph drawings ; geometric graph drawings ; arrangements of pseudolines ; crossing numbers ; stretchability ; graphs},
PDF = {https://hal.archives-ouvertes.fr/hal-02471760/file/main.pdf},
HAL_ID = {hal-02471760},
HAL_VERSION = {v1},
}
-
Jorgen Bang-Jensen,
Jonas Costa Ferreira Da Silva,
and Frédéric Havet.
Inversion number of an oriented graph and related parameters.
In ALGOS 2020 - 1st International Conference on Algebras, Graphs and Ordered Sets,
Nancy / Virtual, France,
August 2020.
[WWW
] [PDF
]
Keywords:
Feedback vertex set,
Feedback arc set,
Inversion,
Tournament,
Oriented graph,
Intercyclic digraph.
@inproceedings{bangjensen:hal-03035419,
TITLE = {{Inversion number of an oriented graph and related parameters}},
AUTHOR = {Bang-Jensen, J{{\o}}rgen and Ferreira Da Silva, Jonas Costa and Havet, Fr{\'e}d{\'e}ric},
URL = {https://hal.inria.fr/hal-03035419},
BOOKTITLE = {{ALGOS 2020 - 1st International Conference on Algebras, Graphs and Ordered Sets}},
ADDRESS = {Nancy / Virtual, France},
YEAR = {2020},
MONTH = Aug,
KEYWORDS = {Feedback vertex set ; Feedback arc set ; Inversion ; Tournament ; Oriented graph ; Intercyclic digraph},
PDF = {https://hal.inria.fr/hal-03035419/file/inversion-ALGOS.pdf},
HAL_ID = {hal-03035419},
HAL_VERSION = {v1},
}
-
Luca Becchetti,
Andrea Clementi,
Emanuele Natale,
Francesco Pasquale,
and Luca Trevisan.
Finding a Bounded-Degree Expander Inside a Dense One.
In SODA 2020 - ACM SIAM Symposium on Discrete Algorithms,
Proceedings of the thirty-first Annual ACM-SIAM Symposium on Discrete Algorithms,
Salt Lake City, United States,
January 2020.
[WWW
] [PDF
]
@inproceedings{becchetti:hal-02002377,
TITLE = {{Finding a Bounded-Degree Expander Inside a Dense One}},
AUTHOR = {Becchetti, Luca and Clementi, Andrea and Natale, Emanuele and Pasquale, Francesco and Trevisan, Luca},
URL = {https://hal.archives-ouvertes.fr/hal-02002377},
BOOKTITLE = {{SODA 2020 - ACM SIAM Symposium on Discrete Algorithms}},
ADDRESS = {Salt Lake City, United States},
SERIES = {Proceedings of the thirty-first Annual ACM-SIAM Symposium on Discrete Algorithms},
YEAR = {2020},
MONTH = Jan,
DOI = {10.1137/1.9781611975994.80},
PDF = {https://hal.archives-ouvertes.fr/hal-02002377v2/file/Finding_a_Bounded_Degree_Expander_Inside_a_Dense_One.pdf},
HAL_ID = {hal-02002377},
HAL_VERSION = {v2},
}
-
Julien Bensmail,
Foivos Fioravantes,
and Nicolas Nisse.
On Proper Labellings of Graphs with Minimum Label Sum.
In IWOCA 2020 - 31st International Workshop on Combinatorial Algorithms,
Bordeaux, France,
June 2020.
[WWW
] [PDF
]
@inproceedings{bensmail:hal-02510044,
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-02510044},
BOOKTITLE = {{IWOCA 2020 - 31st International Workshop on Combinatorial Algorithms}},
ADDRESS = {Bordeaux, France},
YEAR = {2020},
MONTH = Jun,
PDF = {https://hal.archives-ouvertes.fr/hal-02510044/file/Springer_Lecture_Notes_in_Computer_Science%29.pdf},
HAL_ID = {hal-02510044},
HAL_VERSION = {v1},
}
-
Yann Busnel,
Christelle Caillouet,
and David Coudert.
VESPA, ou l'art de coordonner une flotte de drone sans leader.
In ALGOTEL 2020 -- 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
Lyon, France,
pages 1-4,
September 2020.
[WWW
] [PDF
]
Keywords:
Drone,
Auto-organisation,
Déploiement décentralisé,
Gestion de crise,
Connectivité réseau.
@inproceedings{busnel:hal-02796530,
TITLE = {{VESPA, ou l'art de coordonner une flotte de drone sans leader}},
AUTHOR = {Busnel, Yann and Caillouet, Christelle and Coudert, David},
URL = {https://hal.inria.fr/hal-02796530},
BOOKTITLE = {{ALGOTEL 2020 -- 22{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Lyon, France},
PAGES = {1-4},
YEAR = {2020},
MONTH = Sep,
KEYWORDS = {Drone ; Auto-organisation ; D{\'e}ploiement d{\'e}centralis{\'e} ; Gestion de crise ; Connectivit{\'e} r{\'e}seau},
PDF = {https://hal.inria.fr/hal-02796530/file/vespa-algotel20.pdf},
HAL_ID = {hal-02796530},
HAL_VERSION = {v1},
}
-
Christelle Caillouet,
Martin Heusse,
and Franck Rousseau.
Optimisation de la capacité des réseaux LoRa.
In CORES 2020 -- 5ème Rencontres Francophones sur la Conception de Protocoles, lâÉvaluation de Performance et lâExpérimentation des Réseaux de Communication,
Lyon, France,
September 2020.
[WWW
] [PDF
]
@inproceedings{caillouet:hal-02877138,
TITLE = {{Optimisation de la capacit{\'e} des r{\'e}seaux LoRa}},
AUTHOR = {Caillouet, Christelle and Heusse, Martin and Rousseau, Franck},
URL = {https://hal.inria.fr/hal-02877138},
BOOKTITLE = {{CORES 2020 -- 5{\`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 = {Lyon, France},
YEAR = {2020},
MONTH = Sep,
PDF = {https://hal.inria.fr/hal-02877138/file/cores2020.pdf},
HAL_ID = {hal-02877138},
HAL_VERSION = {v1},
}
-
Christelle Caillouet,
Martin Heusse,
and Franck Rousseau.
Bringing Fairness in LoRaWAN through SF Allocation Optimization.
In ISCC 2020 - 25th IEEE Symposium on Computers and Communications,
Rennes, France,
July 2020.
[WWW
] [PDF
]
@inproceedings{caillouet:hal-02780468,
TITLE = {{Bringing Fairness in LoRaWAN through SF Allocation Optimization}},
AUTHOR = {Caillouet, Christelle and Heusse, Martin and Rousseau, Franck},
URL = {https://hal.inria.fr/hal-02780468},
BOOKTITLE = {{ISCC 2020 - 25th IEEE Symposium on Computers and Communications}},
ADDRESS = {Rennes, France},
YEAR = {2020},
MONTH = Jul,
DOI = {10.1109/ISCC50000.2020.9219611},
PDF = {https://hal.inria.fr/hal-02780468/file/lp_oldmodel.pdf},
HAL_ID = {hal-02780468},
HAL_VERSION = {v1},
}
-
Andrea Clementi,
Luciano Gualà,
Emanuele Natale,
Francesco Pasquale,
Giacomo Scornavacca,
and Luca Trevisan.
Consensus vs Broadcast, with and without Noise.
In ITCS 2020 - 11th Annual Innovations in Theoretical Computer Science,
11th Innovations in Theoretical Computer Science Conference,
Seattle, United States,
pages 42 - 43,
January 2020.
[WWW
] [PDF
]
Keywords:
Noisy Com- 46 munication Channels 47,
Gossip Models,
Broadcast,
Distributed computing,
and phrases Distributed Computing,
Consensus.
@inproceedings{clementi:hal-01958994,
TITLE = {{Consensus vs Broadcast, with and without Noise}},
AUTHOR = {Clementi, Andrea and Gual{\`a}, Luciano and Natale, Emanuele and Pasquale, Francesco and Scornavacca, Giacomo and Trevisan, Luca},
URL = {https://hal.inria.fr/hal-01958994},
BOOKTITLE = {{ITCS 2020 - 11th Annual Innovations in Theoretical Computer Science}},
ADDRESS = {Seattle, United States},
SERIES = {11th Innovations in Theoretical Computer Science Conference},
PAGES = {42 - 43},
YEAR = {2020},
MONTH = Jan,
DOI = {10.4230/LIPIcs.ITCS.2020.42},
KEYWORDS = {Noisy Com- 46 munication Channels 47 ; Gossip Models ; Broadcast ; Distributed computing ; and phrases Distributed Computing ; Consensus},
PDF = {https://hal.inria.fr/hal-01958994v2/file/ITCS20__Final_Version_.pdf},
HAL_ID = {hal-01958994},
HAL_VERSION = {v2},
}
-
Andrea Clementi,
Emanuele Natale,
and Isabella Ziccardi.
Parallel Load Balancing on Constrained Client-Server Topologies.
In SPAA 2020 - 32nd ACM Symposium on Parallelism in Algorithms and Architectures Proceedings,
Philadelphia, United States,
July 2020.
[WWW
]
@inproceedings{clementi:hal-02648649,
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-02648649},
BOOKTITLE = {{SPAA 2020 - 32nd ACM Symposium on Parallelism in Algorithms and Architectures Proceedings}},
ADDRESS = {Philadelphia, United States},
YEAR = {2020},
MONTH = Jul,
HAL_ID = {hal-02648649},
HAL_VERSION = {v1},
}
-
Federico Corò,
Roberto Verdecchia,
Emilio Cruciani,
Breno Miranda,
and Antonia Bertolino.
JTeC: A Large Collection of Java Test Classes for Test Code Analysis and Processing.
In MSR 2020 - 17th International Conference on Mining Software Repositories,
Seoul / Virtual, South Korea,
pages 578-582,
June 2020.
ACM.
[WWW
] [PDF
]
@inproceedings{coro:hal-03007190,
TITLE = {{JTeC: A Large Collection of Java Test Classes for Test Code Analysis and Processing}},
AUTHOR = {Cor{\`o}, Federico and Verdecchia, Roberto and Cruciani, Emilio and Miranda, Breno and Bertolino, Antonia},
URL = {https://hal.archives-ouvertes.fr/hal-03007190},
BOOKTITLE = {{MSR 2020 - 17th International Conference on Mining Software Repositories}},
ADDRESS = {Seoul / Virtual, South Korea},
PUBLISHER = {{ACM}},
PAGES = {578-582},
YEAR = {2020},
MONTH = Jun,
DOI = {10.1145/3379597.3387484},
PDF = {https://hal.archives-ouvertes.fr/hal-03007190/file/main.pdf},
HAL_ID = {hal-03007190},
HAL_VERSION = {v1},
}
-
Emilio Cruciani,
Hlafo Alfie Mimun,
Matteo Quattropani,
and Sara Rizzo.
Brief Announcement: Phase Transitions of the $k$-Majority Dynamics in a Biased Communication Model.
In DISC 2020 - 34th International Symposium on Distributed Computing,
Freibourg / Virtual, Germany,
October 2020.
[WWW
] [PDF
]
@inproceedings{cruciani:hal-03007234,
TITLE = {{Brief Announcement: 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-03007234},
BOOKTITLE = {{DISC 2020 - 34th International Symposium on Distributed Computing}},
ADDRESS = {Freibourg / Virtual, Germany},
YEAR = {2020},
MONTH = Oct,
PDF = {https://hal.archives-ouvertes.fr/hal-03007234/file/main.pdf},
HAL_ID = {hal-03007234},
HAL_VERSION = {v1},
}
-
Francesco d'Amore,
Andrea Clementi,
and Emanuele Natale.
Phase Transition of a Non-Linear Opinion Dynamics with Noisy Interactions.
In SIROCCO 2020 - 27th International Colloquium on Structural Information and Communication Complexity,
volume 12156 of SIROCCO 2020. Lecture Notes in Computer Science, vol 12156. Springer,
Paderborn, Germany,
pages 255--272,
June 2020.
[WWW
] [PDF
]
@inproceedings{damore:hal-02487650,
TITLE = {{Phase Transition of a Non-Linear Opinion Dynamics with Noisy Interactions}},
AUTHOR = {d'Amore, Francesco and Clementi, Andrea and Natale, Emanuele},
URL = {https://hal.archives-ouvertes.fr/hal-02487650},
TYPE = {Research Report},
BOOKTITLE = {{SIROCCO 2020 - 27th International Colloquium on Structural Information and Communication Complexity}},
ADDRESS = {Paderborn, Germany},
SERIES = {SIROCCO 2020. Lecture Notes in Computer Science, vol 12156. Springer},
VOLUME = {12156},
PAGES = {255--272},
INSTITUTION = {{INRIA Sophia Antipolis - I3S ; Universit{\`a} di Roma ''Tor Vergata''}},
YEAR = {2020},
MONTH = Jun,
DOI = {10.1007/978-3-030-54921-3\_15},
PDF = {https://hal.archives-ouvertes.fr/hal-02487650v2/file/main.pdf},
HAL_ID = {hal-02487650},
HAL_VERSION = {v2},
}
-
Igor Dias Da Silva and Christelle Caillouet.
Optimizing the trajectory of drones: trade-off between distance and energy.
In IAUV 2020 - 2nd International Workshop on Internet of Autonomous Unmanned Vehicles,
Cuomo, Italy,
June 2020.
[WWW
] [PDF
]
@inproceedings{diasdasilva:hal-02779495,
TITLE = {{Optimizing the trajectory of drones: trade-off between distance and energy}},
AUTHOR = {Dias Da Silva, Igor and Caillouet, Christelle},
URL = {https://hal.inria.fr/hal-02779495},
BOOKTITLE = {{IAUV 2020 - 2nd International Workshop on Internet of Autonomous Unmanned Vehicles}},
ADDRESS = {Cuomo, Italy},
YEAR = {2020},
MONTH = Jun,
DOI = {10.1109/SECONWorkshops50264.2020.9149781},
PDF = {https://hal.inria.fr/hal-02779495/file/UAV_tradeoff_6pages.pdf},
HAL_ID = {hal-02779495},
HAL_VERSION = {v1},
}
-
Guillaume Ducoffe,
Frédéric Giroire,
Stéphane Pérennes,
and Thibaud Trolliet.
Revisiter l'Attachement Préférentiel, et ses applications aux Réseaux Sociaux.
In ALGOTEL 2020 -- 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
Lyon, France,
September 2020.
[WWW
] [PDF
]
Keywords:
Twitter,
Réseaux sociaux,
Graphes aléatoires,
Systèmes complexes,
Attachement préférentiel,
Distribution des degrés,
Chaines de Markov.
@inproceedings{ducoffe:hal-02872772,
TITLE = {{Revisiter l'Attachement Pr{\'e}f{\'e}rentiel, et ses applications aux R{\'e}seaux Sociaux}},
AUTHOR = {Ducoffe, Guillaume and Giroire, Fr{\'e}d{\'e}ric and P{\'e}rennes, St{\'e}phane and Trolliet, Thibaud},
URL = {https://hal.archives-ouvertes.fr/hal-02872772},
BOOKTITLE = {{ALGOTEL 2020 -- 22{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Lyon, France},
YEAR = {2020},
MONTH = Sep,
KEYWORDS = {Twitter ; R{\'e}seaux sociaux ; Graphes al{\'e}atoires ; Syst{\`e}mes complexes ; Attachement pr{\'e}f{\'e}rentiel ; Distribution des degr{\'e}s ; Chaines de Markov},
PDF = {https://hal.archives-ouvertes.fr/hal-02872772/file/Revisiter_l_Attachement_Preferentiel.pdf},
HAL_ID = {hal-02872772},
HAL_VERSION = {v1},
}
-
Adrien Gausseran,
Frédéric Giroire,
B. Jaumard,
and Joanna Moulierac.
Be Scalable and Rescue My Slices During Reconfiguration.
In ICC 2020 - 2020 IEEE International Conference on Communications,
Dublin, Ireland,
pages 1-6,
June 2020.
IEEE.
[WWW
] [PDF
]
@inproceedings{gausseran:hal-02945405,
TITLE = {{Be Scalable and Rescue My Slices During Reconfiguration}},
AUTHOR = {Gausseran, Adrien and Giroire, Fr{\'e}d{\'e}ric and Jaumard, B. and Moulierac, Joanna},
URL = {https://hal.archives-ouvertes.fr/hal-02945405},
BOOKTITLE = {{ICC 2020 - 2020 IEEE International Conference on Communications}},
ADDRESS = {Dublin, Ireland},
PUBLISHER = {{IEEE}},
PAGES = {1-6},
YEAR = {2020},
MONTH = Jun,
DOI = {10.1109/ICC40277.2020.9148871},
PDF = {https://hal.archives-ouvertes.fr/hal-02945405/file/gausseran20scalable.pdf},
HAL_ID = {hal-02945405},
HAL_VERSION = {v1},
}
-
Frédéric Giroire,
Stéphane Pérennes,
and Thibaud Trolliet.
A Random Growth Model with any Real or Theoretical Degree Distribution.
In COMPLEX NETWORKS 2020 - The 9th International Conference on Complex Networks and their Applications,
Madrid / Virtual, Spain,
December 2020.
[WWW
] [PDF
]
Keywords:
Complex Networks,
Random Growth Model,
Preferential Attachment,
Degree Distribution,
Twitter.
@inproceedings{giroire:hal-03052144,
TITLE = {{A Random Growth Model with any Real or Theoretical Degree Distribution}},
AUTHOR = {Giroire, Fr{\'e}d{\'e}ric and P{\'e}rennes, St{\'e}phane and Trolliet, Thibaud},
URL = {https://hal.inria.fr/hal-03052144},
BOOKTITLE = {{COMPLEX NETWORKS 2020 - The 9th International Conference on Complex Networks and their Applications}},
ADDRESS = {Madrid / Virtual, Spain},
YEAR = {2020},
MONTH = Dec,
KEYWORDS = {Complex Networks ; Random Growth Model ; Preferential Attachment ; Degree Distribution ; Twitter},
PDF = {https://hal.inria.fr/hal-03052144/file/Model_any_DD_ComplexNetwork2020.pdf},
HAL_ID = {hal-03052144},
HAL_VERSION = {v1},
}
-
Changjiang Gou,
Ali Al Zoobi,
Anne Benoit,
Mathieu Faverge,
Loris Marchal,
Grégoire Pichon,
and Pierre Ramet.
Improving mapping for sparse direct solvers: A trade-off between data locality and load balancing.
In EuroPar 2020 - 26th International European Conference on Parallel and Distributed Computing,
Warsaw / Virtual, Poland,
pages 1-16,
August 2020.
[WWW
] [PDF
]
Keywords:
Load balancing,
Data locality,
Sparse direct solvers,
Processor mapping,
Localité des données,
Equilibrage de charge,
Placement,
Solveurs directs creux.
@inproceedings{gou:hal-02973315,
TITLE = {{Improving mapping for sparse direct solvers: A trade-off between data locality and load balancing}},
AUTHOR = {Gou, Changjiang and Al Zoobi, Ali and Benoit, Anne and Faverge, Mathieu and Marchal, Loris and Pichon, Gr{\'e}goire and Ramet, Pierre},
URL = {https://hal.inria.fr/hal-02973315},
BOOKTITLE = {{EuroPar 2020 - 26th International European Conference on Parallel and Distributed Computing}},
ADDRESS = {Warsaw / Virtual, Poland},
PAGES = {1-16},
YEAR = {2020},
MONTH = Aug,
KEYWORDS = {Load balancing ; Data locality ; Sparse direct solvers ; Processor mapping ; Localit{\'e} des donn{\'e}es ; Equilibrage de charge ; Placement ; Solveurs directs creux},
PDF = {https://hal.inria.fr/hal-02973315/file/paper.pdf},
HAL_ID = {hal-02973315},
HAL_VERSION = {v1},
}
-
Frédéric Havet,
Dorian Mazauric,
Viet-Ha Nguyen,
and Rémi Watrigant.
Overlaying a hypergraph with a graph with bounded maximum degree.
In CALDAM 2020 - 6th Annual International Conference on Algorithms and Discrete Applied Mathematics,
Hyderabad, India,
February 2020.
[WWW
] [PDF
]
@inproceedings{havet:hal-03035849,
TITLE = {{Overlaying a hypergraph with a graph with bounded maximum degree}},
AUTHOR = {Havet, Fr{\'e}d{\'e}ric and Mazauric, Dorian and Nguyen, Viet-Ha and Watrigant, R{\'e}mi},
URL = {https://hal.inria.fr/hal-03035849},
BOOKTITLE = {{CALDAM 2020 - 6th Annual International Conference on Algorithms and Discrete Applied Mathematics}},
ADDRESS = {Hyderabad, India},
YEAR = {2020},
MONTH = Feb,
PDF = {https://hal.inria.fr/hal-03035849/file/CALDAM-12pages.pdf},
HAL_ID = {hal-03035849},
HAL_VERSION = {v1},
}
-
Frédéric Havet,
Dorian Mazauric,
Viet-Ha Nguyen,
and Rémi Watrigant.
Overlaying a hypergraph with a graph with bounded maximum degree.
In ALGOTEL 2020 -- 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
Lyon, France,
September 2020.
[WWW
] [PDF
]
Keywords:
biologie structurale computationnelle,
hypergraphes,
graphes,
algorithmes,
complexité.
@inproceedings{havet:hal-02796730,
TITLE = {{Overlaying a hypergraph with a graph with bounded maximum degree}},
AUTHOR = {Havet, Fr{\'e}d{\'e}ric and Mazauric, Dorian and Nguyen, Viet-Ha and Watrigant, R{\'e}mi},
URL = {https://hal.archives-ouvertes.fr/hal-02796730},
BOOKTITLE = {{ALGOTEL 2020 -- 22{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Lyon, France},
YEAR = {2020},
MONTH = Sep,
KEYWORDS = {biologie structurale computationnelle ; hypergraphes ; graphes ; algorithmes ; complexit{\'e}},
PDF = {https://hal.archives-ouvertes.fr/hal-02796730/file/final-algotel-2020.pdf},
HAL_ID = {hal-02796730},
HAL_VERSION = {v1},
}
-
Cedric Morin,
Géraldine Texier,
Christelle Caillouet,
Gilles Desmangles,
and Cao-Thanh Phan.
Optimisation du coût de déploiement de services réseau virtualisés dans le cloud.
In CORES 2020 -- 5ème Rencontres Francophones sur la Conception de Protocoles, lâÉvaluation de Performance et lâExpérimentation des Réseaux de Communication,
Lyon, France,
September 2020.
[WWW
] [PDF
]
Keywords:
NFV,
MANO,
offres cloud,
programme linéaire.
@inproceedings{morin:hal-02874121,
TITLE = {{Optimisation du co{\^u}t de d{\'e}ploiement de services r{\'e}seau virtualis{\'e}s dans le cloud}},
AUTHOR = {Morin, Cedric and Texier, G{\'e}raldine and Caillouet, Christelle and Desmangles, Gilles and Phan, Cao-Thanh},
URL = {https://hal.archives-ouvertes.fr/hal-02874121},
BOOKTITLE = {{CORES 2020 -- 5{\`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 = {Lyon, France},
YEAR = {2020},
MONTH = Sep,
KEYWORDS = {NFV ; MANO ; offres cloud ; programme lin{\'e}aire},
PDF = {https://hal.archives-ouvertes.fr/hal-02874121/file/postprint.pdf},
HAL_ID = {hal-02874121},
HAL_VERSION = {v1},
}
-
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.
In COMPLEX NETWORKS 2020 - The 9th International Conference on Complex Networks and their Applications,
Madrid / Virtual, Spain,
December 2020.
[WWW
] [PDF
]
Keywords:
Complex networks,
Clustering Coefficient,
Directed networks,
Social networks,
Twitter.
@inproceedings{trolliet:hal-03052083,
TITLE = {{Interest Clustering Coefficient: a New Metric for Directed Networks like Twitter}},
AUTHOR = {Trolliet, Thibaud and Cohen, Nathann and Giroire, Fr{\'e}d{\'e}ric and Hogie, Luc and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.inria.fr/hal-03052083},
BOOKTITLE = {{COMPLEX NETWORKS 2020 - The 9th International Conference on Complex Networks and their Applications}},
ADDRESS = {Madrid / Virtual, Spain},
YEAR = {2020},
MONTH = Dec,
KEYWORDS = {Complex networks ; Clustering Coefficient ; Directed networks ; Social networks ; Twitter},
PDF = {https://hal.inria.fr/hal-03052083/file/ICC___ComplexNet___Submission_version.pdf},
HAL_ID = {hal-03052083},
HAL_VERSION = {v1},
}
-
Thibaud Trolliet,
Nathann Cohen,
Frédéric Giroire,
Luc Hogie,
and Stéphane Pérennes.
Coefficient de Clustering d'intérêt : une nouvelle métrique pour les graphes dirigés comme Twitter.
In ALGOTEL 2020 -- 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications,
Lyon, France,
September 2020.
[WWW
] [PDF
]
Keywords:
Systèmes Complexes,
Coefficient de Clustering,
Graphes Dirigés,
Réseaux Sociaux,
Twitter.
@inproceedings{trolliet:hal-02872779,
TITLE = {{Coefficient de Clustering d'int{\'e}r{\^e}t : une nouvelle m{\'e}trique pour les graphes dirig{\'e}s comme Twitter}},
AUTHOR = {Trolliet, Thibaud and Cohen, Nathann and Giroire, Fr{\'e}d{\'e}ric and Hogie, Luc and P{\'e}rennes, St{\'e}phane},
URL = {https://hal.archives-ouvertes.fr/hal-02872779},
BOOKTITLE = {{ALGOTEL 2020 -- 22{\`e}mes Rencontres Francophones sur les Aspects Algorithmiques des T{\'e}l{\'e}communications}},
ADDRESS = {Lyon, France},
YEAR = {2020},
MONTH = Sep,
KEYWORDS = {Syst{\`e}mes Complexes ; Coefficient de Clustering ; Graphes Dirig{\'e}s ; R{\'e}seaux Sociaux ; Twitter},
PDF = {https://hal.archives-ouvertes.fr/hal-02872779/file/Coefficient_de_Clustering_d_Interet.pdf},
HAL_ID = {hal-02872779},
HAL_VERSION = {v1},
}
-
Ali Al Zoobi,
David Coudert,
and Nicolas Nisse.
Space and time trade-off for the k shortest simple paths problem.
Research Report,
Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France,
February 2020.
[WWW
] [PDF
]
@techreport{alzoobi:hal-02465317,
TITLE = {{Space and time trade-off for the k shortest simple paths problem}},
AUTHOR = {Al Zoobi, Ali and Coudert, David and Nisse, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-02465317},
TYPE = {Research Report},
INSTITUTION = {{Inria \& Universit{\'e} Cote d'Azur, CNRS, I3S, Sophia Antipolis, France}},
YEAR = {2020},
MONTH = Feb,
PDF = {https://hal.archives-ouvertes.fr/hal-02465317/file/HAL_kSSP.pdf},
HAL_ID = {hal-02465317},
HAL_VERSION = {v1},
}
-
Julio Araujo,
Julien Bensmail,
Victor Campos,
Frédéric Havet,
Ana Karolinna Maia De Oliveira,
Nicolas Nisse,
and Ana Silva.
On finding the best and worst orientations for the metric dimension.
Research Report,
Inria,
2020.
[WWW
] [PDF
]
Keywords:
Undirected graphs,
Resolving sets,
Metric dimension,
Digraphs.
@techreport{araujo:hal-02921466,
TITLE = {{On finding the best and worst orientations for the metric dimension}},
AUTHOR = {Araujo, Julio and Bensmail, Julien and Campos, Victor and Havet, Fr{\'e}d{\'e}ric and Karolinna Maia De Oliveira, Ana and Nisse, Nicolas and Silva, Ana},
URL = {https://hal.archives-ouvertes.fr/hal-02921466},
TYPE = {Research Report},
INSTITUTION = {{Inria}},
YEAR = {2020},
KEYWORDS = {Undirected graphs ; Resolving sets ; Metric dimension ; Digraphs},
PDF = {https://hal.archives-ouvertes.fr/hal-02921466/file/oriented-md.pdf},
HAL_ID = {hal-02921466},
HAL_VERSION = {v1},
}
-
Julien Bensmail,
Sandip Das,
Soumen Nandi,
Théo Pierron,
Sagnik Sen,
and Eric Sopena.
On the signed chromatic number of some classes of graphs.
Research Report,
Université Côte D'Azur ; Université de Bordeaux ; Université Lyon 1,
2020.
[WWW
] [PDF
]
Keywords:
Kn-minor-free graph,
bounded-degree graph,
triangle-free planar graph,
homomorphism of signed graphs,
planar graph,
signed chromatic number.
@techreport{bensmail:hal-02947399,
TITLE = {{On the signed chromatic number of some classes of graphs}},
AUTHOR = {Bensmail, Julien and Das, Sandip and Nandi, Soumen and Pierron, Th{\'e}o and Sen, Sagnik and Sopena, Eric},
URL = {https://hal.archives-ouvertes.fr/hal-02947399},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} C{\^o}te D'Azur ; Universit{\'e} de Bordeaux ; Universit{\'e} Lyon 1}},
YEAR = {2020},
KEYWORDS = {Kn-minor-free graph ; bounded-degree graph ; triangle-free planar graph ; homomorphism of signed graphs ; planar graph ; signed chromatic number},
PDF = {https://hal.archives-ouvertes.fr/hal-02947399/file/main.pdf},
HAL_ID = {hal-02947399},
HAL_VERSION = {v1},
}
-
Julien Bensmail,
Foivos Fioravantes,
Fionn Mc Inerney,
and Nicolas Nisse.
Further Results on an Equitable 1-2-3 Conjecture.
Research Report,
Université Côte d'Azur, CNRS, I3S, France ; Inria Sophia Antipolis ; Aix-Marseille Université (AMU),
April 2020.
[WWW
] [PDF
]
Keywords:
Proper labellings,
Equitable labellings,
1-2-3 Conjecture.
@techreport{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},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} C{\^o}te d'Azur, CNRS, I3S, France ; Inria Sophia Antipolis ; Aix-Marseille Universit{\'e} (AMU)}},
YEAR = {2020},
MONTH = Apr,
KEYWORDS = {Proper labellings ; Equitable labellings ; 1-2-3 Conjecture},
PDF = {https://hal.archives-ouvertes.fr/hal-02533537/file/equitable123.pdf},
HAL_ID = {hal-02533537},
HAL_VERSION = {v1},
}
-
Julien Bensmail,
Foivos Fioravantes,
and Fionn Mc Inerney.
On the Role of 3's for the 1-2-3 Conjecture.
Research Report,
Université côte d'azur ; Aix-Marseille Universite,
2020.
[WWW
] [PDF
]
Keywords:
Proper labellings,
3-chromatic graphs,
1-2-3 Conjecture.
@techreport{bensmail:hal-02975031,
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-02975031},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} c{\^o}te d'azur ; Aix-Marseille Universite}},
YEAR = {2020},
KEYWORDS = {Proper labellings ; 3-chromatic graphs ; 1-2-3 Conjecture},
PDF = {https://hal.archives-ouvertes.fr/hal-02975031v2/file/role3.pdf},
HAL_ID = {hal-02975031},
HAL_VERSION = {v2},
}
-
Julien Bensmail,
Foivos Fioravantes,
and Nicolas Nisse.
On Proper Labellings of Graphs with Minimum Label Sum.
Research Report,
Inria - Sophia antipolis,
2020.
[WWW
] [PDF
]
@techreport{bensmail:hal-02450521,
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-02450521},
TYPE = {Research Report},
INSTITUTION = {{Inria - Sophia antipolis}},
YEAR = {2020},
PDF = {https://hal.archives-ouvertes.fr/hal-02450521v2/file/Minimize_Sum_of_Edge_Labels%29.pdf},
HAL_ID = {hal-02450521},
HAL_VERSION = {v2},
}
-
Julien Bensmail and Foivos Fioravantes.
On BMRN*-colouring of planar digraphs.
Research Report,
Université Côte d'Azur, CNRS, I3S, France,
2020.
[WWW
] [PDF
]
Keywords:
BMRN*-colouring,
planar digraphs,
TDMA scheduling.
@techreport{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},
INSTITUTION = {{Universit{\'e} C{\^o}te d'Azur, CNRS, I3S, France}},
YEAR = {2020},
KEYWORDS = {BMRN*-colouring ; planar digraphs ; TDMA scheduling},
PDF = {https://hal.archives-ouvertes.fr/hal-02195028v5/file/bmrn-planar.pdf},
HAL_ID = {hal-02195028},
HAL_VERSION = {v5},
}
-
Julien Bensmail,
Hervé Hocquard,
Dimitri Lajou,
and Eric Sopena.
Further Evidence Towards the Multiplicative 1-2-3 Conjecture.
Research Report,
Université côte d'azur ; Université de bordeaux,
April 2020.
[WWW
] [PDF
]
Keywords:
1-2-3 Conjecture,
multiset version,
product version,
4-chromatic graphs.
@techreport{bensmail:hal-02546401,
TITLE = {{Further Evidence Towards 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-02546401},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} c{\^o}te d'azur ; Universit{\'e} de bordeaux}},
YEAR = {2020},
MONTH = Apr,
KEYWORDS = {1-2-3 Conjecture ; multiset version ; product version ; 4-chromatic graphs},
PDF = {https://hal.archives-ouvertes.fr/hal-02546401/file/product123.pdf},
HAL_ID = {hal-02546401},
HAL_VERSION = {v1},
}
-
Julien Bensmail.
On a graph labelling conjecture involving coloured labels.
Research Report,
Université côte d'azur,
April 2020.
[WWW
] [PDF
]
Keywords:
Proper labellings,
Coloured labels,
Weak (2,
2)-Conjecture,
1-2-3 Conjecture.
@techreport{bensmail:hal-02554102,
TITLE = {{On a graph labelling conjecture involving coloured labels}},
AUTHOR = {Bensmail, Julien},
URL = {https://hal.archives-ouvertes.fr/hal-02554102},
TYPE = {Research Report},
INSTITUTION = {{Universit{\'e} c{\^o}te d'azur}},
YEAR = {2020},
MONTH = Apr,
KEYWORDS = {Proper labellings ; Coloured labels ; Weak (2 ; 2)-Conjecture ; 1-2-3 Conjecture},
PDF = {https://hal.archives-ouvertes.fr/hal-02554102/file/22weak.pdf},
HAL_ID = {hal-02554102},
HAL_VERSION = {v1},
}
-
Cláudio Carvalho,
Jonas Costa,
Cláudia Linhares Sales,
Raul Lopes,
Ana Karolinna Maia De Oliveira,
and Nicolas Nisse.
On the characterization of networks with multiple arc-disjoint branching flows.
Research Report,
UFC ; INRIA ; CNRS ; Université Côte dâAzur ; I3S ; LIRMM ; Université de Montpellier,
November 2020.
[WWW
] [PDF
]
@techreport{carvalho:hal-03031759,
TITLE = {{On the characterization of networks with multiple arc-disjoint branching flows}},
AUTHOR = {Carvalho, Cl{\'a}udio and Costa, Jonas and Sales, Cl{\'a}udia Linhares and Lopes, Raul and Maia De Oliveira, Ana Karolinna and Nisse, Nicolas},
URL = {https://hal.inria.fr/hal-03031759},
TYPE = {Research Report},
INSTITUTION = {{UFC ; INRIA ; CNRS ; Universit{\'e} C{\^o}te dâAzur ; I3S ; LIRMM ; Universit{\'e} de Montpellier}},
YEAR = {2020},
MONTH = Nov,
PDF = {https://hal.inria.fr/hal-03031759/file/Conjecture_results.pdf},
HAL_ID = {hal-03031759},
HAL_VERSION = {v1},
}
-
Andrea Clementi,
Francesco d'Amore,
George Giakkoupis,
and Emanuele Natale.
On the Search Efficiency of Parallel Lévy Walks on ${\mathbb Z}^2$.
Research Report,
Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France ; Università degli Studi di Roma ''Tor Vergata'' ; Univ Rennes, Inria, CNRS, IRISA, France,
April 2020.
[WWW
] [PDF
]
@techreport{clementi:hal-02530253,
TITLE = {{On the Search Efficiency of 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},
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 = {2020},
MONTH = Apr,
PDF = {https://hal.archives-ouvertes.fr/hal-02530253v3/file/levy_walk.pdf},
HAL_ID = {hal-02530253},
HAL_VERSION = {v3},
}
-
Thomas Dissaux,
Guillaume Ducoffe,
Nicolas Nisse,
and Simon Nivelle.
Treelength of Series-parallel graphs.
Research Report,
Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France,
2020.
[WWW
] [PDF
]
@techreport{dissaux:hal-03010346,
TITLE = {{Treelength of Series-parallel graphs}},
AUTHOR = {Dissaux, Thomas and Ducoffe, Guillaume and Nisse, Nicolas and Nivelle, Simon},
URL = {https://hal.archives-ouvertes.fr/hal-03010346},
TYPE = {Research Report},
INSTITUTION = {{Inria \& Universit{\'e} Cote d'Azur, CNRS, I3S, Sophia Antipolis, France}},
YEAR = {2020},
PDF = {https://hal.archives-ouvertes.fr/hal-03010346/file/Lagos_2021.pdf},
HAL_ID = {hal-03010346},
HAL_VERSION = {v1},
}
-
Changjiang Gou,
Ali Al Zoobi,
Anne Benoit,
Mathieu Faverge,
Loris Marchal,
Grégoire Pichon,
and Pierre Ramet.
Improving mapping for sparse direct solvers: A trade-off between data locality and load balancing.
Research Report RR-9328,
Inria Rhône-Alpes,
February 2020.
[WWW
] [PDF
]
Keywords:
Load balancing,
Data locality,
Sparse direct solvers,
Processor mapping,
Localité des données,
Equilibrage de charge,
Placement,
Solveurs directs creux.
@techreport{gou:hal-02491495,
TITLE = {{Improving mapping for sparse direct solvers: A trade-off between data locality and load balancing}},
AUTHOR = {Gou, Changjiang and Al Zoobi, Ali and Benoit, Anne and Faverge, Mathieu and Marchal, Loris and Pichon, Gr{\'e}goire and Ramet, Pierre},
URL = {https://hal.inria.fr/hal-02491495},
TYPE = {Research Report},
NUMBER = {RR-9328},
PAGES = {21},
INSTITUTION = {{Inria Rh{\^o}ne-Alpes}},
YEAR = {2020},
MONTH = Feb,
KEYWORDS = {Load balancing ; Data locality ; Sparse direct solvers ; Processor mapping ; Localit{\'e} des donn{\'e}es ; Equilibrage de charge ; Placement ; Solveurs directs creux},
PDF = {https://hal.inria.fr/hal-02491495/file/rr9328.pdf},
HAL_ID = {hal-02491495},
HAL_VERSION = {v1},
}
