Filtrer vos résultats
- 17
- 1
- 12
- 3
- 2
- 1
- 2
- 15
- 10
- 5
- 2
- 3
- 3
- 1
- 4
- 18
- 12
- 12
- 8
- 7
- 5
- 2
- 2
- 1
- 1
- 1
- 18
- 8
- 8
- 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
18 résultats
|
|
triés par
|
|
Detours in directed graphsJournal of Computer and System Sciences, 2023, 137, pp.66-86. ⟨10.1016/j.jcss.2023.05.001⟩
Article dans une revue
hal-04288113v1
|
||
|
Subdivisions of oriented cycles in digraphs with large chromatic numberBordeaux Graph Wokshop 2016, Nov 2016, Bordeaux, France. pp.85-88
Communication dans un congrès
hal-01411115v1
|
||
|
Substructures in digraphsCombinatorics [math.CO]. COMUE Université Côte d'Azur (2015 - 2019), 2018. English. ⟨NNT : 2018AZUR4052⟩
Thèse
tel-01957030v2
|
||
|
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
|
||
|
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
|
||
|
How to find a good explanation for clustering?Artificial Intelligence, 2023, 322, pp.103948. ⟨10.1016/j.artint.2023.103948⟩
Article dans une revue
hal-04288109v1
|
||
|
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
|
||
|
Immersion of transitive tournaments in digraphs with large minimum outdegreeJournal of Combinatorial Theory, Series B, 2019, 134, pp.350-353. ⟨10.1016/j.jctb.2018.05.004⟩
Article dans une revue
hal-01835124v1
|
||
|
Bispindles in strongly connected digraphs with large chromatic numberThe Electronic Journal of Combinatorics, 2018, ⟨10.37236/6922⟩
Article dans une revue
hal-01810706v1
|
||
|
Packing and Covering Balls in Graphs Excluding a MinorCombinatorica, 2021, 41 (3), pp.299-318. ⟨10.1007/s00493-020-4423-3⟩
Article dans une revue
hal-03281264v1
|
||
|
Equitable orientations of sparse uniform hypergraphsThe Electronic Journal of Combinatorics, 2016, 23 (4), pp.4-31
Article dans une revue
hal-01417832v1
|
||
|
Subdivisions in digraphs of large out-degree or large dichromatic number *[Research Report] INRIA Sophia Antipolis - I3S. 2016
Rapport
hal-01403921v1
|
||
|
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster RadiiSoCG 2023 - 39th International Symposium on Computational Geometry, Jun 2023, Dallas, TX, United States. pp.12:1-12:14, ⟨10.4230/LIPIcs.SoCG.2023.12⟩
Communication dans un congrès
hal-04288120v1
|
||
|
Powers of paths in tournamentsCombinatorics, Probability and Computing, 2021, pp.1-5. ⟨10.1017/S0963548321000067⟩
Article dans une revue
hal-03269230v1
|
||
|
Subdivisions of oriented cycles in digraphs with large chromatic number[Research Report] RR-8865, LRI - CNRS, University Paris-Sud; LIP - ENS Lyon; INRIA Sophia Antipolis - I3S. 2016, pp.25
Rapport
hal-01277578v1
|
||
|
Minimum-Membership Geometric Set Cover, RevisitedSoCG 2023 - 39th International Symposium on Computational Geometry, Jun 2023, Dallas, United States. pp.11:1-11:14, ⟨10.4230/LIPIcs.SoCG.2023.11⟩
Communication dans un congrès
hal-04288117v1
|
||
|
A proof of the Erdős–Sands–Sauer–Woodrow conjectureJournal of Combinatorial Theory, Series B, 2019, Elsevier Journal of Combinatorial Theory, Series B, 137, pp.316-319. ⟨10.1016/j.jctb.2018.11.005⟩
Article dans une revue
hal-02158330v2
|
||
|
Edge Separators for Graphs Excluding a MinorThe Electronic Journal of Combinatorics, 2023, 30 (4), pp.4.12. ⟨10.37236/11744⟩
Article dans une revue
hal-04288100v1
|