Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Recognizing and drawing IC-planar graphs

- F. Brandenburg, W. Didimo, W. S. Evans, P. Kindermann, G. Liotta, Fabrizio Montecchiani
- Computer Science, Mathematics
- Theor. Comput. Sci.
- 1 September 2015

Abstract We give new results about the relationship between 1-planar graphs and RAC graphs. A graph is 1-planar if it has a drawing where each edge is crossed at most once. A graph is RAC if it can… Expand

On Monotone Drawings of Trees

- P. Kindermann, A. Schulz, J. Spoerhase, A. Wolff
- Computer Science, Mathematics
- Graph Drawing
- 24 September 2014

A crossing-free straight-line drawing of a graph is monotone if there is a monotone path between any pair of vertices with respect to some direction. We show how to construct a monotone drawing of a… Expand

The implementation of a perioperative checklist increases patients' perioperative safety and staff satisfaction

- A. Böhmer, F. Wappler, +6 authors M. Gerbershagen
- Medicine
- Acta anaesthesiologica Scandinavica
- 1 March 2012

The implementation of the ‘Surgical Safety Checklist’ caused a significant reduction in the incidence of complications and mortality among patients undergoing surgery. The aim of the present study… Expand

On the Planar Split Thickness of Graphs

- D. Eppstein, P. Kindermann, +7 authors S. Wismath
- Mathematics, Computer Science
- LATIN
- 11 April 2016

Motivated by applications in graph drawing and information visualization, we examine the planar split thickness of a graph, that is, the smallest k such that the graph is k-splittable into a planar… Expand

The Partition Spanning Forest Problem

- P. Kindermann, Boris Klemz, I. Rutter, P. Schnider, A. Schulz
- Mathematics, Computer Science
- ArXiv
- 7 September 2018

Given a set of colored points in the plane, we ask if there exists a crossing-free straight-line drawing of a spanning forest, such that every tree in the forest contains exactly the points of one… Expand

Long‐term effects of a perioperative safety checklist from the viewpoint of personnel

- A. Böhmer, P. Kindermann, +6 authors M. Gerbershagen
- Medicine
- Acta anaesthesiologica Scandinavica
- 1 February 2013

While positive short‐term effects of the use of safety checklists have previously been reported by personnel, it is unclear to which extent these effects are maintained for a long‐term period. The… Expand

Multi-sided Boundary Labeling

- P. Kindermann, B. Niedermann, I. Rutter, M. Schaefer, A. Schulz, A. Wolff
- Computer Science, Mathematics
- Algorithmica
- 3 May 2013

In the Boundary Labeling problem, we are given a set of n points, referred to as sites, inside an axis-parallel rectangle R, and a set of n pairwise disjoint rectangular labels that are attached to R… Expand

Minimum Rectilinear Polygons for Given Angle Sequences

- W. S. Evans, K. Fleszar, P. Kindermann, N. Saeedi, C. Shin, A. Wolff
- Computer Science, Mathematics
- JCDCGG
- 14 September 2015

A rectilinear polygon is a polygon whose edges are axis-aligned. Walking counterclockwise on the boundary of such a polygon yields a sequence of left turns and right turns. The number of left turns… Expand

Strongly Monotone Drawings of Planar Graphs

- S. Felsner, A. Igamberdiev, P. Kindermann, Boris Klemz, T. Mchedlidze, M. Scheucher
- Mathematics, Computer Science
- Symposium on Computational Geometry
- 7 January 2016

A straight-line drawing of a graph is a monotone drawing if for each pair of vertices there is a path which is monotonically increasing in some direction, and it is called a strongly monotone drawing… Expand

Two-Sided Boundary Labeling with Adjacent Sides

- P. Kindermann, B. Niedermann, I. Rutter, M. Schaefer, A. Schulz, A. Wolff
- Computer Science, Mathematics
- WADS
- 12 August 2013

In the Boundary Labeling problem, we are given a set of n points, referred to as sites, inside an axis-parallel rectangle R, and a set of n pairwise disjoint rectangular labels that are attached to R… Expand