Often Harder than in the Constructive Case: Destructive Bribery in CP-nets. - Britta Dorn; Dominikus Krüger; Patrick Scharpfenecker (WINE, 2015)

Succinct Encodings of Graph Isomorphism. - Bireswar Das; Patrick Scharpfenecker; Jacobo Torán (Electron. Colloquium Comput. Complex., 2015)

On the structure of Solution-Graphs for Boolean Formulas. - Patrick Scharpfenecker (Electron. Colloquium Comput. Complex., 2015)

Solution-Graphs of Boolean Formulas and Isomorphism. - Patrick Scharpfenecker; Jacobo Torán (J. Satisf. Boolean Model. Comput., 2016)

CNF and DNF succinct graph encodings. - Bireswar Das; Patrick Scharpfenecker; Jacobo Torán (Inf. Comput., 2017)

Problems on succinctly encoded graphs - Patrick Scharpfenecker (2017)

Bounded-Depth Succinct Encodings and the Structure they Imply on Graphs. - Patrick Scharpfenecker (Theory Comput. Syst., 2018)