Fabian Klute | DeepAI

AI Chat

Featured Co-authors

Martin Nöllenburg
51 publications
Maarten Löffler
42 publications
Robert Ganian
39 publications
Therese Biedl
39 publications
Michael A. Bekos
35 publications
Michael Kaufmann
34 publications
Torsten Ueckerdt
34 publications
Sujoy Bhore
29 publications
Matias Korman
29 publications
Birgit Vogtenhuber
28 publications
Eduard Eiben
27 publications

∙ 09/29/2022

Minimum Link Fencing

We study a variant of the geometric multicut problem, where we are given...

0 Sujoy Bhore, et al. ∙

∙ 07/03/2022

On Streaming Algorithms for Geometric Independent Set and Clique

We study the maximum geometric independent set and clique problems in th...

0 Sujoy Bhore, et al. ∙

∙ 01/19/2021

Local Complexity of Polygons

Many problems in Discrete and Computational Geometry deal with simple po...

0 Fabian Klute, et al. ∙

∙ 12/21/2020

Efficient Segment Folding is Hard

We introduce a computational origami problem which we call the segment f...

0 Takashi Horiyama, et al. ∙

∙ 12/14/2020

Crossing-Optimal Extension of Simple Drawings

In extension problems of partial graph drawings one is given an incomple...

0 Robert Ganian, et al. ∙

∙ 12/03/2020

Saturated k-Plane Drawings with Few Edges

A drawing of a graph is k-plane if no edge is crossed more than k times....

0 Fabian Klute, et al. ∙

∙ 07/08/2020

Extending Nearly Complete 1-Planar Drawings in Polynomial Time

The problem of extending partial geometric graph representations such as...

0 Eduard Eiben, et al. ∙

∙ 04/25/2020

Extending Partial 1-Planar Drawings

Algorithmic extension problems of partial graph representations such as ...

0 Eduard Eiben, et al. ∙

∙ 04/16/2020

Four Pages Are Indeed Necessary for Planar Graphs

An embedding of a graph in a book consists of a linear order of its vert...

0 Michael A. Bekos, et al. ∙

∙ 03/11/2020

Balanced Independent and Dominating Sets on Colored Interval Graphs

We study two new versions of independent and dominating set problems on ...

0 Sujoy Bhore, et al. ∙

∙ 02/26/2020

Finding large matchings in 1-planar graphs of minimum degree 3

A matching is a set of edges without common endpoint. It was recently sh...

0 Therese Biedl, et al. ∙

∙ 10/17/2019

Exploring Semi-Automatic Map Labeling

Label placement in maps is a very challenging task that is critical for ...

9 Fabian Klute, et al. ∙

∙ 09/16/2019

Extending simple drawings with one edge is hard

A simple drawing D(G) of a graph G = (V,E) is a drawing in which two edg...

0 Alan Arroyo, et al. ∙

∙ 08/23/2019

Mixed Linear Layouts: Complexity, Heuristics, and Experiments

A k-page linear graph layout of a graph G = (V,E) draws all vertices alo...

0 Philipp de Col, et al. ∙

∙ 08/23/2019

Maximizing Ink in Partial Edge Drawings of k-plane Graphs

Partial edge drawing (PED) is a drawing style for non-planar graphs, in ...

0 Matthias Hummel, et al. ∙

∙ 08/14/2019

On Strict (Outer-)Confluent Graphs

A strict confluent (SC) graph drawing is a drawing of a graph with verti...

0 Henry Förster, et al. ∙

∙ 03/15/2018

Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts

Circular layouts are a popular graph drawing style, where vertices are p...

0 Fabian Klute, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world