Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs. - Pierre Cazals; Benoît Darties; Annie Chateau; Rodolphe Giroudeau; Mathias Weller (IWOCA, 2019)

How to Get a Degree-Anonymous Graph Using Minimum Number of Edge Rotations. - Cristina Bazgan; Pierre Cazals; Janka Chlebíková (COCOA, 2020)

Degree-anonymization using edge rotations. - Cristina Bazgan; Pierre Cazals; Janka Chlebíková (Theor. Comput. Sci., 2021)

Communities and anonymization in graphs. (Communautés et anonymisation dans les graphes). - Pierre Cazals (2021)

Dense graph partitioning on sparse and dense graphs. - Cristina Bazgan; Katrin Casel; Pierre Cazals (J. Comput. Syst. Sci., 2025)