Peter Fulla

MaRDI QIDQ2031047zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
A fixed-parameter branching algorithm for chromatic correlation clustering	2025-11-11	Paper
NP-completeness and physical zero-knowledge proof of Hotaru Beam	2025-06-17	Paper
Inequity aversion pricing over social networks: approximation algorithms and hardness results Theoretical Computer Science	2021-06-08	Paper
The Complexity of Boolean Surjective General-Valued CSPs	2020-05-26	Paper
The Complexity of Boolean Surjective General-Valued CSPs ACM Transactions on Computation Theory	2019-12-16	Paper
The Complexity of Boolean Surjective General-Valued CSPs ACM Transactions on Computation Theory	2019-12-16	Paper
A Galois connection for weighted (relational) clones of infinite size ACM Transactions on Computation Theory	2019-12-06	Paper
A Galois connection for weighted (relational) clones of infinite size ACM Transactions on Computation Theory	2019-12-06	Paper
On Planar Valued CSPs	2018-03-21	Paper
On planar valued CSPs Journal of Computer and System Sciences	2017-05-24	Paper
A Galois connection for valued constraint languages of infinite size Automata, Languages, and Programming	2015-10-27	Paper

Research outcomes over time

This page was built for person: Peter Fulla