6 Result(s)
within
English
Algorithm Analysis and Problem Complexity
Martin Balko
Chapter
-
Chapter and Conference Paper
Bounded Representations of Interval and Proper Interval Graphs
Klavík et al. [ar**v:1207.6960] recently introduced a generalization of recognition called the bounded representation problem which we study for the classes of interval and proper interval graphs. The input gives...
-
Chapter and Conference Paper
Grid Drawings and the Chromatic Number
A grid drawing of a graph maps vertices to the grid ℤ d and edges to line segments that avoid grid points representing other vertices. We show that a graph G is q ...
-
Chapter and Conference Paper
Drawing Graphs Using a Small Number of Obstacles
An obstacle representation of a graph G is a set of points in the plane representing the vertices of G, together with a set of polygonal obstacles such that two vertices of G are connected by an edge in G if and ...
-
Chapter and Conference Paper
Holes in 2-Convex Point Sets
Let S be a set of n points in the plane in general position (no three points from S are collinear). For a positive integer k, a k-hole in S is a convex polygon with k vertices from S and no points of S in its int...
-
Chapter and Conference Paper
Minimal Representations of Order Types by Geometric Graphs
In order to have a compact visualization of the order type of a given point set S, we are interested in geometric graphs on S with few edges that unequivocally display the order type of S. We introduce the concep...
-
Chapter and Conference Paper
On Erdős–Szekeres-Type Problems for k-convex Point Sets
We study Erdős–Szekeres-type problems for k-convex point sets, a recently introduced notion that naturally extends the concept of convex position. A finite set S of n points is k-convex if there exists a spanning...
