E-LIB Suche - Ergebnisse für: Rambaud, Clément

1

Subdivisions in dicritical digraphs with large order or dig..:

Picasarri-Arrieta, Lucas ; Rambaud, Clément
European Journal of Combinatorics. 122 (2024) - p. 104022 , 2024

Link: https://doi.org/10.1016/..

2

Neighborhood Complexity of Planar Graphs:

Joret, Gwenaël ; Rambaud, Clément
Combinatorica. , 2024

Link: https://doi.org/10.1007/..

3

On the Minimum Number of Arcs in $\boldsymbol{k}$-Dicriti..:

Aboulker, Pierre ; Bellitto, Thomas ; Havet, Frédéric.
SIAM Journal on Discrete Mathematics. 38 (2024) 2 - p. 1863-1901 , 2024

Link: https://doi.org/10.1137/..

4

On the minimum number of arcs in 4‐dicritical oriented grap..:

Havet, Frédéric ; Picasarri‐Arrieta, Lucas ; Rambaud, Clément
Journal of Graph Theory. , 2024

Link: https://doi.org/10.1002/..

5

On the Minimum Number of Arcs in 4-Dicritical Oriented Grap..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Havet, Frédéric ; Picasarri-Arrieta, Lucas ; Rambaud, Clément - p. 376-387 , 2023

Link: https://doi.org/10.1007/..

6

Preference swaps for the stable matching problem:

Eiben, Eduard ; Gutin, Gregory ; Neary, Philip R....
Theoretical Computer Science. 940 (2023) - p. 222-230 , 2023

Link: https://doi.org/10.1016/..

7

On the Dichromatic Number of Surfaces:

, In: Trends in Mathematics; Extended Abstracts EuroComb 2021,

Aboulker, Pierre ; Havet, Frédéric ; Knauer, Kolja. - p. 181-187 , 2021

Link: https://doi.org/10.1007/..

8

Subdivisions in dicritical digraphs with large order or dig..:

Picasarri-Arrieta, Lucas ; Rambaud, Clément
http://arxiv.org/abs/2401.05938. , 2024

Link: http://arxiv.org/abs/240..

9

On the minimum number of arcs in $4$-dicritical oriented gr..:

Havet, Frédéric ; Picasarri-Arrieta, Lucas ; Rambaud, Clément
http://arxiv.org/abs/2306.10784. , 2023

Link: http://arxiv.org/abs/230..

10

On the Minimum Number of Arcs in 4-Dicritical Oriented Grap..:

Havet, Frédéric ; Picasarri-Arrieta, Lucas ; Rambaud, Clément
info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-031-43380-1_27. , 2023

Link: https://hal.science/hal-..

11

On the minimum number of arcs in k-dicritical oriented grap..:

Aboulker, Pierre ; Bellitto, Thomas ; Havet, Frédéric.
hal-03985818. , 2023

Link: https://hal.science/hal-..

12

Neighborhood complexity of planar graphs:

Joret, Gwenaël ; Rambaud, Clément
http://arxiv.org/abs/2302.12633. , 2023

Link: http://arxiv.org/abs/230..

13

On the minimum number of inversions to make a digraph $k$-(..:

Duron, Julien ; Havet, Frédéric ; Hörsch, Florian.
http://arxiv.org/abs/2303.11719. , 2023

Link: http://arxiv.org/abs/230..

14

On the minimum number of arcs in k-dicritical oriented grap..:

Aboulker, Pierre ; Bellitto, Thomas ; Havet, Frédéric.
hal-03985818. , 2023

Link: https://hal.science/hal-..

15

On the minimum number of arcs in k-dicritical oriented grap..:

Aboulker, Pierre ; Bellitto, Thomas ; Havet, Frédéric.
hal-03985818. , 2023

Link: https://hal.science/hal-..