Filtrer vos résultats
- 599
- 44
- 239
- 214
- 110
- 25
- 20
- 11
- 5
- 3
- 3
- 3
- 3
- 2
- 2
- 1
- 1
- 1
- 100
- 3
- 619
- 68
- 5
- 4
- 3
- 2
- 2
- 26
- 21
- 59
- 67
- 70
- 54
- 59
- 55
- 58
- 52
- 43
- 44
- 53
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 598
- 42
- 3
- 643
- 643
- 42
- 38
- 37
- 26
- 24
- 15
- 14
- 14
- 13
- 12
- 11
- 11
- 10
- 9
- 9
- 8
- 8
- 8
- 8
- 7
- 7
- 7
- 7
- 6
- 6
- 6
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 142
- 104
- 95
- 87
- 58
- 42
- 42
- 40
- 40
- 38
- 33
- 30
- 26
- 26
- 25
- 24
- 23
- 20
- 18
- 15
- 14
- 12
- 12
- 12
- 11
- 11
- 10
- 10
- 10
- 10
- 10
- 10
- 10
- 10
- 10
- 10
- 9
- 9
- 9
- 9
- 9
- 9
- 9
- 9
- 8
- 8
- 8
- 8
- 8
- 7
- 7
- 7
- 7
- 7
- 7
- 7
- 7
- 7
- 7
- 7
- 7
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
643 résultats
|
|
Computing metric hulls in graphsDiscrete Mathematics and Theoretical Computer Science, 2019, vol. 21 no. 1, ICGT 2018, ⟨10.23638/DMTCS-21-1-11⟩
Article dans une revue
hal-01612515v4
|
||
|
|
Substructures in digraphsCombinatorics [math.CO]. COMUE Université Côte d'Azur (2015 - 2019), 2018. English. ⟨NNT : 2018AZUR4052⟩
Thèse
tel-01957030v2
|
||
|
|
On the complexity of equal shortest path routingNetworks, 2015, ⟨10.1002/net.21612⟩
Article dans une revue
istex
hal-01218473v1
|
||
|
|
What Do Our Choices Say About Our Preferences?[Research Report] Combinatorics, Optimization and Algorithms for Telecommunications [researchteam] (211142); Wrocław University of Science and Technology. 2021
Rapport
hal-03462572v1
|
||
|
|
Grid spanners with low forwarding index for energy efficient networks[Research Report] RR-8643, INRIA Sophia Antipolis; INRIA. 2014
Rapport
hal-01095179v1
|
||
|
|
Running minimum in the best-choice problemExtremes, 2022, ⟨10.1007/s10687-022-00457-3⟩
Article dans une revue
hal-03462375v1
|
||
|
|
Optimizing FANET deployment for mobile sensor tracking in disaster management scenarioICT-DM 2021 - 7th International Conference on Information and Communication Technologies for Disaster Management, Dec 2021, Hangzhou, China. pp.134-141, ⟨10.1109/ICT-DM52643.2021.9664204⟩
Communication dans un congrès
hal-03461101v1
|
||
|
|
Optimizing the trajectory of drones: trade-off between distance and energyIAUV 2020 - 2nd International Workshop on Internet of Autonomous Unmanned Vehicles, Jun 2020, Cuomo, Italy. ⟨10.1109/SECONWorkshops50264.2020.9149781⟩
Communication dans un congrès
hal-02779495v1
|
||
|
|
Optimisation de plan de vol de drones autonomes pour une recharge rapide de capteursAlgoTel 2023 - 25èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2023, Cargese, France
Communication dans un congrès
hal-04087105v1
|
||
|
|
Optimization of Network Services Embedding Costs over Public and Private CloudsICOIN 2020 - 34th International Conference on Information Networking, Jan 2020, Barcelone, Spain. ⟨10.1109/ICOIN48656.2020.9016607⟩
Communication dans un congrès
hal-02440297v1
|
||
|
|
Connectivity Inference in Mass Spectrometry based Structure Determination[Research Report] RR-8320, INRIA. 2013, pp.23
Rapport
hal-00837496v1
|
||
|
|
Some Results on Non-deterministic Graph Searching in Trees[Research Report] 2013, pp.27
Rapport
inria-00174965v3
|
||
|
|
Complexity of Finding Maximum Locally Irregular Induced Subgraphs[Research Report] Inria; I3S; Université Côte d'Azur. 2021
Rapport
hal-03358273v2
|
||
|
|
Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic NumberThe Electronic Journal of Combinatorics, 2019, 26, pp.P3.19
Article dans une revue
hal-02275082v1
|
||
|
|
On the minimum number of arcs in k-dicritical oriented graphs2023
Pré-publication, Document de travail
hal-03985818v1
|
||
|
|
Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in BetweenAlgorithmica, 2021, 83 (5), pp.1459-1492. ⟨10.1007/s00453-020-00790-8⟩
Article dans une revue
hal-02801932v3
|
||
|
|
Parallel Load Balancing on Constrained Client-Server TopologiesSPAA 2020 - 32nd ACM Symposium on Parallelism in Algorithms and Architectures Proceedings, Jul 2020, Philadelphia, United States. ⟨10.1145/3350755.3400232⟩
Communication dans un congrès
hal-02648649v1
|
||
|
|
On the collective behaviors of bio-inspired distributed systemsDistributed, Parallel, and Cluster Computing [cs.DC]. Université Côte d'Azur, 2022. English. ⟨NNT : 2022COAZ4054⟩
Thèse
tel-03906167v1
|
||
|
|
Preferential attachment hypergraph with vertex deactivationMASCOTS 2023 - 31st International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, Oct 2023, New York, United States
Communication dans un congrès
hal-04372316v1
|
||
|
|
Colouring graphs with constraints on connectivityJournal of Graph Theory, 2017, 85 (4), pp.814-838. ⟨10.1002/jgt.22109⟩
Article dans une revue
hal-01570035v1
|
||
|
|
Self-stabilizing repeated balls-into-binsDistributed Computing, 2019, 32 (1), pp.59-68. ⟨10.1007/s00446-017-0320-4⟩
Article dans une revue
hal-02948569v1
|
||
|
|
Une implémentation GPU de la méthode de recherche approximative FlyHashCAID 2023 - 5e Conference on Artificial Intelligence for Defense, DGA Maîtrise de l'Information, Nov 2023, Rennes, France
Communication dans un congrès
hal-04328529v1
|
||
|
|
Space and time trade-off for the k shortest simple paths problem[Research Report] Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France. 2020
Rapport
hal-02465317v1
|
||
|
|
Analyse bi-objectif pour la couverture de cibles par des dronesRencontres Francophones sur la Conception de Protocoles, l’Évaluation de Performance et l’Expérimentation des Réseaux de Communication, May 2018, Roscoff, France
Communication dans un congrès
hal-01784809v1
|
||
|
|
Improving mapping for sparse direct solvers: A trade-off between data locality and load balancingEuroPar 2020 - 26th International European Conference on Parallel and Distributed Computing, Aug 2020, Warsaw / Virtual, Poland. pp.1-16
Communication dans un congrès
hal-02973315v1
|
||
|
|
Bringing Energy Aware Routing closer to Reality with SDN Hybrid NetworksIEEE Transactions on Green Communications and Networking, 2018, pp.1128 - 1139. ⟨10.1109/TGCN.2018.2842123⟩
Article dans une revue
hal-01877868v1
|
||
|
|
Recovery of disrupted airline operations using k-Maximum Matching in Graphs[Research Report] RR-8679, Inria Sophia Antipolis; INRIA. 2015
Rapport
hal-01116487v1
|
||
|
|
Temporal Graph Neural Networks with GraphNeuralNetworks.jlJulia and Optimization Days 2023, Oct 2023, Paris, France
Poster de conférence
hal-04230797v1
|
||
|
|
Compressing two-dimensional routing tables with orderINOC (International Network Optimization Conference), May 2015, Varsovie, Poland. pp.351-358
Communication dans un congrès
hal-01162724v1
|
||
|
|
Identifying codes for infinite triangular grids with a finite number of rowsDiscrete Mathematics, 2017, 340, pp.1584 - 1597. ⟨10.1016/j.disc.2017.02.015⟩
Article dans une revue
hal-01527023v1
|