Planar CPG graphs. - Nicolas Champseix; Esther Galby; Bernard Ries (CoRR, 2018)

Complexity and lowers bounds for Power Edge Set Problem. - Benoît Darties; Nicolas Champseix; Annie Chateau; Rodolphe Giroudeau; Mathias Weller (J. Discrete Algorithms, 2018)

CPG graphs: Some structural and hardness results. - Nicolas Champseix; Esther Galby; Andrea Munaro; Bernard Ries (Discret. Appl. Math., 2021)