Skip to main content

3 Result(s)

within English Remove this filter Computer Graphics Remove this filter Martin Balko Remove this filter Chapter Remove this filter

and

  1. No Access

    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...

    Martin Balko, Pavel Klavík, Yota Otachi in Algorithms and Computation (2013)

  2. 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 ...

    Martin Balko, Josef Cibulka, Pavel Valtr in Graph Drawing and Network Visualization (2015)

    Download PDF (289 KB) View Chapter

  3. No Access

    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...

    Martin Balko, Sujoy Bhore, Leonardo Martínez Sandoval… in Combinatorial Algorithms (2019)