30 citations · 100 across the 41 of their papers we have counts for
6 papers · 1 filter
The Influence of Agent Models on the Complexity of Bus Routing
Eva Deltl, Christian Komusiewicz, Jurek Rostalsky +2
In bus routing, the task is to plan a bus route in a network with several agents, each of whom wants to travel from a starting point to a destination. A bus route should account fo…
Clustering with Locally Bounded Ignorance
Jaroslav Garvardt, Christian Komusiewicz
In Correlation Clustering, the input is a graph with weight function and the task is to partition the vertex set into clusters such that the total…
Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial
Christian Komusiewicz, Nils Morawietz
A vertex set in a graph is a valid -swap for a vertex cover of if has size at most and , the symmetric differenc…
On the Hardness of Finding Temporally Connected Subgraphs of Any Size
Arnaud Casteigts, Christian Komusiewicz, Nils Morawietz
Temporal graphs are graphs whose edges are present only at certain points in time. Reachability in these graphs is defined via temporal paths, in which edges are traversed in incre…
The Descriptive Complexity of Relation Modification Problems
Florian Chudigiewitsch, Marlene Gründel, Christian Komusiewicz +2
A relation modification problem gets a logical structure and a natural number k as input and asks whether k modifications of the structure suffice to make it satisfy a predefined p…
A Parameterized-Complexity Framework for Finding Local Optima
Robert Ganian, Hung P. Hoang, Christian Komusiewicz +1
Local search is a fundamental optimization technique that is both widely used in practice and deeply studied in theory, yet its computational complexity remains poorly understood.…