Follow
Patrick Scharpfenecker
Title
Cited by
Cited by
Year
CNF and DNF succinct graph encodings
B Das, P Scharpfenecker, J Torán
Information and Computation 253, 436-447, 2017
92017
Succinct encodings of graph isomorphism
B Das, P Scharpfenecker, J Torán
International Conference on Language and Automata Theory and Applications …, 2014
82014
On the structure of solution-graphs for boolean formulas
P Scharpfenecker
International Symposium on Fundamentals of Computation Theory, 118-130, 2015
52015
Often harder than in the constructive case: destructive bribery in CP-nets
B Dorn, D Krüger, P Scharpfenecker
International Conference on Web and Internet Economics, 314-327, 2015
32015
Solution-graphs of boolean formulas and isomorphism
P Scharpfenecker, J Torán
Journal on Satisfiability, Boolean Modeling and Computation 10 (1), 37-58, 2016
22016
Bounded-Depth Succinct Encodings and the Structure they Imply on Graphs
P Scharpfenecker
Theory of Computing Systems 62 (5), 1125-1143, 2018
12018
Problems on succinctly encoded graphs
P Scharpfenecker
Universität Ulm, 2017
2017
Institute of Theoretical Computer Science Teaching
A für schwierige Probleme, A Spieltheorie, P Algorithmen, ...
The system can't perform the operation now. Try again later.
Articles 1–8