Search - Equipe : Graphes, Algorithmes et Combinatoire Access content directly

Filter your results

364 Results
Image document

Asymptotic behaviour of the one-dimensional ``rock-paper-scissors'' cyclic cellular automaton

Benjamin Hellouin de Menibus , Yvan Le Borgne
Annals of Applied Probability, 2021, 31 (5), pp.2420-2440. ⟨10.1214/20-AAP1651⟩
Journal articles hal-02084842v2
Image document

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 of Graph Algorithms and Applications, 2020, 24 (3), pp.133-153. ⟨10.7155/jgaa.00522⟩
Journal articles hal-04113890v1

On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts

Pierre Bergé , Wassim Bouaziz , Arpad Rimmel , Joanna Tomasik
SIAM Journal on Discrete Mathematics, 2023, 37 (2), pp.964-996. ⟨10.1137/21M1398203⟩
Journal articles hal-04169401v1

Using Jupyter for Reproducible Scientific Workflows

Marijan Beg , Juliette Taka , Thomas Kluyver , Alexander Konovalov , Min Ragan-Kelley , et al.
Computing in Science and Engineering, 2021, 23 (2), pp.36-46. ⟨10.1109/MCSE.2021.3052101⟩
Journal articles hal-03637827v1

Tropical paths in vertex-colored graphs

Johanne Cohen , Giuseppe Italiano , Yannis Manoussakis , Nguyen Kim Thang , Hong Phong Pham
Journal of Combinatorial Optimization, 2021, 42 (3), pp.476--498. ⟨10.1007/s10878-019-00416-y⟩
Journal articles hal-03508306v1
Image document

The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs

Johanne Cohen , Jonas Lefèvre , Khaled Maamra , George Manoussakis , Laurence Pilard
Theoretical Computer Science, 2019, 782, pp.54-78. ⟨10.1016/j.tcs.2019.02.031⟩
Journal articles hal-02365373v1
Image document

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

On efficient radio resource calendaring in cloud radio access network

Mira Morcos , Jocelyne Elias , Fabio Martignon , Tijani Chahed , Lin Chen
Computer Networks, 2019, 162, pp.106862:1-106862:13. ⟨10.1016/j.comnet.2019.106862⟩
Journal articles hal-03107202v1
Image document

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
Image document

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
Image document

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
Image document

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
Image document

Unique (Optimal) Solutions: Complexity Results for Identifying and Locating-Dominating Codes

Olivier Hudry , Antoine Lobstein
Theoretical Computer Science, 2019, 767, pp.83-102. ⟨10.1016/j.tcs.2018.09.034⟩
Journal articles hal-01884809v1
Image document

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
Image document

The Compared Costs of Domination, Location-Domination and Identification

Olivier Hudry , Antoine Lobstein
Discussiones Mathematicae Graph Theory, 2020, 40 (1), pp.127-147. ⟨10.7151/dmgt.2129⟩
Journal articles hal-01702966v1

Anytime Backtrack Unimodal Bandits and Applications to Cloud Computing,

Stephan Kunne , Lorenzo Maggi , Johanne Cohen , Xu Xinneng
IFIP Networking Conference (Networking), Jun 2020, Paris, France. pp.82-90, ⟨10.1007/s11276-017-1629-4⟩
Conference papers hal-03008647v1
Image document

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 of Parallel and Distributed Computing, 2021, 150, pp.34-45. ⟨10.1016/j.jpdc.2020.12.005⟩
Journal articles hal-02405735v3
Image document

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
Image document

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
Image document

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
Image document

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
Image document

The weak order on Weyl posets

Joël Gay , Vincent Pilaud
Canadian Journal of Mathematics, 2020, 72 (4), pp.867-899. ⟨10.4153/S0008414X19000063⟩
Journal articles hal-02344060v1

Fixed-Parameter Tractability of Counting Small Minimum (S, T)-Cuts

Pierre Bergé , Benjamin Mouscadet , Arpad Rimmel , Joanna Tomasik
Graph-Theoretic Concepts in Computer Science, pp.79-92, 2019, ⟨10.1007/978-3-030-30786-8_7⟩
Book sections hal-02343993v1

On the parameterized complexity of separating certain sources from the target

Pierre Bergé , Arpad Rimmel , Joanna Tomasik
Theoretical Computer Science, 2019, 795, pp.183-193. ⟨10.1016/j.tcs.2019.06.011⟩
Journal articles hal-02343987v1

Multiple Canadians on the road: minimizing the distance competitive ratio

Pierre Bergé , Jean Desmarchelier , Wen Guo , Aurélie Lefebvre , Arpad Rimmel , et al.
Journal of Combinatorial Optimization, 2019, 38 (4), pp.1086-1100. ⟨10.1007/s10878-019-00438-6⟩
Journal articles hal-02343983v1

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
Image document

Backbone colouring and algorithms for TDMA scheduling

Julien Bensmail , Thibaut Blanc , Nathann Cohen , Frédéric Havet , Leonardo Rocha
Discrete Mathematics and Theoretical Computer Science, 2019, Vol. 21 no. 3 (3), pp.#24. ⟨10.23638/DMTCS-21-3-24⟩
Journal articles hal-01851600v4
Image document

The Rise-Contact involution on Tamari intervals

Viviane Pons
The Electronic Journal of Combinatorics, 2019
Journal articles hal-02145887v1

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
Image document

Necessary conditions for tiling finitely generated amenable groups

Benjamin Hellouin de Menibus , Hugo Maturana Cornejo
2019
Preprints, Working Papers, ... hal-02092905v1