|
|
Asymptotic behaviour of the one-dimensional ``rock-paper-scissors'' cyclic cellular automaton
Benjamin Hellouin de Menibus
,
Yvan Le Borgne
Journal articles
hal-02084842v2
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network
Wilfried Ehounou
,
Dominique Barth
,
Arnaud de Moissac
,
Dimitri Watel
,
Marc-Antoine Weisser
Journal articles
hal-04113890v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts
Pierre Bergé
,
Wassim Bouaziz
,
Arpad Rimmel
,
Joanna Tomasik
Journal articles
hal-04169401v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Using Jupyter for Reproducible Scientific Workflows
Marijan Beg
,
Juliette Taka
,
Thomas Kluyver
,
Alexander Konovalov
,
Min Ragan-Kelley
,
et al.
Journal articles
hal-03637827v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Tropical paths in vertex-colored graphs
Johanne Cohen
,
Giuseppe Italiano
,
Yannis Manoussakis
,
Nguyen Kim Thang
,
Hong Phong Pham
Journal articles
hal-03508306v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs
Johanne Cohen
,
Jonas Lefèvre
,
Khaled Maamra
,
George Manoussakis
,
Laurence Pilard
Journal articles
hal-02365373v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Locating-Domination and Identification
Antoine Lobstein
,
Olivier Hudry
,
Irène Charon
T. Haynes, S. Hedetniemi & M. Henning. Topics in Domination in Graphs, pp.251-299, 2020
Book sections
hal-02916929v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
On efficient radio resource calendaring in cloud radio access network
Mira Morcos
,
Jocelyne Elias
,
Fabio Martignon
,
Tijani Chahed
,
Lin Chen
Journal articles
hal-03107202v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Tilings of the hyperbolic plane of substitutive origin as subshifts of finite type on Baumslag-Solitar groups BS(1, n)
Nathalie Aubrun
,
Michael Schraudner
2020
Preprints, Working Papers, ...
hal-03047740v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
On the Complexity of Determining Whether there is a Unique Hamiltonian Cycle or Path
Olivier Hudry
,
Antoine Lobstein
WSEAS Transactions on Mathematics, 2022, 21, pp.433-446
Journal articles
hal-01680709v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Some Rainbow Problems in Graphs Have Complexity Equivalent to Satisfiability Problems
Olivier Hudry
,
Antoine Lobstein
International Transactions in Operational Research, 2022, 29 (3), pp.1547-1572
Journal articles
hal-02916921v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Some Results About a Conjecture on Identifying Codes in Complete Suns
Olivier Hudry
,
Antoine Lobstein
International Transactions in Operational Research, 2019, 26 (2), pp.732-746
Journal articles
hal-01613344v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Unique (Optimal) Solutions: Complexity Results for Identifying and Locating-Dominating Codes
Olivier Hudry
,
Antoine Lobstein
Journal articles
hal-01884809v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Complexity of Unique (Optimal) Solutions in Graphs: Vertex Cover and Domination
Olivier Hudry
,
Antoine Lobstein
Journal of Combinatorial Mathematics and Combinatorial Computing, 2019, 110, pp.217-240
Journal articles
hal-01613388v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
The Compared Costs of Domination, Location-Domination and Identification
Olivier Hudry
,
Antoine Lobstein
Journal articles
hal-01702966v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Anytime Backtrack Unimodal Bandits and Applications to Cloud Computing,
Stephan Kunne
,
Lorenzo Maggi
,
Johanne Cohen
,
Xu Xinneng
Conference papers
hal-03008647v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
PackStealLB: A scalable distributed load balancer based on work stealing and workload discretization
Vinicius Freitas
,
Laércio Lima Pilla
,
Alexandre Santana
,
Márcio C Castro
,
Johanne Cohen
Journal articles
hal-02405735v3
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Configuration of planar electrical networks with and without double adduction
Dominique Barth
,
Thierry Mautor
,
Dimitri Watel
,
Marc-Antoine Weisser
2020
Preprints, Working Papers, ...
hal-02503854v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
The s-weak order and s-permutahedra
Cesar Ceballos
,
Viviane Pons
31st International Conference on "Formal Power Series and Algebraic Combinatorics", Jul 2019, Ljubljana, Slovenia
Conference papers
hal-02473090v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
The Hopf algebra of integer binary relations
Vincent Pilaud
,
Viviane Pons
Algebraic Combinatorics, Resurgence, Moulds and Applications (CARMA) Volume 1, European Mathematical Society Publishing House, pp.299-344, 2020, ⟨10.4171/204-1/8⟩
Book sections
hal-02469753v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Large hypergraphs of diameter one
Jean-Claude Bermond
,
Johny Bond
,
Jean-François Saclé
Graph theory and Combinatorics, Academic Press, 1984, Cambridge, United Kingdom. pp.19-28
Conference papers
hal-02447161v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
The weak order on Weyl posets
Joël Gay
,
Vincent Pilaud
Journal articles
hal-02344060v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Fixed-Parameter Tractability of Counting Small Minimum (S, T)-Cuts
Pierre Bergé
,
Benjamin Mouscadet
,
Arpad Rimmel
,
Joanna Tomasik
Book sections
hal-02343993v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
On the parameterized complexity of separating certain sources from the target
Pierre Bergé
,
Arpad Rimmel
,
Joanna Tomasik
Journal articles
hal-02343987v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Multiple Canadians on the road: minimizing the distance competitive ratio
Pierre Bergé
,
Jean Desmarchelier
,
Wen Guo
,
Aurélie Lefebvre
,
Arpad Rimmel
,
et al.
Journal articles
hal-02343983v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Fixed-parameter tractability of counting small minimum $(S,T)$-cuts
Pierre Bergé
,
Benjamin Mouscadet
,
Arpad Rimmel
,
Joanna Tomasik
[Research Report] LRI. 2019
Reports
hal-02176346v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Backbone colouring and algorithms for TDMA scheduling
Julien Bensmail
,
Thibaut Blanc
,
Nathann Cohen
,
Frédéric Havet
,
Leonardo Rocha
Journal articles
hal-01851600v4
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
The Rise-Contact involution on Tamari intervals
Viviane Pons
The Electronic Journal of Combinatorics, 2019
Journal articles
hal-02145887v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Fixed-parameter tractability of counting small minimum (S,T)-cuts
Pierre Bergé
,
Benjamin Mouscadet
,
Arpad Rimmel
,
Joanna Tomasik
45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Jun 2019, Vall de Núria, Spain
Conference papers
hal-02105265v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Necessary conditions for tiling finitely generated amenable groups
Benjamin Hellouin de Menibus
,
Hugo Maturana Cornejo
2019
Preprints, Working Papers, ...
hal-02092905v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|