Filtrer vos résultats
- 20
- 16
- 18
- 14
- 2
- 1
- 1
- 2
- 32
- 8
- 1
- 1
- 1
- 1
- 1
- 1
- 5
- 13
- 10
- 3
- 1
- 1
- 1
- 34
- 2
- 36
- 14
- 14
- 9
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 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
- 15
- 9
- 8
- 6
- 6
- 5
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 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
36 résultats
|
|
triés par
|
Multiple Canadians on the road: minimizing the distance competitive ratioJournal of Combinatorial Optimization, 2019, 38 (4), pp.1086-1100. ⟨10.1007/s10878-019-00438-6⟩
Article dans une revue
hal-02343983v1
|
|||
|
Study of a Combinatorial Game in Graphs Through Linear ProgrammingAlgorithmica, 2020, 82 (2), pp.212-244. ⟨10.1007/s00453-018-0503-9⟩
Article dans une revue
hal-01881473v1
|
||
|
Computational Mathematics with SageMathSIAM, 2018, 978-1-61197-545-1. ⟨10.1137/1.9781611975468⟩
Ouvrages
hal-01646401v1
|
||
Cost-aware caching: optimizing cache provisioning and object placement in ICNIEEE Globecom 2014, Dec 2014, Austin, United States. pp.1108 - 1113
Communication dans un congrès
hal-01109072v1
|
|||
Le défi des 1001 graphesInterstices, 2017
Article dans une revue
hal-01662565v1
|
|||
|
Distributed Spectrum Management in TV White Space NetworksIEEE Transactions on Vehicular Technology, 2017, 66 (5), pp.4161 - 4172. ⟨10.1109/TVT.2016.2597866⟩
Article dans une revue
hal-01350583v1
|
||
|
Cellular automata between sofic tree shiftsTheoretical Computer Science, 2013, 506, pp.79-101. ⟨10.1016/j.tcs.2013.07.007⟩
Article dans une revue
hal-00946150v1
|
||
|
Backbone colouring and algorithms for TDMA schedulingDiscrete Mathematics and Theoretical Computer Science, 2019, Vol. 21 no. 3 (3), pp.#24. ⟨10.23638/DMTCS-21-3-24⟩
Article dans une revue
hal-01851600v4
|
||
|
On the minimum size of an identifying code over all orientations of a graphThe Electronic Journal of Combinatorics, 2018, 25 (1), pp.#P1.49
Article dans une revue
hal-01765643v1
|
||
|
Bin packing with colocations[Research Report] Inria; I3S. 2016
Rapport
hal-01381333v2
|
||
|
Enquêter dans les graphesALGOTEL 2017 - 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2017, Quiberon, France
Communication dans un congrès
hal-01510108v1
|
||
|
On the parameterized complexity of separating certain sources from the targetTheoretical Computer Science, 2019, 795, pp.183-193. ⟨10.1016/j.tcs.2019.06.011⟩
Article dans une revue
hal-02343987v1
|
||
|
Fixed-parameter tractability of counting small minimum $(S,T)$-cuts[Research Report] LRI. 2019
Rapport
hal-02176346v1
|
||
|
Optimal Planning of Virtual Content Delivery Networks under Uncertain Traffic DemandsComputer Networks, 2016, 106, pp.186-195. ⟨10.1016/j.comnet.2016.06.035⟩
Article dans une revue
hal-01338680v1
|
||
|
Applying clique-decomposition for computing Gromov hyperbolicityTheoretical Computer Science, 2017, 690, pp.114-139. ⟨10.1016/j.tcs.2017.06.001⟩
Article dans une revue
hal-01540756v1
|
||
Bandits Help Simulated Annealing to Complete a Maximin Latin Hypercube DesignInternational Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR), Jun 2018, Delft, Netherlands. pp.280-288, ⟨10.1007/978-3-319-93031-2_20⟩
Communication dans un congrès
hal-01796315v1
|
|||
|
Fixed-Parameter Tractability of Counting Small Minimum (S, T)-CutsGraph-Theoretic Concepts in Computer Science, 11789, Springer International Publishing, pp.79-92, 2019, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-30786-8_7⟩
Chapitre d'ouvrage
hal-02343993v1
|
||
|
Homonym Population ProtocolsTheory of Computing Systems, 2018, 62 (5), pp.1318-1346. ⟨10.1007/s00224-017-9833-2⟩
Article dans une revue
hal-01688764v1
|
||
Tropical paths in vertex-colored graphsCOCOA 2017 - 11th Annual International Conference on Combinatorial Optimization and Applications, Dec 2017, Shangai, China. pp.291-305, ⟨10.1007/978-3-319-71147-8_20⟩
Communication dans un congrès
hal-01635425v1
|
|||
The Consent of the Crowd Detected in an Open ForumOpenSym, Aug 2018, Paris, France. pp.1-9, ⟨10.1145/3233391.3233538⟩
Communication dans un congrès
hal-01811801v1
|
|||
|
Bin Packing with Colocations14th International Workshop on Approximation and Online Algorithms (WAOA), Aug 2016, Aarhus, Denmark. pp.40-51, ⟨10.1007/978-3-319-51741-4_4⟩
Communication dans un congrès
hal-01435614v1
|
||
|
Bispindle in strongly connected digraphs with large chromatic numberElectronic Notes in Discrete Mathematics, 2017, 62, pp.69 - 74. ⟨10.1016/j.endm.2017.10.013⟩
Article dans une revue
hal-01634307v1
|
||
|
Complexity Dichotomies for the Minimum $F$-Overlay Problem28th International Workshop on Combinatorial Algorithms (IWOCA), Jul 2017, Newcastle, Australia. pp.116-127, ⟨10.1007/978-3-319-78825-8_10⟩
Communication dans un congrès
hal-01571229v1
|
||
|
Study of a combinatorial game in graphs through Linear Programming28th International Symposium on Algorithms and Computation (ISAAC 2017), 2017, Phuket, Thailand. ⟨10.4230/LIPIcs⟩
Communication dans un congrès
hal-01582091v1
|
||
|
Subdivisions of oriented cycles in digraphs with large chromatic numberJournal of Graph Theory, 2018, 89 (4), pp.439-456. ⟨10.1002/jgt.22360⟩
Article dans une revue
hal-01834779v1
|
||
|
Spy-game on graphs: Complexity and simple topologiesTheoretical Computer Science, 2018, 725, pp.1 - 15. ⟨10.1016/j.tcs.2017.11.015⟩
Article dans une revue
hal-01782246v1
|
||
|
Multipass automata and group word problemsTheoretical Computer Science, 2015, ⟨10.1016/j.tcs.2015.06.054⟩
Article dans une revue
hal-01119199v1
|
||
|
Bispindles in strongly connected digraphs with large chromatic numberThe Electronic Journal of Combinatorics, 2018, ⟨10.37236/6922⟩
Article dans une revue
hal-01810706v1
|
||
|
Micro-Doppler Signal Representation for Drone Classification by Deep Learning2020 28th European Signal Processing Conference (EUSIPCO), Jan 2021, Amsterdam, France. pp.1561-1565, ⟨10.23919/Eusipco47968.2020.9287525⟩
Communication dans un congrès
hal-03602645v1
|
||
|
A set-operad of formal fractions and dendriform-like sub-operadsJournal of Algebra, 2016, 465, pp.322-355. ⟨10.1016/j.jalgebra.2016.07.001⟩
Article dans une revue
hal-00839697v1
|
- 1
- 2