Výsledky vyhledávání - "Ryuhei UEHARA"

Akademický článek

Tractabilities and Intractabilities on Geometric Intersection Graphs

Autor: Ryuhei Uehara

Publikováno v: Algorithms, Vol 6, Iss 1, Pp 60-83 (2013)

A graph is said to be an intersection graph if there is a set of objects such that each vertex corresponds to an object and two vertices are adjacent if and only if the corresponding objects have a nonempty intersection. There are several natural gra

Externí odkaz: https://doaj.org/article/5f26978fc989485eae64f68eb0c5b5d7

Zobrazit plný text záznamu

Akademický článek

Any Monotone Function Is Realized by Interlocked Polygons

Autor: Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara

Publikováno v: Algorithms, Vol 5, Iss 1, Pp 148-157 (2012)

Suppose there is a collection of n simple polygons in the plane, none of which overlap each other. The polygons are interlocked if no subset can be separated arbitrarily far from the rest. It is natural to ask the characterization of the subsets that

Externí odkaz: https://doaj.org/article/35ab6a88aeb0459a89c91ad658a3167a

Zobrazit plný text záznamu

Akademický článek

Special Issue on Reconfiguration Problems

Autor: Faisal Abu-Khzam, Henning Fernau, Ryuhei Uehara

Publikováno v: Algorithms, Vol 11, Iss 11, p 187 (2018)

The study of reconfiguration problems has grown into a field of its own. The basic idea is to consider the scenario of moving from one given (feasible) solution to another, maintaining feasibility for all intermediate solutions. The solution space is

Externí odkaz: https://doaj.org/article/8c203b3dfe794ee595db9dce760978a5

Zobrazit plný text záznamu

Plný text ve formátu HTML