Thekla Hamm
YOU?
Author Swipe
View article: On Algorithmic Applications of ℱ-Branchwidth
On Algorithmic Applications of ℱ-Branchwidth Open
F-branchwidth is a framework for width measures of graphs, recently introduced by Eiben et al. [ITCS 2022], that captures tree-width, co-tree-width, clique-width, and mim-width, and several of their generalizations and interpolations. In t…
View article: Computing crossing numbers with topological and geometric restrictions
Computing crossing numbers with topological and geometric restrictions Open
Computing the crossing number of a graph is one of the most classical problems in computational geometry. Both it and numerous variations of the problem have been studied, and overcoming their frequent computational difficulty is an active…
View article: The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width Open
The generic homomorphism problem, which asks whether an input graph \(G\) admits a homomorphism into a fixed target graph \(H\) , has been widely studied in the literature. In this article, we provide a fine-grained complexity classificati…
View article: The Complexity of Envy-Free Graph Cutting
The Complexity of Envy-Free Graph Cutting Open
We consider the problem of fairly dividing a set of heterogeneous divisible resources among agents with different preferences. We focus on the setting where the resources correspond to the edges of a connected graph, every agent must be as…
View article: A Structural Complexity Analysis of Synchronous Dynamical Systems
A Structural Complexity Analysis of Synchronous Dynamical Systems Open
Synchronous dynamic systems are well-established models that have been used to capture a range of phenomena in networks, including opinion diffusion, spread of disease and product adoption. We study the three most notable problems in synch…
View article: Maximizing Social Welfare in Score-Based Social Distance Games
Maximizing Social Welfare in Score-Based Social Distance Games Open
Social distance games have been extensively studied as a coalition formation model where the utilities of agents in each coalition were captured using a utility function $u$ that took into account distances in a given social network. In th…
View article: Maximizing Social Welfare in Score-Based Social Distance Games
Maximizing Social Welfare in Score-Based Social Distance Games Open
Social distance games have been extensively studied as a coalition formation\nmodel where the utilities of agents in each coalition were captured using a\nutility function u that took into account distances in a given social network.\nIn t…
View article: Polynomial-time Approximation of Independent Set Parameterized by Treewidth
Polynomial-time Approximation of Independent Set Parameterized by Treewidth Open
We prove the following result about approximating the maximum independent set in a graph. Informally, we show that any approximation algorithm with a ``non-trivial'' approximation ratio (as a function of the number of vertices of the input…
View article: A Structural Complexity Analysis of Synchronous Dynamical Systems
A Structural Complexity Analysis of Synchronous Dynamical Systems Open
Synchronous dynamical systems are well-established models that have been used to capture a range of phenomena in networks, including opinion diffusion, spread of disease and product adoption. We study the three most notable problems in syn…
View article: Approximate Evaluation of Quantitative Second Order Queries
Approximate Evaluation of Quantitative Second Order Queries Open
Courcelle's theorem and its adaptations to cliquewidth have shaped the field of exact parameterized algorithms and are widely considered the archetype of algorithmic meta-theorems. In the past decade, there has been growing interest in dev…
View article: The Complexity of Envy-Free Graph Cutting
The Complexity of Envy-Free Graph Cutting Open
We consider the problem of fairly dividing a set of heterogeneous divisible resources among agents with different preferences. We focus on the setting where the resources correspond to the edges of a connected graph, every agent must be as…
View article: Hedonic Diversity Games: A Complexity Picture with More than Two Colors
Hedonic Diversity Games: A Complexity Picture with More than Two Colors Open
Hedonic diversity games are a variant of the classical Hedonic games designed to better model a variety of questions concerning diversity and fairness. Previous works mainly targeted the case with two diversity classes (represented as colo…
View article: The Complexity of Temporal Vertex Cover in Small-Degree Graphs
The Complexity of Temporal Vertex Cover in Small-Degree Graphs Open
Temporal graphs naturally model graphs whose underlying topology changes over time. Recently, the problems Temporal Vertex Cover (or TVC) and Sliding-Window Temporal Vertex Cover (or Delta-TVC for time-windows of a fixed-length Delta) have…
View article: The Complexity of Temporal Vertex Cover in Small-Degree Graphs
The Complexity of Temporal Vertex Cover in Small-Degree Graphs Open
Temporal graphs naturally model graphs whose underlying topology changes over time. Recently, the problems TEMPORAL VERTEX COVER (or TVC) and SLIDING-WINDOW TEMPORAL VERTEX COVER(or $Δ$-TVC for time-windows of a fixed-length $Δ$) have been…
View article: Hedonic Diversity Games: A Complexity Picture with More than Two Colors
Hedonic Diversity Games: A Complexity Picture with More than Two Colors Open
Hedonic diversity games are a variant of the classical Hedonic games designed to better model a variety of questions concerning diversity and fairness. Previous works mainly targeted the case with two diversity classes (represented as colo…
View article: The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width Open
The generic homomorphism problem, which asks whether an input graph G admits a homomorphism into a fixed target graph H, has been widely studied in the literature. In this article, we provide a fine-grained complexity classification of the…
View article: Parameterised Partially-Predrawn Crossing Number
Parameterised Partially-Predrawn Crossing Number Open
Inspired by the increasingly popular research on extending partial graph drawings, we propose a new perspective on the traditional and arguably most important geometric graph parameter, the crossing number. Specifically, we define the part…
View article: A Unifying Framework for Characterizing and Computing Width Measures
A Unifying Framework for Characterizing and Computing Width Measures Open
Algorithms for computing or approximating optimal decompositions for decompositional parameters such as treewidth or clique-width have so far traditionally been tailored to specific width parameters. Moreover, for mim-width, no efficient a…
View article: The Parameterized Complexity of Connected Fair Division
The Parameterized Complexity of Connected Fair Division Open
We study the Connected Fair Division problem (CFD), which generalizes the fundamental problem of fairly allocating resources to agents by requiring that the items allocated to each agent form a connected subgraph in a provided item graph G…
View article: The Complexity of Object Association in Multiple Object Tracking
The Complexity of Object Association in Multiple Object Tracking Open
Object association, i.e., the identification of which observations correspond to the same object, is a central task for the area of multiple object tracking. Two prominent models capturing this task have been introduced in the literature: …
View article: Crossing-Optimal Extension of Simple Drawings
Crossing-Optimal Extension of Simple Drawings Open
In extension problems of partial graph drawings one is given an incomplete drawing of an input graph G and is asked to complete the drawing while maintaining certain properties. A prominent area where such problems arise is that of crossin…
View article: Crossing-Optimal Extension of Simple Drawings
Crossing-Optimal Extension of Simple Drawings Open
In extension problems of partial graph drawings one is given an incomplete drawing of an input graph $G$ and is asked to complete the drawing while maintaining certain properties. A prominent area where such problems arise is that of cross…
View article: Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP
Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP Open
We investigate the following many-to-one stable matching problem with diversity constraints (SMTI-DIVERSE): Given a set of students and a set of colleges which have preferences over each other, where the students have overlapping types, an…
View article: The Complexity Landscape of Resource-Constrained Scheduling
The Complexity Landscape of Resource-Constrained Scheduling Open
The Resource-Constrained Project Scheduling Problem (RCPSP) and its extension via activity modes (MRCPSP) are well-established scheduling frameworks that have found numerous applications in a broad range of settings related to artificial i…
View article: Extending Partial 1-Planar Drawings
Extending Partial 1-Planar Drawings Open
Algorithmic extension problems of partial graph representations such as planar graph drawings or geometric intersection representations are of growing interest in topological graph theory and graph drawing. In such an extension problem, we…
View article: Title
Title Open
We consider the problem of counting the number of DAGs which are Markov-equivalent, i.e., which encode the same conditional independencies between random variables. The problem has been studied, among others, in the context of causal disco…
View article: Parameterized Complexity of Envy-Free Resource Allocation in Social Networks
Parameterized Complexity of Envy-Free Resource Allocation in Social Networks Open
We consider the classical problem of allocating resources among agents in an envy-free (and, where applicable, proportional) way. Recently, the basic model was enriched by introducing the concept of a social network which allows to capture…
View article: Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP
Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP Open
We investigate the following many-to-one stable matching problem with diversity constraints (SMTI-Diverse): Given a set of students and a set of colleges which have preferences over each other, where the students have overlapping types, an…