Skip to main content

8 Result(s)

within Conference Paper Remove this filter Pavel Klavík Remove this filter Computer Graphics Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Cops and Robbers on String Graphs

    The game of cops and robber, introduced by Nowakowski and Winkler in 1983, is played by two players on a graph. One controls k cops and the other a robber. The players alternate and move their pieces to the dista...

    Tomáš Gavenčiak, Przemysław Gordinowicz, Vít Jelínek… in Algorithms and Computation (2015)

  2. No Access

    Chapter and Conference Paper

    Minimal Obstructions for Partial Representations of Interval Graphs

    Interval graphs are intersection graphs of closed intervals. A generalization of recognition called partial representation extension was introduced recently. The input gives an interval graph w...

    Pavel Klavík, Maria Saumell in Algorithms and Computation (2014)

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

  4. No Access

    Chapter and Conference Paper

    Cops and Robbers on Intersection Graphs

    The game of cops and robber, introduced by Nowakowski and Winkler in 1983, is played by two players on a graph G, one controlling k cops and the other one robber, all positioned on V ...

    Tomás Gavenčiak, Vít Jelínek, Pavel Klavík, Jan Kratochvíl in Algorithms and Computation (2013)

  5. Chapter and Conference Paper

    Extending Partial Representations of Circle Graphs

    The partial representation extension problem is a recently introduced generalization of the recognition problem. A circle graph is an intersection graph of chords of a circle. We study th...

    Steven Chaplick, Radoslav Fulek, Pavel Klavík in Graph Drawing (2013)

    Download PDF (338 KB)

  6. No Access

    Chapter and Conference Paper

    Extending Partial Representations of Function Graphs and Permutation Graphs

    Function graphs are graphs representable by intersections of continuous real-valued functions on the interval [0,1] and are known to be exactly the complements of comparability graphs. As such they are recogni...

    Pavel Klavík, Jan Kratochvíl, Tomasz Krawczyk, Bartosz Walczak in Algorithms – ESA 2012 (2012)

  7. No Access

    Chapter and Conference Paper

    Extending Partial Representations of Subclasses of Chordal Graphs

    Chordal graphs are intersection graphs of subtrees in a tree. We investigate complexity of the partial representation extension problem for chordal graphs. A partial representation specifies a tree T′ and some pr...

    Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh in Algorithms and Computation (2012)

  8. No Access

    Chapter and Conference Paper

    Structural and Complexity Aspects of Line Systems of Graphs

    We study line systems in metric spaces induced by graphs. A line is a subset of vertices defined by a relation of betweenness.

    Jozef Jirásek, Pavel Klavík in Algorithms and Computation (2010)