Georgios Amanatidis, Peter Fulla, Evangelos Markakis, Krzysztof Sornat. Inequity aversion pricing over social networks: Approximation algorithms and hardness results. Theoretical Computer Science. 2021. 871. 62-78
P. Fulla, H. Uppman, S. Živný. The Complexity of Boolean Surjective General-Valued CSPs. Transactions on Computation Theory. 2018. 11. 1. 4:1-4:31
P. Fulla, S. Živný. On Planar Valued CSPs. Journal of Computer and System Sciences. 2017. 87. 104-118
P. Fulla, S. Živný. The Complexity of Boolean Surjective General-Valued CSPs. 42nd International Symposium on Mathematical Foundations of Computer Science. 2017. 4:1-4:14
P. Fulla, S. Živný. A Galois Connection for Weighted (Relational) Clones of Infinite Size. Transactions on Computation Theory. 2016. 8. 3. 9:1-9:21