• Publications
  • Influence
Recognizing and drawing IC-planar graphs
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 canExpand
  • 45
  • 4
On Monotone Drawings of Trees
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 aExpand
  • 19
  • 3
The implementation of a perioperative checklist increases patients' perioperative safety and staff satisfaction
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 studyExpand
  • 35
  • 2
On the Planar Split Thickness of Graphs
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 planarExpand
  • 7
  • 2
The Partition Spanning Forest Problem
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 oneExpand
  • 3
  • 2
Long‐term effects of a perioperative safety checklist from the viewpoint of personnel
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. TheExpand
  • 26
  • 1
Multi-sided Boundary Labeling
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 RExpand
  • 15
  • 1
Minimum Rectilinear Polygons for Given Angle Sequences
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 turnsExpand
  • 5
  • 1
Strongly Monotone Drawings of Planar Graphs
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 drawingExpand
  • 14
Two-Sided Boundary Labeling with Adjacent Sides
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 RExpand
  • 12