Two Edge-Disjoint Hop-Constrained Paths and Polyhedra. - David Huygens; Ali Ridha Mahjoub; Pierre Pesneau (SIAM J. Discret. Math., 2004)

On the k edge-disjoint 2-hop-constrained paths polytope. - Geir Dahl; David Huygens; Ali Ridha Mahjoub; Pierre Pesneau (Oper. Res. Lett., 2006)

The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut. - David Huygens; Martine Labbé; Ali Ridha Mahjoub; Pierre Pesneau (Networks, 2007)

Integer programming formulations for the two 4-hop-constrained paths problem. - David Huygens; Ali Ridha Mahjoub (Networks, 2007)

Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships. - Julie Christophe; Sophie Dewez; Jean-Paul Doignon; Gilles Fasbender; Philippe Grégoire; David Huygens; Martine Labbé; Sourour Elloumi; Hadrien Mélot; Hande Yaman (Networks, 2008)