135 citations · 211 across the 20 of their papers we have counts for
5 papers · 1 filter
Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors
Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz +1
Given an undirected graph the NP-hard Strong Triadic Closure (STC) problem asks for a labeling of the edges as \emph{weak} and \emph{strong} such that at most edges a…
Finding a Small Number of Colourful Components
Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin +3
A partition of the vertex set of a graph with a (not necessarily proper) colouring is colourful if no two vertices in any have the same colour and…
Aggregation over Metric Spaces: Proposing and Voting in Elections, Budgeting, and Legislation
Laurent Bulteau, Gal Shahaf, Ehud Shapiro +1
We present a unifying framework encompassing many social choice settings. Viewing each social choice setting as voting in a suitable metric space, we consider a general model of so…
Tight Hardness Results for Consensus Problems on Circular Strings and Time Series
Laurent Bulteau, Vincent Froese, Rolf Niedermeier
Consensus problems for strings and sequences appear in numerous application contexts, ranging from bioinformatics over data mining to machine learning. Closing some gaps in the lit…
The Clever Shopper Problem
Laurent Bulteau, Danny Hermelin, Anthony Labarre +1
We investigate a variant of the so-called "Internet Shopping Problem" introduced by Blazewicz et al. (2010), where a customer wants to buy a list of products at the lowest possible…