Filter your results
- 8
- 5
- 13
- 9
- 5
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 13
- 3
- 11
- 9
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 13
- 13
- 11
- 11
- 11
- 11
- 7
- 6
- 6
- 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
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 13
- 10
- 3
- 5
- 3
- 3
- 1
- 1
|
|
sorted by
|
|
Linearity is Strictly More Powerful than Contiguity for Encoding GraphsDiscrete Mathematics, 2016, 339 (8), pp.2168-2177. ⟨10.1016/j.disc.2016.03.006⟩
Journal articles
hal-01424428v1
|
||
|
A Proof of the Barát–Thomassen ConjectureJournal of Combinatorial Theory, Series B, 2017, 124, pp.39 - 55. ⟨10.1016/j.jctb.2016.12.006⟩
Journal articles
hal-01629943v1
|
||
Linearity is Strictly More Powerful than Contiguity for Encoding Graphs14th International Symposium on Algorithms and Data Structures – WADS 2015, 2015, Victoria, Canada. pp.212-223
Conference papers
hal-01242024v1
|
|||
Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing ProblemsACM Transactions on Algorithms, 2019, 15 (1), pp.1-44
Journal articles
hal-02055844v1
|
|||
Coloring dense digraphsThe European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'17), Aug 2017, Vienna, Austria. pp.577-583
Conference papers
hal-01990330v1
|
|||
Deep Multi-Wasserstein Unsupervised Domain AdaptationPattern Recognition Letters, In press
Journal articles
hal-02114975v1
|
|||
|
Additive bases and flows in graphsSIAM Journal on Discrete Mathematics, 2018, 32 (1), pp.534-542. ⟨10.1137/17M1113758⟩
Journal articles
hal-01709239v1
|
||
|
Coloring tournaments: From local to globalJournal of Combinatorial Theory, Series B, 2019, 138, pp.166-171. ⟨10.1016/j.jctb.2019.01.005⟩
Journal articles
hal-02181518v1
|
||
|
Additive bases and flows in graphsThe European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'17), 2017, Vienne, Austria. pp.399-405, ⟨10.1016/j.endm.2017.06.066⟩
Conference papers
hal-01433822v1
|
||
|
Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjectureCombinatorica, 2019, 39 (2), pp.239-263. ⟨10.1007/s00493-017-3661-5⟩
Journal articles
hal-01744515v1
|
||
|
Domination and fractional domination in digraphsThe Electronic Journal of Combinatorics, 2018, 25 (3), pp.P3.32
Journal articles
hal-01990176v1
|
||
Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing ProblemsSODA 2018, Jan 2018, New Orleans, France. pp.331-342
Conference papers
hal-01993402v1
|
|||
Differentially Private Optimal Transport: Application to Domain AdaptationIJCAI 2019, Aug 2019, Macao, China
Conference papers
hal-02124877v1
|