Patrick Scharpfenecker

Orcid: 0000-0002-2479-9158

Affiliations:
  • University of Ulm, Institute of Theoretical Computer Science, Germany


According to our database1, Patrick Scharpfenecker authored at least 7 papers between 2014 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

2017
Problems on succinctly encoded graphs
PhD thesis, 2017

CNF and DNF succinct graph encodings.
Inf. Comput., 2017

2016
Solution-Graphs of Boolean Formulas and Isomorphism.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

2015
Often Harder than in the Constructive Case: Destructive Bribery in CP-nets.
Proceedings of the Web and Internet Economics - 11th International Conference, 2015

On the Structure of Solution-Graphs for Boolean Formulas.
Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

2014
Succinct Encodings of Graph Isomorphism.
Proceedings of the Language and Automata Theory and Applications, 2014


  Loading...