A Galois Connection for Valued Constraint Languages of Infinite Size. - Peter Fulla; Stanislav Zivný (ICALP (1), 2015)

A Galois Connection for Weighted (Relational) Clones of Infinite Size. - Peter Fulla; Stanislav Zivný (ACM Trans. Comput. Theory, 2016)

The Complexity of Boolean Surjective General-Valued CSPs. - Peter Fulla; Stanislav Zivný (MFCS, 2017)

On planar valued CSPs. - Peter Fulla; Stanislav Zivný (J. Comput. Syst. Sci., 2017)

On the valued constraint satisfaction problem. - Peter Fulla (2018)

The Complexity of Boolean Surjective General-Valued CSPs. - Peter Fulla; Hannes Uppman; Stanislav Zivný (ACM Trans. Comput. Theory, 2019)

Inequity aversion pricing over social networks: Approximation algorithms and hardness results. - Georgios Amanatidis; Peter Fulla; Evangelos Markakis; Krzysztof Sornat (Theor. Comput. Sci., 2021)

NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam. - Taisei Otsuji; Peter Fulla; Takuro Fukunaga (COCOON (1), 2024)

A Fixed-Parameter Branching Algorithm for Chromatic Correlation Clustering. - Kensuke Oowa; Peter Fulla; Takuro Fukunaga (CIAC (2), 2025)