Pierre Hoppenot

According to our database, Pierre Hoppenot authored at least 7 papers between 2023 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2025

Correction: Regular packing of rooted hyperforests with root constraints in hypergraphs.

Pierre Hoppenot, Mathis Martin, Zoltán Szigeti

Math. Program., September, 2025

Regular packing of rooted hyperforests with root constraints in hypergraphs.

Pierre Hoppenot, Mathis Martin, Zoltán Szigeti

Math. Program., September, 2025

Determining a graph from its reconfiguration graph.

Gaétan Berthe, Caroline Brosse, Brian Hearn, Jan van den Heuvel, Pierre Hoppenot, Théo Pierron

CoRR, April, 2025

2024

On reversing arcs to improve arc-connectivity.

Pierre Hoppenot, Zoltán Szigeti

Inf. Process. Lett., February, 2024

Augmenting a hypergraph to have a matroid-based (f,g)-bounded (α,β)-limited packing of rooted hypertrees.

Pierre Hoppenot, Zoltán Szigeti

CoRR, 2024

On arborescence packing augmentation in hypergraphs.

Pierre Hoppenot, Zoltán Szigeti

CoRR, 2024

2023

Packing forests.

Pierre Hoppenot, Mathis Martin, Zoltán Szigeti

CoRR, 2023