Philipp Kindermann | DeepAI

AI Chat

Featured Co-authors

Stephen Kobourov
51 publications
Martin Nöllenburg
51 publications
Meirav Zehavi
42 publications
Maarten Löffler
42 publications
Giuseppe Liotta
39 publications
Therese Biedl
39 publications
Fabrizio Montecchiani
37 publications
Michael A. Bekos
35 publications
Ignaz Rutter
35 publications
Michael Kaufmann
34 publications
Alexander Wolff
33 publications

∙ 09/04/2023

Mutual Witness Proximity Drawings of Isomorphic Trees

A pair ⟨ G_0, G_1 ⟩ of graphs admits a mutual witness proximity drawing ...

0 Carolina Haase, et al. ∙

∙ 09/03/2023

Upward and Orthogonal Planarity are W[1]-hard Parameterized by Treewidth

Upward planarity testing and Rectilinear planarity testing are central p...

0 Bart M. P. Jansen, et al. ∙

∙ 06/12/2023

Three Edge-disjoint Plane Spanning Paths in a Point Set

We study the following problem: Given a set S of n points in the plane, ...

0 Philipp Kindermann, et al. ∙

∙ 01/25/2023

Splitting Vertices in 2-Layer Graph Drawings

Bipartite graphs model the relationships between two disjoint sets of en...

0 Reyan Ahmed, et al. ∙

∙ 10/10/2022

Parameterized Approaches to Orthogonal Compaction

Orthogonal graph drawings are used in applications such as UML diagrams,...

0 Walter Didimo, et al. ∙

∙ 09/01/2022

The Rique-Number of Graphs

We continue the study of linear layouts of graphs in relation to known d...

0 Michael A. Bekos, et al. ∙

∙ 08/18/2022

Recognizing well-dominated graphs is coNP-complete

A graph G is well-covered if every minimal vertex cover of G is minimum,...

0 Akanksha Agrawal, et al. ∙

∙ 02/25/2022

Outside-Obstacle Representations with All Vertices on the Outer Face

An obstacle representation of a graph G consists of a set of polygonal o...

0 Oksana Firman, et al. ∙

∙ 12/06/2021

Morphing Rectangular Duals

We consider the problem of morphing between rectangular duals of a plane...

0 Steven Chaplick, et al. ∙

∙ 08/27/2021

One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons

We consider the problem of drawing an outerplanar graph with n vertices ...

0 Patrizio Angelini, et al. ∙

∙ 02/03/2021

Extending Partial Representations of Rectangular Duals with Given Contact Orientations

A rectangular dual of a graph G is a contact representation of G by axis...

0 Steven Chaplick, et al. ∙

∙ 08/24/2020

On Mixed Linear Layouts of Series-Parallel Graphs

A mixed s-stack q-queue layout of a graph consists of a linear order of ...

0 Patrizio Angelini, et al. ∙

∙ 02/27/2020

The Complexity of Finding Tangles

We study the following combinatorial problem. Given a set of n y-monoton...

0 Oksana Firman, et al. ∙

∙ 08/08/2019

Crossing Numbers of Beyond-Planar Graphs

We study the 1-planar, quasi-planar, and fan-planar crossing number in c...

0 Markus Chimani, et al. ∙

∙ 07/11/2019

Stick Graphs with Length Constraints

Stick graphs are intersection graphs of horizontal and vertical line seg...

0 Steven Chaplick, et al. ∙

∙ 03/20/2019

Drawing planar graphs with few segments on a polynomial grid

The visual complexity of a plane graph drawing is defined to be the numb...

0 Philipp Kindermann, et al. ∙

∙ 01/19/2019

Computing Optimal Tangles Faster

We study the following combinatorial problem. Given a set of n y-monoton...

0 Oksana Firman, et al. ∙

∙ 01/06/2019

Maximum Matchings and Minimum Blocking Sets in Θ_6-Graphs

Θ_6-Graphs are important geometric graphs that have many applications es...

0 Therese Biedl, et al. ∙

∙ 12/11/2018

Finding Tutte paths in linear time

It is well-known that every 2-connected planar graph has a Tutte path, i...

0 Therese Biedl, et al. ∙

∙ 09/07/2018

The Partition Spanning Forest Problem

Given a set of colored points in the plane, we ask if there exists a cro...

0 Philipp Kindermann, et al. ∙

∙ 08/27/2018

Greedy Rectilinear Drawings

A drawing of a graph is greedy if for each ordered pair of vertices u an...

0 Patrizio Angelini, et al. ∙

∙ 08/26/2018

Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles

We show that the 1-planar slope number of 3-connected cubic 1-planar gra...

0 Philipp Kindermann, et al. ∙

∙ 08/31/2017

Lombardi Drawings of Knots and Links

Knot and link diagrams are projections of one or more 3-dimensional simp...

0 Philipp Kindermann, et al. ∙

∙ 08/31/2017

Experimental analysis of the accessibility of drawings with few segments

The visual complexity of a graph drawing is defined as the number of geo...

0 Philipp Kindermann, et al. ∙

∙ 07/05/2017

Placing your Coins on a Shelf

We consider the problem of packing a family of disks "on a shelf", that ...

0 Helmut Alt, et al. ∙

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