research
∙
07/11/2022
Better Collective Decisions via Uncertainty Reduction
We consider an agent community wishing to decide on several binary issue...
share
research
∙
05/29/2022
2-Dimensional Euclidean Preferences
A preference profile with m alternatives and n voters is 2-dimensional E...
research
∙
01/27/2022
An Algorithmic Framework for Locally Constrained Homomorphisms
A homomorphism f from a guest graph G to a host graph H is locally bijec...
research
∙
04/29/2021
Parameterized String Equations
We study systems of String Equations where block variables need to be as...
research
∙
11/23/2018
Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors
Given an undirected graph G=(V,E) the NP-hard Strong Triadic Closure (ST...
research
∙
10/15/2018
Small One-Dimensional Euclidean Preference Profiles
We characterize one-dimensional Euclidean preference profiles with a sma...
research
∙
08/10/2018
Finding a Small Number of Colourful Components
A partition (V_1,...,V_k) of the vertex set of a graph G with a (not nec...
research
∙
04/09/2018
Hardness of Consensus Problems for Circular Strings and Time Series Averaging
Consensus problems for strings and sequences appear in numerous applicat...
research
∙
02/22/2018
