Home

145

52

• 
  Nathalie Aubrun. Dynamique symbolique sur des groupes : une approche informatique. Mathématique discrète [cs.DM]. Université Paris-Saclay, 2021. ⟨tel-03425613⟩
• 
  Vinicius Freitas, Laércio Lima Pilla, Alexandre Santana, Márcio Castro, Johanne Cohen. PackStealLB: A scalable distributed load balancer based on work stealing and workload discretization. Journal of Parallel and Distributed Computing, Elsevier, 2021, 150, pp.34-45. ⟨10.1016/j.jpdc.2020.12.005⟩. ⟨hal-02405735v3⟩
• 
  Nathalie Aubrun, Jarkko Kari. Addendum to "Tilings problems on Baumslag-Solitar groups". 2021. ⟨hal-03126862⟩
• 
  Nathalie Aubrun, Michael Schraudner. Tilings of the hyperbolic plane of substitutive origin as subshifts of finite type on Baumslag-Solitar groups BS(1, n). 2020. ⟨hal-03047740⟩
• 
  Joël Gay, Vincent Pilaud. The weak order on Weyl posets. Canadian Journal of Mathematics, University of Toronto Press, 2020, 72 (4), pp.867-899. ⟨10.4153/S0008414X19000063⟩. ⟨hal-02344060⟩
• 
  Dominique Barth, Thierry Mautor, Dimitri Watel, Marc-Antoine Weisser. Configuration of planar electrical networks with and without double adduction. 2020. ⟨hal-02503854⟩
• 
  Vincent Pilaud, Viviane Pons. The Hopf algebra of integer binary relations. Algebraic Combinatorics, Resurgence, Moulds and Applications (CARMA) Volume 1, European Mathematical Society Publishing House, pp.299-344, 2020, ⟨10.4171/204-1/8⟩. ⟨hal-02469753⟩
• 
  Benjamin Hellouin de Menibus, Yvan Le Borgne. Asymptotic behaviour of the one-dimensional ``rock-paper-scissors'' cyclic cellular automaton. Annals of Applied Probability, Institute of Mathematical Statistics (IMS), In press. ⟨hal-02084842⟩
• 
  Olivier Hudry, Antoine Lobstein. Some Rainbow Problems in Graphs Have Complexity Equivalent to Satisfiability Problems. International Transactions in Operational Research, Wiley, In press. ⟨hal-02916921⟩
• 
  Antoine Lobstein, Olivier Hudry, Irène Charon. Locating-Domination and Identification. T. Haynes, S. Hedetniemi & M. Henning. Topics in Domination in Graphs, pp.251-299, 2020. ⟨hal-02916929⟩
• 
  Olivier Hudry, Antoine Lobstein. The Compared Costs of Domination, Location-Domination and Identification. Discussiones Mathematicae Graph Theory, University of Zielona Góra, 2020, 40 (1), pp.127-147. ⟨10.7151/dmgt.2129⟩. ⟨hal-01702966⟩
• 
  Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes. Study of a Combinatorial Game in Graphs Through Linear Programming. Algorithmica, Springer Verlag, 2020, 82 (2), pp.212-244. ⟨10.1007/s00453-018-0503-9⟩. ⟨hal-01881473⟩
• 
  Johanne Cohen, Jonas Lefèvre, Khaled Maamra, George Manoussakis, Laurence Pilard. The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs. Theoretical Computer Science, Elsevier, 2019, 782, pp.54-78. ⟨10.1016/j.tcs.2019.02.031⟩. ⟨hal-02365373⟩
• 
  Julien Bensmail, Thibaut Blanc, Nathann Cohen, Frédéric Havet, Leonardo Rocha. Backbone colouring and algorithms for TDMA scheduling. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2019, Vol. 21 no. 3 (3), pp.#24. ⟨hal-01851600v4⟩
• 
  Cesar Ceballos, Viviane Pons. The s-weak order and s-permutahedra. 31st International Conference on "Formal Power Series and Algebraic Combinatorics", Jul 2019, Ljubljana, Slovenia. ⟨hal-02473090⟩
• 
  Viviane Pons. The Rise-Contact involution on Tamari intervals. The Electronic Journal of Combinatorics, Open Journal Systems, 2019. ⟨hal-02145887⟩
• 
  Mohamed Lamine Lamali, Simon Lassourreuille, Stephan Kunne, Johanne Cohen. A stack-vector routing protocol for automatic tunneling. IEEE INFOCOM 2019, Apr 2019, Paris, France. ⟨hal-01987354⟩
• 
  Benjamin Hellouin de Menibus, Hugo Maturana Cornejo. Necessary conditions for tiling finitely generated amenable groups. 2019. ⟨hal-02092905⟩
• 
  Olivier Hudry, Antoine Lobstein. Some Results About a Conjecture on Identifying Codes in Complete Suns. International Transactions in Operational Research, Wiley, 2019, 26 (2), pp.732-746. ⟨hal-01613344⟩
• 
  Olivier Hudry, Antoine Lobstein. Complexity of Unique (Optimal) Solutions in Graphs: Vertex Cover and Domination. Journal of Combinatorial Mathematics and Combinatorial Computing, Charles Babbage Research Centre, 2019, 110, pp.217-240. ⟨hal-01613388⟩
• 
  Olivier Hudry, Antoine Lobstein. Unique (Optimal) Solutions: Complexity Results for Identifying and Locating-Dominating Codes. Theoretical Computer Science, Elsevier, 2019, 767, pp.83-102. ⟨10.1016/j.tcs.2018.09.034⟩. ⟨hal-01884809⟩
• 
  Daniel Vanzo. High performances combinatorics using GPUs. [Technical Report] LRI, Univ. Paris-Sud, CNRS, Inria, Université Paris-Saclay. 2018. ⟨hal-01917588⟩
• 
  Vincent Pilaud, Viviane Pons. Algebraic structures on integer posets. FPSAC 2018 - 30th International Conference on Formal Power Series and Algebraic Combinatorics, Jul 2018, Hanover, United States. ⟨hal-01858098⟩
• 
  Justine Falque, Nicolas M. Thiéry. The orbit algebra of a permutation group with polynomial profile is Cohen-Macaulay. 30th International Conference of Formal Power Series and Algebraic Combinatorics (FPSAC 2018), Jul 2018, Hanover, United States. ⟨hal-01763795⟩
• 
  Anaël Grandjean, Benjamin Hellouin de Menibus, Pascal Vanier. Aperiodic points in $\mathbb Z^2$-subshifts. ICALP 2018, Jul 2018, Prague, Czech Republic. ⟨10.4230/LIPIcs.ICALP.2018.496⟩. ⟨hal-01722008v2⟩
• 
  Nathann Cohen, Frédéric Havet, William Lochet, Raul Lopes. Bispindles in strongly connected digraphs with large chromatic number. The Electronic Journal of Combinatorics, Open Journal Systems, 2018. ⟨hal-01810706⟩
• 
  Nathann Cohen, Nicolas Martins, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes, et al.. Spy-game on graphs: Complexity and simple topologies. Theoretical Computer Science, Elsevier, 2018, 725, pp.1 - 15. ⟨10.1016/j.tcs.2017.11.015⟩. ⟨hal-01782246⟩
• 
  Nathann Cohen, Frédéric Havet, William Lochet, Nicolas Nisse. Subdivisions of oriented cycles in digraphs with large chromatic number. Journal of Graph Theory, Wiley, 2018, 89 (4), pp.439-456. ⟨10.1002/jgt.22360⟩. ⟨hal-01834779⟩
• 
  Kaourintin Le Guiban. Hypercubes Latins maximin pour l’echantillonage de systèmes complexes. Autre. Université Paris Saclay (COmUE), 2018. Français. ⟨NNT : 2018SACLC008⟩. ⟨tel-01722842⟩
• 
  Olivier Hudry, Antoine Lobstein. On the Complexity of Determining Whether there is a Unique Hamiltonian Cycle or Path. Journal of Combinatorial Mathematics and Combinatorial Computing, Charles Babbage Research Centre, In press. ⟨hal-01680709⟩