Peter Fulla

发表

The Complexity of Boolean Surjective General-Valued CSPs

Stanislav Zivny, Peter Fulla, Stanislav Živný, 2017, MFCS.

On Planar Valued CSPs

Stanislav Zivny, Peter Fulla, 2016, MFCS.

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

Stanislav Zivny, Peter Fulla, 2016, TOCT.

On the valued constraint satisfaction problem

Peter Fulla, 2018 .

A Galois Connection for Valued Constraint Languages of Infinite Size pdf

Stanislav Zivny, Peter Fulla, 2015, ICALP.

On planar valued CSPs

Stanislav Zivny, Peter Fulla, 2017, J. Comput. Syst. Sci..

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

Evangelos Markakis, Peter Fulla, Georgios Amanatidis, 2021, Theor. Comput. Sci..