Search Results for author:
Found 11 papers, 1 papers with code
Modification-Fair Cluster Editing
The classic Cluster Editing problem (also known as Correlation Clustering) asks to transform a given graph into a disjoint union of cliques (clusters) by a small number of edge modifications.
The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality
In particular, we extend a known polynomial-time algorithm for constant $d$ and convex loss functions to a more general class of loss functions, matching our running time lower bounds also in these cases.
A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem
The NP-hard MATERIAL CONSUMPTION SCHEDULING Problem and closely related problems have been thoroughly studied since the 1980's.
Computer Science and Game Theory F.2.2; G.2.1; I.2.8; I.1.2
A Refined Complexity Analysis of Fair Districting over Graphs
We study the NP-hard Fair Connected Districting problem recently proposed by Stoica et al. [AAMAS 2020]: Partition a vertex-colored graph into k connected components (subsequently referred to as districts) so that in every district the most frequent color occurs at most a given number of times more often than the second most frequent color.
Computer Science and Game Theory Discrete Mathematics
The Complexity of Gerrymandering Over Graphs: Paths and Trees
Roughly speaking, gerrymandering is the systematic manipulation of the boundaries of electoral districts to make a specific (political) party win as many districts as possible.
Data Structures and Algorithms Discrete Mathematics
Bribery and Control in Stable Marriage
We initiate the study of external manipulations in Stable Marriage by considering several manipulative actions as well as several manipulation goals.
Computer Science and Game Theory Discrete Mathematics
As Time Goes By: Reflections on Treewidth for Temporal Graphs
Treewidth is arguably the most important structural graph parameter leading to algorithmically beneficial graph decompositions.
Data Structures and Algorithms Discrete Mathematics
Comparing Temporal Graphs Using Dynamic Time Warping
Recognizing patterns in temporal graphs requires a proximity measure to compare different temporal graphs.
Exact Mean Computation in Dynamic Time Warping Spaces
Dynamic time warping constitutes a major tool for analyzing time series.
Complexity of Shift Bribery in Committee Elections
Given an election, a preferred candidate p, and a budget, the SHIFT BRIBERY problem asks whether p can win the election after shifting p higher in some voters' preference orders.
Elections with Few Voters: Candidate Control Can Be Easy
We study the computational complexity of candidate control in elections with few voters, that is, we consider the parameterized complexity of candidate control in elections with respect to the number of voters as a parameter.
