| Inequity aversion pricing over social networks: Approximation algorithms and hardness results G Amanatidis, P Fulla, E Markakis, K Sornat Theoretical Computer Science 871, 62-78, 2021 | 13 | 2021 |
| A Galois connection for valued constraint languages of infinite size P Fulla, S Živný Automata, Languages, and Programming: 42nd International Colloquium, ICALP …, 2015 | 11 | 2015 |
| The complexity of Boolean surjective general-valued CSPs P Fulla, H Uppman, S Živný ACM Transactions on Computation Theory (TOCT) 11 (1), 1-31, 2018 | 8 | 2018 |
| A Galois connection for weighted (relational) clones of infinite size P Fulla, S Živný ACM Transactions on Computation Theory (TOCT) 8 (3), 1-21, 2016 | 7 | 2016 |
| On planar valued CSPs P Fulla, S Živný Journal of Computer and System Sciences 87, 104-118, 2017 | 3 | 2017 |
| 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017) R Impagliazzo, V Kabanets, A Kolokolova, P McKenzie, S Romani, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2017 | 3 | 2017 |
| On the valued constraint satisfaction problem P Fulla University of Oxford, 2018 | | 2018 |
