research
∙
08/29/2023
The Parametrized Complexity of the Segment Number
Given a straight-line drawing of a graph, a segment is a maximal set of ...
share
research
∙
07/10/2023
Growing Fast without Colliding: Polylogarithmic Time Step Construction of Geometric Shapes
Building on two recent models of [Almalki and Michail, 2022] and [Gupta ...
research
∙
05/01/2023
Collision Detection for Modular Robots – it is easy to cause collisions and hard to avoid them
We consider geometric collision-detection problems for modular reconfigu...
research
∙
11/03/2022
Distributed Reconfiguration of Spanning Trees
In a reconfiguration problem, given a problem and two feasible solutions...
research
∙
10/10/2022
Parameterized Approaches to Orthogonal Compaction
Orthogonal graph drawings are used in applications such as UML diagrams,...
research
∙
08/30/2022
On Sparse Hitting Sets: from Fair Vertex Cover to Highway Dimension
We consider the Sparse Hitting Set (Sparse-HS) problem, where we are giv...
research
∙
06/30/2022
Bounding and computing obstacle numbers of graphs
An obstacle representation of a graph G consists of a set of pairwise di...
research
∙
06/30/2021
Grid Recognition: Classical and Parameterized Computational Perspectives
Grid graphs, and, more generally, k× r grid graphs, form one of the most...
research
∙
04/26/2021
How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths
Given an undirected graph, G, and vertices, s and t in G, the tracking p...
research
∙
02/07/2021
Multivariate Analysis of Scheduling Fair Competitions
A fair competition, based on the concept of envy-freeness, is a non-elim...
research
∙
01/25/2021
Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes
We investigate the parameterized complexity of finding subgraphs with he...
research
∙
10/17/2019
Detecting Urban Changes with Recurrent Neural Networks from Multitemporal Sentinel-2 Data
The advent of multitemporal high resolution data, like the Copernicus S...
research
∙
10/04/2019
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width
For a clustered graph, i.e, a graph whose vertex set is recursively part...
research
∙
03/06/2019
The Parameterized Complexity of Motion Planning for Snake-Like Robots
We study the parameterized complexity of a variant of the classic video ...
research
∙
03/19/2018
Exact Distance Oracles Using Hopsets
For fixed h ≥ 2, we consider the task of adding to a graph G a set of we...
research
∙
03/14/2018
Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity
The C-Planarity problem asks for a drawing of a clustered graph, i.e., a...
research
∙
09/18/2017
Crossing Patterns in Nonplanar Road Networks
We define the crossing graph of a given embedded graph (such as a road n...
research
∙
06/20/2016
