73 citations · 178 across the 49 of their papers we have counts for
7 papers · 1 filter
Playing weighted Tron on Trees
Daniel Hoske, Jonathan Rollin, Torsten Ueckerdt +1
We consider the weighted version of the Tron game on graphs where two players, Alice and Bob, each build their own path by claiming one vertex at a time, starting with Alice. The v…
A note on concurrent graph sharing games
Steven Chaplick, Piotr Micek, Torsten Ueckerdt +1
In the concurrent graph sharing game, two players, called First and Second, share the vertices of a connected graph with positive vertex-weights summing up to as follows. The g…
On-line coloring between two lines
Stefan Felsner, Piotr Micek, Torsten Ueckerdt
We study on-line colorings of certain graphs given as intersection graphs of objects "between two lines", i.e., there is a pair of horizontal lines such that each object of the rep…
Spectrum of mixed bi-uniform hypergraphs
Maria Axenovich, Enrica Cherubini, Torsten Ueckerdt
A mixed hypergraph is a triple , where is a set of vertices, and are sets of hyperedges. A vertex-coloring of is…
Intersection Graphs of L-Shapes and Segments in the Plane
Stefan Felsner, Kolja Knauer, George B. Mertzios +1
An L-shape is the union of a horizontal and a vertical segment with a common endpoint. These come in four rotations: L, Γ, LE{} and \eeG. A -bend path is a simple path in the pl…
Density of Range Capturing Hypergraphs
Maria Axenovich, Torsten Ueckerdt
For a finite set of points in the plane, a set in the plane, and a positive integer , we say that a -element subset of is captured by if there is a homoth…