Preprints
- On arborescence packing augmentation in hypergraphs [arXiv]
P. Hoppenot, Z. Szigeti. - Augmenting a hypergraph to have a matroid-based (f,g)-bounded (α,β)-limited packing of rooted hypertrees [arXiv]
P. Hoppenot, Z. Szigeti. - Determining a graph from its reconfiguration graph [arXiv]
G. Berthe, C. Brosse, B. Hearn, J. Heuvel, P. Hoppenot, T. Pierron.
Publications
- Regular packing of rooted hyperforests with root constraints in hypergraphs [arXiv]
P. Hoppenot, M. Martin, Z. Szigeti, Math. Program. (2025). - On reversing arcs to improve arc-connectivity [arXiv]
P. Hoppenot, Z. Szigeti, Information Processing Letters, Volume 184, 2024, 106434.