| Succinct encodings of graph isomorphism B Das, P Scharpfenecker, J Torán Language and Automata Theory and Applications: 8th International Conference …, 2014 | 10 | 2014 |
| CNF and DNF succinct graph encodings B Das, P Scharpfenecker, J Torán Information and Computation 253, 436-447, 2017 | 8 | 2017 |
| On the structure of solution-graphs for boolean formulas P Scharpfenecker Fundamentals of Computation Theory: 20th International Symposium, FCT 2015 …, 2015 | 5 | 2015 |
| 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 | 3 | 2015 |
| Solution-graphs of boolean formulas and isomorphism P Scharpfenecker, J Torán Journal on Satisfiability, Boolean Modeling and Computation 10 (1), 37-58, 2016 | 2 | 2016 |
| Bounded-Depth Succinct Encodings and the Structure they Imply on Graphs P Scharpfenecker Theory of Computing Systems 62, 1125-1143, 2018 | 1 | 2018 |
| Problems on succinctly encoded graphs P Scharpfenecker Universität Ulm, 2017 | | 2017 |
| Often harder than in the Constructive Case: Destructive Bribery in CP-nets D Krüger, B Dorn, P Scharpfenecker | | 2015 |
| Institute of Theoretical Computer Science Teaching A für schwierige Probleme, A Spieltheorie, A zur Sequenzanalyse, ... | | |
Bireswar DasAssociate Professor, IIT GandhinagarVerified email at iitgn.ac.in
