Affichage des résultats 1 à 12 sur 386 au total
GALaC : 1 à 12 sur 386 au total
-
Communication dans un congrès
Florian Galliot, Hoang La, Raphaëlle Maistre, Matthieu Petiteau, Dimitri Watel. Graph reconstruction from queries on triples (Extended abstract). 13th European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB’25, Aug 2025, Budapest, Hungary. ⟨hal-05416454⟩
-
Article dans une revue
Pierre Aboulker, Frédéric Havet, François Pirot, Juliette Schabanel. Minimum Acyclic Number and Maximum Dichromatic Number of Oriented Triangle-Free Graphs of a Given Order. The Electronic Journal of Combinatorics, 2025, 32 (4), pp.P4.27. ⟨10.37236/12862⟩. ⟨hal-05470628⟩
-
Algorithmes, apprentissage et calcul
GALaC
-
Communication dans un congrès
Reinis Cirpons, Florent Hivert, Assia Mahboubi, Guillaume Melquiond, James D Mitchell, et al.. Certifying the Decidability of the Word Problem in Monoids at Large. CPP 2026 - 15th ACM SIGPLAN International Conference on Certified Programs and Proofs, Jan 2026, Rennes, France. pp.128-142, ⟨10.1145/3779031.3779101⟩. ⟨hal-05448783⟩
-
Algorithmes, apprentissage et calcul
GALaC
-
Benjamin Hellouin de Menibus
-
Algorithmes, apprentissage et calcul
GALaC
-
Algorithmes, apprentissage et calcul
GALaC
-
Article dans une revue
Hao Li, Luyi Li, Ping Li, Xueliang Li. Rainbow directed version of Dirac's theorem. Discrete Mathematics, 2025, 348 (8), pp.114506. ⟨10.1016/j.disc.2025.114506⟩. ⟨hal-05392101⟩
-
Thèse
Hugo Thimonier. Advancing Anomaly Detection in Tabular Data : A Case-Study on Credit Card Fraud Identification. Artificial Intelligence [cs.AI]. Université Paris-Saclay, 2024. English. ⟨NNT : 2024UPASG046⟩. ⟨tel-05351694⟩
-
Article dans une revue
Tianjiao Dai, Hao Li, Yannis Manoussakis, Qiancheng Ouyang. Properly colored cycles in edge-colored complete graphs. Discrete Mathematics, 2025, 348 (6), pp.114403. ⟨10.1016/j.disc.2025.114403⟩. ⟨hal-05392100⟩
-
Algorithmes, apprentissage et calcul
GALaC