Thèse
Publications
Publications
-
-
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
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 (Full version). European Journal of Combinatorics, 2021, 95, pp.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⟩
-
Thèse
Jonathan Raiman. DeepType: compréhension du langage naturel par l’abstraction. Informatique [cs]. Université Paris-Saclay (2020-..), 2023. Français. ⟨NNT : ⟩. ⟨tel-04454479⟩
-
Thèse
Loric Duhaze. Problème d’accessibilité de marches de rotors dans des graphes. Informatique [cs]. Université Paris-Saclay (2020-..), 2023. Français. ⟨NNT : ⟩. ⟨tel-04454463⟩
-
Article dans une revue
Léo Kulinski, Josué Moreau. Jonglerie Musicale : Quand les notes de musiques 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, ⟨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⟩
-
Article dans une revue
Florent Hivert, Thiéry M. Nicolas. Controlling the C3 Super Class Linearization Algorithm for Large Hierarchies of Classes. Order, 2022, ⟨10.1007/s11083-022-09607-5⟩. ⟨hal-04414603⟩
-
Pré-publication, Document de travail
Hugo Mlodecki. Decompositions of packed words and self duality of Word Quasisymmetric Functions. 2022. ⟨hal-03725331⟩
-
Communication dans un congrès
Pierre Bergé, Jason Crampton, Gregory Gutin, Rémi Watrigant. The Authorization Policy Existence Problem. CODASPY: Conference on Data and Application Security and Privacy, Mar 2017, Scottsdale, United States. pp.163-165, ⟨10.1145/3029806.3029844⟩. ⟨hal-01995978⟩
-
Communication dans un congrès
Zakaria Gheid, Yacine Challal, Lin Chen. Private and Efficient Set Intersection Protocol For RFID-Based Food Adequacy Check. IEEE WCNC, Apr 2018, Barcelone, Spain. ⟨hal-01786000⟩
-
Thèse
Joël Gay. Representation of Monoids and Lattice Structures in the Combinatorics of Weyl Groups. Discrete Mathematics [cs.DM]. Université Paris Saclay (COmUE), 2018. English. ⟨NNT : 2018SACLS209⟩. ⟨tel-01861199⟩
-
Communication dans un congrès
Florian Rabe, Dennis Müller. Structuring Theories with Implicit Morphisms. 24th International Workshop on Algebraic Development Techniques (WADT), Jul 2018, Egham, United Kingdom. pp.154-173, ⟨10.1007/978-3-030-23220-7_9⟩. ⟨hal-02364570⟩
-
Article dans une revue
Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant. Complexity dichotomies for the Minimum F -Overlay problem. Journal of Discrete Algorithms, 2018, 52-53, pp.133-142. ⟨10.1016/j.jda.2018.11.010⟩. ⟨hal-01947563⟩
-
Article dans une revue
Olivier Hudry, Antoine Lobstein. Some Complexity Considerations on the Uniqueness of Graph Colouring. WSEAS Transactions on Mathematics, 2023, 22, pp.art. #54, 483-493. ⟨hal-02287571⟩
-
Article dans une revue
Samantha Brown-Xu, Maria Fumanal, Christophe Gourlaouen, Lea Gimeno, Alessia Quatela, et al.. Intriguing Effects of Halogen Substitution on the Photophysical Properties of 2,9-(Bis)halo-Substituted Phenanthrolinecopper(I) Complexes. Inorganic Chemistry, 2019, 58 (12), pp.7730-7745. ⟨10.1021/acs.inorgchem.9b00042⟩. ⟨hal-02351535⟩
-
Communication dans un congrès
Dennis Müller, Florian Rabe. Rapid Prototyping Formal Systems in MMT: 5 Case Studies. LFMTP 2019 Logical Frameworks and Meta-Languages: Theory and Practice 2019, Jun 2019, Vancouver, Canada. ⟨hal-02150167⟩
-
Thèse
Justine Falque. Classification des groupes P-oligomorphes, conjectures de Cameron et Macpherson. Combinatorics [math.CO]. Université Paris Saclay (COmUE), 2019. English. ⟨NNT : 2019SACLS484⟩. ⟨tel-02420262⟩
-
Thèse
Pierre Bergé. A guide book for the traveller on graphs full of blockages. Computational Complexity [cs.CC]. Université Paris Saclay (COmUE), 2019. English. ⟨NNT : 2019SACLS480⟩. ⟨tel-02887092⟩
-
Communication dans un congrès
Guangyu Li, Chen Gong, Lin Zhao, Jinsong Wu, Lila Boukhatem. An Efficient Reinforcement Learning based Charging Data Delivery Scheme in VANET-Enhanced Smart Grid. 2020 IEEE International Conference on Big Data and Smart Computing (BigComp), Feb 2020, Busan, North Korea. pp.263-270, ⟨10.1109/BigComp48618.2020.00-64⟩. ⟨hal-03001823⟩
-
Article dans une revue
Olivier Hudry, Irène Charon, Antoine Lobstein. Codes in the q-ary Lee Hypercube. WSEAS Transactions on Mathematics, 2022, 21, pp.173-186. ⟨hal-03650634⟩
-
Article dans une revue
Olivier Hudry, Antoine Lobstein. On the Complexity of Determining Whether there is a Unique Hamiltonian Cycle or Path. WSEAS Transactions on Mathematics, 2022, 21, pp.433-446. ⟨hal-03700181⟩
-
Communication dans un congrès
Olivier Hudry, Antoine Lobstein. Complexité du problème de l’unicité d’un transversal minimum dans un graphe. 23ème congrès annuel de la Société Française de Recherche Opérationnelle et d’Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne – Lyon, France. ⟨hal-03596176⟩
-
Communication dans un congrès
Olivier Hudry, Antoine Lobstein. Complexity of the unicity of an optimal vertex cover in graphs. Stockholm Optimization Days 2022, Jun 2022, Stockholm, Sweden. ⟨hal-03714746⟩
-
Article dans une revue
Pierre Bergé, Wassim Bouaziz, Arpad Rimmel, Joanna Tomasik. On the Parameterized Complexity of Counting Small-Sized Minimum (boldsymbol{(S,T)})-Cuts. SIAM Journal on Discrete Mathematics, 2023, 37 (2), pp.964-996. ⟨10.1137/21M1398203⟩. ⟨hal-04408090⟩
-
Communication dans un congrès
Dimitri Watel, Marc-Antoine Weisser, Dominique Barth. Parameterized complexity and approximability of coverability problems in weighted Petri nets. International Conference on Application and Theory of Petri Nets and Concurrency, Jun 2017, Zaragoza, Spain. pp.330-349, ⟨10.1007/978-3-319-57861-3_19⟩. ⟨hal-01459206⟩
-
Thèse
Stefi Nouleho Ilemo. Algorithmique de graphes pour la similarité structurelle de molécules et de réactions. Informatique [cs]. Université Paris – Saclay, 2020. Français. ⟨NNT : 2020UPASG028⟩. ⟨tel-04409326⟩
-
Communication dans un congrès
Emmanuel Goutierre, Christelle Bruni, Johanne Cohen, Hayg Guler, Michèle Sebag. Physics-aware modelling of an accelerated particle cloud. MLPS 2023 – Machine Learning and the Physical Sciences Workshop 23023 – At the 37th conference on Neural Information Processing Systems (NeurIPS), Dec 2023, New Orleans, United States. ⟨hal-04396175⟩
-
Article dans une revue
Hao Li, Weihua He, Qiang Sun. Distributing pairs of vertices on Hamiltonian cycles. Science China Mathematics, In press, ⟨10.1007/s11425-016-9057-x⟩. ⟨hal-01763169⟩
-
Article dans une revue
Hao Li, Paul Balister, Richard Schelp. Decompositions of graphs into cycles with chords. Journal of Combinatorial Theory, Series B, 2018, 128, pp.47 – 65. ⟨10.1016/j.jctb.2017.07.002⟩. ⟨hal-01726045⟩
-
Article dans une revue
Hao Li, Heping Zhang. The isolated-pentagon rule and nice substructures infullerens. Ars Mathematica Contemporanea, 2018, 15 (2), pp.487-497. ⟨10.26493/1855-3974.1359.b33⟩. ⟨hal-02414195⟩
-
Article dans une revue
Weihua He, Hao Li, Qiang Sun. Distributing pairs of vertices on Hamiltonian cycles. Science China Mathematics, 2018, 61 (5), pp.955-972. ⟨10.1007/S11425-016-9057-X⟩. ⟨hal-04406490⟩
-
Article dans une revue
Hao Li, Junqing Cai, Yuzhong Zhang. An implicit degree condition for k -connected 2-heavy graphs to be hamiltonian. Information Processing Letters, 2018, 134, pp.9 – 13. ⟨10.1016/j.ipl.2018.01.010⟩. ⟨hal-01725869⟩
-
Article dans une revue
Weihua He, Hao Li, Qiang Sun. Locating any two vertices on Hamiltonian cycles in large graphs. Discrete Mathematics, 2020, 343 (9), pp.111941. ⟨10.1016/j.disc.2020.111941⟩. ⟨hal-03327198⟩
-
Article dans une revue
Jie Hu, Hao Li, Donglei Yang. Vertex-disjoint rainbow triangles in edge-colored graphs. Discrete Mathematics, 2020, 343 (12), pp.112117. ⟨10.1016/j.disc.2020.112117⟩. ⟨hal-03327197⟩
-
Article dans une revue
Wantao Ning, Hao Li. The generalized measure of edge fault tolerance in exchanged crossed cube. Theoretical Computer Science, 2021, 861, pp.80-84. ⟨10.1016/j.tcs.2021.02.012⟩. ⟨hal-03327199⟩
-
Article dans une revue
Suyun Jiang, Hao Li, Jin Yan. Vertex-disjoint stars in K 1 , r -free graphs. Discrete Applied Mathematics, 2021, 302, pp.189-197. ⟨10.1016/j.dam.2021.07.012⟩. ⟨hal-03327200⟩
-
Article dans une revue
Jie Hu, Hao Li, Shun-Ichi Maezawa. Maximum properly colored trees in edge-colored graphs. Journal of Combinatorial Optimization, 2022, 44 (1), pp.154-171. ⟨10.1007/s10878-021-00824-z⟩. ⟨hal-03872588⟩
-
Article dans une revue
Jie Hu, Hao Li, Yue Wang, Donglei Yang. Graph Tilings in Incompatibility Systems. SIAM Journal on Discrete Mathematics, 2023, 37 (3), pp.1930-1951. ⟨10.1137/22M1506353⟩. ⟨hal-04307348⟩
-
Article dans une revue
Tianjiao Dai, Hao Li, Qiancheng Ouyang, Zengxian Tian. On ( 2 , k ) -Hamilton-connected graphs. Discrete Applied Mathematics, 2024, 343, pp.288-299. ⟨10.1016/j.dam.2023.11.014⟩. ⟨hal-04307062⟩
-
Poster de conférence
Emmanuel Goutierre, Christelle Bruni, Johanne Cohen, Hayg Guler, Michèle Sebag. Surrogate Model for Linear Accelerator: A fast Neural Network approximation of ThomX’s simulator. IPAC 2023 – 14th International Particle Accelerator Conference, May 2023, Venice, Italy. JACoW Publishing, JACoW, IPAC2023, pp.4514-4517, 2023, ⟨10.18429/JACoW-IPAC2023-THPL039⟩. ⟨hal-04396183⟩
-
Pré-publication, Document de travail
Cesar Ceballos, Viviane Pons. The s-weak order and s-permutahedra II: the combinatorial complex of pure intervals. 2023. ⟨hal-04390514⟩