Logiciel
Publications
Publications
-
-
Pré-publication, Document de travail
Felipe V. Furquim, Daniel Cordeiro, Valentin Dardilhac, Johanne Cohen. Characterizing Strategyproofness Through Score Functions in Voting Mechanisms. 2025. ⟨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. ICLR 2025 – The Thirteenth International Conference on Learning Representations, Apr 2025, Singapore (SG), 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-24, Thirty-Third 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. 2024. ⟨hal-04693345⟩
-
Rapport
Thomas Bellitto, Johanne Cohen, Bruno Escoffier, Nguyen Minh Khang, Mikaël Rabie. Canadian Traveller Problems in Temporal Graphs. ArXiv. 2024. ⟨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-04559959⟩
-
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, ⟨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⟩
-
Communication dans un congrès
Marc Velay, Bich-Liên Doan, Arpad Rimmel, Fabrice Popineau, Fabrice Daniel. Benchmarking Robustness of Deep Reinforcement Learning approaches to Online Portfolio Management. 2023 International Conference on Innovations in Intelligent Systems and Applications (INISTA), Sep 2023, Hammamet, Tunisia. pp.1-6, ⟨10.1109/INISTA59065.2023.10310402⟩. ⟨hal-04473989⟩
-
Communication dans un congrès
Hugo Thimonier, Fabrice Popineau, Arpad Rimmel, Bich-Liên Doan. Beyond Individual Input for Deep Anomaly Detection on Tabular Data. 2nd Table Representation Learning Workshop @ NeurIPS 2023, Dec 2023, New Orleans, United States. ⟨10.48550/arXiv.2305.15121⟩. ⟨hal-04473993⟩
-
Communication dans un congrès
George Manoussakis. An output sensitive algorithm for maximal clique enumeration in sparse graphs. International Symposium on Parameterized and Exact Computation, Sep 2017, Vienna, Austria. ⟨hal-01687111⟩
-
Pré-publication, Document de travail
Florent Hivert, Vincent Pilaud. Signaletic operads. 2019. ⟨hal-02997608⟩
-
Communication dans un congrès
Florent Hivert, Vincent Pilaud. Signaletic operads. FPSAC 2020 – 32nd International Conference on Formal Power Series and Algebraic Combinatorics, Jul 2020, online, France. pp.#6. ⟨hal-02997738⟩
-
Article dans une revue
Bérénice Delcroix-Oger, Florent Hivert, Patxi Laborde-Zubieta, Jean-Christophe Aval, Adrien Boussicault. Non-Ambiguous Trees: new results and generalisation. European Journal of Combinatorics, 2021, 95, pp.103331. ⟨10.1016/j.ejc.2021.103331⟩. ⟨hal-03165269v2⟩
-
Article dans une revue
Johanne Cohen, A. Fauquette, Jean-Michel Fourneau, G.C. Noukela, N. Pekergin. Convex Stochastic Bounds and Stochastic Optimisation on Graphs. Electronic Notes in Theoretical Computer Science, 2018, 337, pp.23 – 44. ⟨10.1016/j.entcs.2018.03.032⟩. ⟨hal-01832118⟩
-
Communication dans un congrès
Shaull Almagor, Nathann Cohen, Guillermo A. Pérez, Mahsa Shirmohammadi, James Worrell. Coverability in 1-VASS with Disequality Tests. 31st International Conference on Concurrency Theory, CONCUR 2020, Aug 2020, Vienna, Austria. pp.38:1–38:20, ⟨10.4230/LIPIcs.CONCUR.2020.38⟩. ⟨hal-03064637⟩
-
Communication dans un congrès
Albane Saintenoy, Emmanuel Léger, Christophe Grenier, N.M. Thiéry. Perspectives in Ground-Penetrating Radar at High Latitudes: From Occasional Imaging to Automated Continuous Monitoring. NSG2021 27th European Meeting of Environmental and Engineering Geophysics – Near Surface Geoscience’21, Aug 2021, Bordeaux & Online, France. pp.1-5, ⟨10.3997/2214-4609.202120205⟩. ⟨hal-04455388⟩
-
Article dans une revue
Léo Kulinski, Josué Moreau. Jonglerie Musicale : Quand les notes de musique subissent la gravité. Pousses de chercheurs & chercheuses, 2023, 1, pp.6-7. ⟨hal-04449632⟩
-
Article dans une revue
Florent Hivert, Nefton Pali. Multiple Lie Derivatives and Forests. Advances in Mathematics, 2019, 354, pp.106732. ⟨10.1016/j.aim.2019.106732⟩. ⟨hal-02349044⟩
-
Pré-publication, Document de travail
Jonas Sénizergues. Minimum colored maximum matching is NP-hard on trees. 2018. ⟨hal-01827567⟩