Ronald de Haan

works on

algorithm design 1 bounded variable occurrence 1 color structures 1 complexity dichotomy 1 monotone sat 1

From the 1 of 3 linked papers with an AI index.

collaborators

3 papers

cs.CC2026

Color Structures and the Monotone Satisfiability Problem with Bounded Variable Occurrence

Hannah Van Santvliet, Ronald de Haan

The paper investigates a restricted monotone 3‑SAT variant where each variable appears at most k times positively and exactly once negatively, and proves that for k = 3 or 4 every…

cs.LO2026

The Model Checking Problem for Distributed Knowing How is $I^_{2}^{p}$ -Complete

Ziqi Wang, Ronald de Haan

We investigate the complexity of the model checking problem for distributed knowing how. We show that the problem is $I^_{2}^{p}$ -complete.

cs.GT2025

Apportionment with Weighted Seats

Julian Chingoma, Ulle Endriss, Ronald de Haan +2

Apportionment is the task of assigning resources to entities with different entitlements in a fair manner, and specifically a manner that is as proportional as possible. The best-k…

Color Structures and the Monotone Satisfiability Problem with Bounded Variable Occurrence

The Model Checking Problem for Distributed Knowing How is I^2p​-Complete

Apportionment with Weighted Seats

The Model Checking Problem for Distributed Knowing How is $I^_{2}^{p}$ -Complete