Filtrer vos résultats
- 8
- 5
- 2
- 1
- 1
- 8
- 1
- 1
- 2
- 1
- 3
- 8
- 8
- 7
- 6
- 5
- 2
- 8
- 8
- 5
- 3
- 2
- 1
- 1
- 1
- 1
8 résultats
|
|
triés par
|
|
Engineering fast almost optimal algorithms for bipartite graph matchingESA 2020 - European Symposium on Algorithms, Sep 2020, Pisa, Italy
Communication dans un congrès
hal-02463717v3
|
||
|
Effective heuristics for matchings in hypergraphs[Research Report] RR-9224, Inria Grenoble Rhône-Alpes. 2018, pp.1-20
Rapport
hal-01924180v5
|
||
|
Karp-Sipser based kernels for bipartite graph matchingALENEX20 - SIAM Symposium on Algorithm Engineering and Experiments, Jan 2020, Salt Lake City, Utah, United States. pp.1-12
Communication dans un congrès
hal-02350734v1
|
||
|
Further notes on Birkhoff-von Neumann decomposition of doubly stochastic matricesLinear Algebra and its Applications, 2018, 554, pp.68--78. ⟨10.1016/j.laa.2018.05.017⟩
Article dans une revue
hal-01586245v2
|
||
|
Engineering fast algorithms for the bottleneck matching problemESA 2023 - The 31st Annual European Symposium on Algorithms, Sep 2023, Amsterdam (Hollande), Netherlands
Communication dans un congrès
hal-04146298v2
|
||
|
Approximation algorithms for maximum matchings in undirected graphsCSC 2018 - SIAM Workshop on Combinatorial Scientific Computing, Jun 2018, Bergen, Norway. pp.56-65, ⟨10.1137/1.9781611975215.6⟩
Communication dans un congrès
hal-01740403v3
|
||
|
Effective heuristics for matchings in hypergraphsSEA2 2019 - International Symposium on Experimental Algorithms - Special Event, Jun 2019, Kalamata, Greece. pp.248-264, ⟨10.1007/978-3-030-34029-2_17⟩
Communication dans un congrès
hal-02417475v1
|
||
|
Scaling matrices and counting the perfect matchings in graphsDiscrete Applied Mathematics, 2022, 308, pp.130--146. ⟨10.1016/j.dam.2020.07.016⟩
Article dans une revue
hal-01743802v6
|