Pierre Hoppenot

11 papers Journal 11
YearRankTypeTitle / Venue / Authors
2026 J jnl
Augmenting a hypergraph to have a matroid-based (f,g)-bounded (α,β)-limited packing of rooted hypertrees.
Discret. Appl. Math.
Pierre Hoppenot, Zoltán Szigeti
2026 J jnl
On arborescence packing augmentation in hypergraphs.
Discret. Math.
Pierre Hoppenot, Zoltán Szigeti
2025 J jnl
Arc-consistency with linear programming reduced costs (applied to stable set in chordal graphs).
Artif. Intell.
Guillaume Claus, Hadrien Cambazard, Hugo Apeloig, Pierre Hoppenot
2025 J jnl
Correction: Regular packing of rooted hyperforests with root constraints in hypergraphs.
Math. Program.
Pierre Hoppenot, Mathis Martin, Zoltán Szigeti
2025 J jnl
Determining a graph from its reconfiguration graph.
CoRR
Gaétan Berthe, Caroline Brosse, Brian Hearn, Jan van den Heuvel, Pierre Hoppenot, Théo Pierron
2025 J jnl
Regular packing of rooted hyperforests with root constraints in hypergraphs.
Math. Program.
Pierre Hoppenot, Mathis Martin, Zoltán Szigeti
2024 J jnl
Augmenting a hypergraph to have a matroid-based (f,g)-bounded (α,β)-limited packing of rooted hypertrees.
CoRR
Pierre Hoppenot, Zoltán Szigeti
2024 J jnl
On arborescence packing augmentation in hypergraphs.
CoRR
Pierre Hoppenot, Zoltán Szigeti
2024 J jnl
On reversing arcs to improve arc-connectivity.
Inf. Process. Lett.
Pierre Hoppenot, Zoltán Szigeti
2023 J jnl
On reversing arcs to improve arc-connectivity.
CoRR
Pierre Hoppenot, Zoltán Szigeti
2023 J jnl
Packing forests.
CoRR
Pierre Hoppenot, Mathis Martin, Zoltán Szigeti