Thèse
Publications
Publications
-
-
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⟩
-
Thèse
Valentin Dardilhac. Vote mechanisms and solution of inequation systems with real variables. Computational Complexity [cs.CC]. Université Paris-Saclay, 2025. English. ⟨NNT : 2025UPASG045⟩. ⟨tel-05300167⟩
-
Communication dans un congrès
Johanne Cohen, Emmanuel Goutierre, Hayg Guler, Fatios Kapotos, Sida-Bastien Li, et al.. Modelling Dynamical Systems: Learning ODEs with No Internal ODE Resolution. 18th International Conference, RP 2024, Sep 2025, Vienne, Austria. pp.221-237, ⟨10.1007/978-3-031-72621-7_15⟩. ⟨hal-05240753⟩
-
Article dans une revue
Tianjiao Dai, Qiancheng Ouyang, François Pirot. New Bounds for Odd Colourings of Graphs. The Electronic Journal of Combinatorics, 2024, 31 (4), pp.P4.57. ⟨10.37236/12110⟩. ⟨hal-05246159⟩
-
Proceedings/Recueil des communications
Olivier Bournez, Johanne Cohen, Adrian Wurm. A Universal Uniform Approximation Theorem for Neural Networks. 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025), Aug 2025, Varsovie, Poland. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025, ⟨10.4230/LIPIcs.MFCS.2025.29⟩. ⟨hal-05241833⟩
-
Communication dans un congrès
Nicolas Atienza, Johanne Cohen, Christophe Labreuche, Michele Sebag. Provably Safeguarding a Classifier from OOD and Adversarial Samples. 13th International Conference on Learning Representations – ICLR 2025, Apr 2025, Singapore, Singapore. pp.56800-56820. ⟨hal-05241867⟩
-
Thèse
Manon Blanc. Discrete-Time and Continuous-Time Systems over the Reals : Relating Complexity with Robustness, Length and Precision. Computational Complexity [cs.CC]. Institut Polytechnique de Paris, 2025. English. ⟨NNT : 2025IPPAX024⟩. ⟨tel-05118950⟩
-
Communication dans un congrès
Adnan Vora, Mikhail Nesterenko, Sébastien Tixeuil, Sylvie Delaët. Universe Detectors for Sybil Defense in Ad Hoc Wireles Networks. International Conference on Stabilization, Safety, and Security (SSS 2008), Nov 2008, Detroit, MI, United States. pp.63-78, ⟨10.1007/978-3-540-89335-6_8⟩. ⟨hal-01303007⟩
-
Thèse
Nicolas Atienza. Towards Reliable ML : Leveraging Multi-Modal Representations, Information Bottleneck and Extreme Value Theory. Machine Learning [stat.ML]. Université Paris-Saclay, 2025. English. ⟨NNT : 2025UPASG025⟩. ⟨tel-05140441⟩
-
Communication dans un congrès
Manon Blanc, Olivier Bournez. Quantifiying the robustness of dynamical systems. Relating time and space to length and precision. Computer Science Logic CSL’24, Feb 2024, Naples, Italy. pp.17:1-17:20, ⟨10.4230/lipics.csl.2024.17⟩. ⟨hal-04303119⟩
-
Communication dans un congrès
Djamel Eddine Amir, Benjamin Hellouin de Menibus. Minimality and computability of languages of G-shifts. ICALP 2025, Aarhus University, Jul 2025, Aarhus, Denmark. ⟨hal-05117426⟩
-
Logiciel
Pierre Thomas Froidevaux, Alexandre Blondin-Massé, Chiara Marmo, Jérémy Neveu, Jean Privat, et al.. Travo. 2025, ⟨swh:1:dir:25c53be9cb372dca46dc311c114c9d961127225b;origin=https://gitlab.com/travo-cr/travo;visit=swh:1:snp:5f0faa62d3619f576a8a041c609ac66820f54a80;anchor=swh:1:rev:fd9302aab27cb93dc1ef24b3ab13a3da163564ca⟩. ⟨hal-05030605⟩
-
Communication dans un congrès
Felipe Furquim, Valentin Dardilhac, Daniel Cordeiro, Johanne Cohen. Characterizing Strategyproofness Through Score Functions in Voting Mechanisms. Frontiers of Algorithmics (IJTCS-FAW 2025), Jun 2025, Paris, France. pp.279-292, ⟨10.1007/978-981-96-8312-3_21⟩. ⟨hal-05040764⟩
-
Pré-publication, Document de travail
Benjamin Hellouin de Menibus, Ville Salo, Ilkka Törmä. Symbol Frequencies in Surjective Cellular Automata. 2025. ⟨hal-05026614⟩
-
Thèse
Emmanuel Goutierre. Machine learning-based particle accelerator modeling. Artificial Intelligence [cs.AI]. Université Paris-Saclay, 2024. English. ⟨NNT : 2024UPASG106⟩. ⟨tel-04995631⟩
-
Pré-publication, Document de travail
Christophe Hohlweg, Viviane Pons. A conjecture on descents, inversions and the weak order. 2025. ⟨hal-04966542⟩
-
Communication dans un congrès
Benjamin Hellouin de Menibus, Pacôme Perrotin. Subshifts Defined by Nondeterministic and Alternating Plane-walking Automata. 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025), Mar 2025, Iena, Germany. pp.56, ⟨10.4230/LIPIcs.STACS.2025.56⟩. ⟨hal-04951292⟩
-
Communication dans un congrès
Nicolas Atienza, Christophe Labreuche, Johanne Cohen, Michèle Sebag. Provably Safeguarding a Classifier from OOD and Adversarial Samples: an Extreme Value Theory Approach. 13th International Conference on Learning Representations – ICLR 2025, Apr 2025, Singapore, Singapore. ⟨hal-04922382⟩
-
Pré-publication, Document de travail
Jean-Philippe Chancelier, Michel de Lara, Antoine Deza, Lionel Pournin. Geometry of Sparsity-Inducing Norms. 2025. ⟨hal-04886852⟩
-
Pré-publication, Document de travail
Johanne Cohen, Laurence Pilard, Jonas Sénizergues. Autostabilizing Minimal Clique Decomposition with Byzantine Faults tolerance. 2025. ⟨hal-04872001⟩
-
Article dans une revue
Benjamin Hellouin de Menibus, Mathieu Sablik. Characterisation of sets of limit measures of a cellular automaton iterated on a random configuration. Ergodic Theory and Dynamical Systems, 2016, 38 (2), pp.601-650. ⟨10.1017/etds.2016.46⟩. ⟨hal-01299001⟩
-
Communication dans un congrès
Nathalie Aubrun, Julien Esnay, Mathieu Sablik. Domino Problem Under Horizontal Constraints. STACS 2020 37th International Symposium on Theoretical Aspects of Computer Science, 2020, Montpellier, France. ⟨10.4230/LIPIcs.STACS.2020.26⟩. ⟨hal-02380657⟩
-
Pré-publication, Document de travail
Stijn Cambie, François Dross, Kolja Knauer, Xuan Hoang La, Petru Valicov. Partitions of planar (oriented) graphs into a connected acyclic and an independent set. 2024. ⟨hal-04840861⟩
-
Pré-publication, Document de travail
Jȩdrzej Hodor, Xuan Hoang La, Piotr Micek, Clément Rambaud. Centered colorings in minor-closed graph classes. 2024. ⟨hal-04819300⟩
-
Pré-publication, Document de travail
Jędrzej Hodor, Xuan Hoang La, Piotr Micek, Clément Rambaud. Quickly excluding an apex-forest. 2024. ⟨hal-04819247⟩
-
Communication dans un congrès
Jędrzej Hodor, Xuan Hoang La, Piotr Micek, Clément Rambaud. Weak coloring numbers of minor-closed graph classes. ACM-SIAM Symposium on Discrete Algorithms (SODA25), Jan 2025, New Orleans, United States. pp.3325-3334, ⟨10.1137/1.9781611978322.107⟩. ⟨hal-04819269⟩
-
Article dans une revue
Nathalie Aubrun, Nicolás Bitar. Self-Avoiding Walks on Cayley Graphs Through the Lens of Symbolic Dynamics. The Electronic Journal of Combinatorics, 2024, 31 (4), pp.P4.24. ⟨10.37236/13065⟩. ⟨hal-04807272⟩
-
Article dans une revue
Nathalie Aubrun, Michael Schraudner. Tilings of the hyperbolic plane of substitutive origin as subshifts of finite type on Baumslag–Solitar groups BS ( 1 , n ). Comptes Rendus. Mathématique, 2024, 362 (G5), pp.553-580. ⟨10.5802/crmath.571⟩. ⟨hal-04727536⟩
-
Communication dans un congrès
Nicolas Atienza, Roman Bresson, Cyriaque Rousselot, Philippe Caillou, Johanne Cohen, et al.. Cutting the Black Box: Conceptual Interpretation of a Deep Neural Net with Multi-Modal Embeddings and Multi-Criteria Decision Aid. IJCAI 2024, 33rd International Joint Conference on Artificial Intelligence, Aug 2024, Jeju, South Korea. pp.3669-3678, ⟨10.24963/ijcai.2024/406⟩. ⟨hal-04728875⟩
-
Article dans une revue
David Auger, Johanne Cohen, Antoine Lobstein. Nonatomic Non-Cooperative Neighbourhood Balancing Games. Fundamenta Informaticae, 2024, 191 (3-4), pp.239-268. ⟨10.3233/FI-242181⟩. ⟨hal-04728941⟩
-
Pré-publication, Document de travail
Benjamin Hellouin de Menibus, Victor Lutfalla, Pascal Vanier. Decision problems on geometric tilings. 2025. ⟨hal-04693345v2⟩
-
Communication dans un congrès
Thomas Bellitto, Johanne Cohen, Bruno Escoffier, Nguyen Minh Khang, Mikaël Rabie. Canadian Traveller Problems in Temporal Graphs. 51st International Workshop on Graph-Theoretic Concepts in Computer Science,, Jun 2025, Otzenhausen, Germany. ⟨hal-04677440⟩
-
Communication dans un congrès
Manon Blanc, Olivier Bournez. The Complexity of Computing in Continuous Time: Space Complexity Is Precision. International Colloquium on Automata, Languages, and Programming (ICALP), Jul 2024, Tallinn, Estonia. ⟨10.4230/LIPIcs.ICALP.2024.129⟩. ⟨hal-04664615⟩
-
Thèse
Pierre Béaur. Algorithmique et combinatoire des mots par les représentations S-adiques. Mathématique discrète [cs.DM]. Université Paris-Saclay, 2024. Français. ⟨NNT : 2024UPASG033⟩. ⟨tel-04661982⟩
-
Thèse
Nicolás Bitar. Subshifts of Finite Type on Groups : Emptiness and Aperiodicity. Dynamical Systems [math.DS]. Université Paris-Saclay, 2024. English. ⟨NNT : 2024UPASG034⟩. ⟨tel-04635844⟩
-
Pré-publication, Document de travail
Quentin Japhet, Dimitri Watel, Dominique Barth, Marc-Antoine Weisser. Maximal Line Digraphs. 2024. ⟨hal-04587485v2⟩
-
Thèse
Jie Hu. Rainbow subgraphs and properly colored subgraphs in colored graphs. Combinatorics [math.CO]. Université Paris-Saclay, 2022. English. ⟨NNT : 2022UPASG045⟩. ⟨tel-04588976⟩
-
Thèse
Jonathan Raiman. DeepType : Natural Language Understanding by Abstraction. Artificial Intelligence [cs.AI]. Université Paris-Saclay, 2023. English. ⟨NNT : 2023UPASG016⟩. ⟨tel-04588554⟩
-
Communication dans un congrès
Philippe Rambaud, Adel Taleb, Raphael Fauches, Arpad Rimmel, Joanna Tomasik, et al.. Binary Classification vs. Anomaly Detection on Imbalanced Tabular Medical Datasets. 2023 Congress in Computer Science, Computer Engineering, & Applied Computing (CSCE), Jul 2023, Las Vegas, France. pp.01-05, ⟨10.1109/CSCE60160.2023.00220⟩. ⟨hal-04567598⟩
-
Article dans une revue
Adel Taleb, Philippe Rambaud, Samuel Diop, Raphaël Fauches, Joanna Tomasik, et al.. Spinal Muscular Atrophy Hypotonia Detection Using Computer Vision and Artificial Intelligence. Medicine Archives of Pediatrics & Adolescent – JAMA Pediatrics , 2024, 178 (5), pp.500-502. ⟨10.1001/jamapediatrics.2024.0030⟩. ⟨hal-04567605⟩
-
Article dans une revue
Olivier Hudry, Ville Junnila, Antoine Lobstein. On Iiro Honkala’s contributions to identifying codes. Fundamenta Informaticae, In press, 191 (3-4), pp.165-196. ⟨10.3233/FI-242178⟩. ⟨hal-04568130⟩
-
Pré-publication, Document de travail
Ylène Aboulfath, Dimitri Watel, Marc-Antoine Weisser, Thierry Mautor, Dominique Barth. Maximizing minimum cycle bases intersection. 2024. ⟨hal-04559959v2⟩
-
Communication dans un congrès
Vida Dujmović, Robert Hickingbotham, Jędrzej Hodor, Gwenaël Joret, Xuan Hoang La, et al.. The Grid-Minor Theorem Revisited. SODA 2024 – 2024 Annual ACM-SIAM Symposium on Discrete Algorithms, Jan 2024, Westin Alexandria Old Town, United States. pp.1241-1245, ⟨10.1137/1.9781611977912.48⟩. ⟨hal-04553168⟩
-
Article dans une revue
Marcin Briański, Jędrzej Hodor, Xuan Hoang La, Piotr Micek, Katzper Michno. Boolean Dimension of a Boolean Lattice. Order, 2024, pp.25-36. ⟨10.1007/s11083-024-09666-w⟩. ⟨hal-04553148⟩
-
Pré-publication, Document de travail
Lech Duraj, Ross J. Kang, Xuan Hoang La, Jonathan Narboni, Filip Pokrývka, et al.. The $chi$-binding function of $d$-directional segment graphs. 2024. ⟨hal-04553176⟩
-
Thèse
Bin Wang. Rainbow structures in properly edge-colored graphs and hypergraph systems. Combinatorics [math.CO]. Université Paris-Saclay; Shandong University (Jinan, Chine), 2024. English. ⟨NNT : 2024UPASG016⟩. ⟨tel-04534170⟩
-
Thèse
Qiancheng Ouyang. Some colouring problems in edge/vertex-coloured graphs : Structural and extremal studies. Combinatorics [math.CO]. Université Paris-Saclay, 2023. English. ⟨NNT : 2023UPASG060⟩. ⟨tel-04505756⟩
-
Thèse
Loric Duhaze-Pradines. Reachability problems for general rotor walks in graphs. Computer Science and Game Theory [cs.GT]. Université Paris-Saclay, 2023. English. ⟨NNT : 2023UPASG051⟩. ⟨tel-04504876⟩
-
Thèse
Noémie Cartier. Lattice properties of acyclic pipe dreams. Combinatorics [math.CO]. Université Paris-Saclay, 2023. English. ⟨NNT : 2023UPASG065⟩. ⟨tel-04496040⟩