Peter Fulla

14 papers B 2Journal 8Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam.
CoRR
Taisei Otsuji, Peter Fulla, Takuro Fukunaga
2025 — conf
A Fixed-Parameter Branching Algorithm for Chromatic Correlation Clustering.
CIAC (2)
Kensuke Oowa, Peter Fulla, Takuro Fukunaga
2024 — conf
NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam.
COCOON (1)
Taisei Otsuji, Peter Fulla, Takuro Fukunaga
2021 J jnl
Inequity aversion pricing over social networks: Approximation algorithms and hardness results.
Theor. Comput. Sci.
Georgios Amanatidis, Peter Fulla, Evangelos Markakis, Krzysztof Sornat
2019 J jnl
The Complexity of Boolean Surjective General-Valued CSPs.
ACM Trans. Comput. Theory
Peter Fulla, Hannes Uppman, Stanislav Zivný
2018 — —
On the valued constraint satisfaction problem.
Peter Fulla
2017 J jnl
On planar valued CSPs.
J. Comput. Syst. Sci.
Peter Fulla, Stanislav Zivný
2017 B conf
The Complexity of Boolean Surjective General-Valued CSPs.
MFCS
Peter Fulla, Stanislav Zivný
2017 J jnl
The complexity of Boolean surjective general-valued CSPs.
CoRR
Peter Fulla, Stanislav Zivný
2016 J jnl
A Galois Connection for Weighted (Relational) Clones of Infinite Size.
ACM Trans. Comput. Theory
Peter Fulla, Stanislav Zivný
2016 B conf
On Planar Valued CSPs.
MFCS
Peter Fulla, Stanislav Zivný
2016 J jnl
On Planar Valued CSPs.
CoRR
Peter Fulla, Stanislav Zivný
2015 — conf
A Galois Connection for Valued Constraint Languages of Infinite Size.
ICALP (1)
Peter Fulla, Stanislav Zivný
2015 J jnl
A Galois Connection for Valued Constraint Languages of Infinite Size.
CoRR
Peter Fulla, Stanislav Zivný