GALaC
Showing results 1 to 12 of 387 in total
GALaC : 1 to 12 of 387 in total
-
-
-
Pré-publication, Document de travail
Hugo Boulier, David Coudert, Frédéric Havet, François Pirot. Colouring the interference digraph of a set of requests in a bidirected tree. 2026. ⟨hal-05536580⟩
-
Thèse
Philippe Rambaud. Analyse vidéographique de la motricité spontanée du nouveau-né et de l'enfant. Vision par ordinateur et reconnaissance de formes [cs.CV]. Université Paris-Saclay, 2026. Français. ⟨NNT : 2026UPASG007⟩. ⟨tel-05525738⟩
-
Pré-publication, Document de travail
Nicanor Carrasco-Vargas, Benjamin Hellouin de Menibus, Rémi Pallen. Parametrized complexity of relations between multidimensional subshifts. 2026. ⟨hal-05499852⟩
-
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⟩
-
PhD Student
-
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⟩
-
-
-