Peter Fulla

According to our database, Peter Fulla authored at least 9 papers between 2015 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

A Fixed-Parameter Branching Algorithm for Chromatic Correlation Clustering.

Kensuke Oowa, Peter Fulla, Takuro Fukunaga

Proceedings of the Algorithms and Complexity - 14th International Conference, 2025

2024

NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam.

Taisei Otsuji, Peter Fulla, Takuro Fukunaga

Proceedings of the Computing and Combinatorics - 30th International Conference, 2024

2021

Inequity aversion pricing over social networks: Approximation algorithms and hardness results.

Georgios Amanatidis, Peter Fulla, Evangelos Markakis, Krzysztof Sornat

Theor. Comput. Sci., 2021

2019

The Complexity of Boolean Surjective General-Valued CSPs.

Peter Fulla, Hannes Uppman, Stanislav Zivný

ACM Trans. Comput. Theory, 2019

2018

On the valued constraint satisfaction problem.

Peter Fulla

PhD thesis, 2018

2017

On planar valued CSPs.

Peter Fulla, Stanislav Zivný

J. Comput. Syst. Sci., 2017

The Complexity of Boolean Surjective General-Valued CSPs.

Peter Fulla, Stanislav Zivný

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016

A Galois Connection for Weighted (Relational) Clones of Infinite Size.

Peter Fulla, Stanislav Zivný

ACM Trans. Comput. Theory, 2016

2015

A Galois Connection for Valued Constraint Languages of Infinite Size.

Peter Fulla, Stanislav Zivný

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015