Titlebook: ;

organism

Cristiano G. Moreira,Vanessa Sperandiokly as possible by moving vertices. In this paper we investigate the related problem . which asks for the minimum number of vertex moves. First, we show that . is NP-hard and hard to approximate. Second, we establish a connection to the graph-drawing problem ., which yields similar results for that

Perigee

配偶

Substance

Isao Karube,Atsushi Seki,Koji Sodelane in such a way that each pair of edges from . crosses exactly once and no other pair crosses. We present a polynomial algorithm which decides whether a given complete AT-graph is simply realizable. On the other hand, we show that other similar realizability problems for (complete) AT-graphs are

极力证明

散开

https://doi.org/10.1007/978-81-322-2598-0ects (a so-called ., e.g., a set of disks or homothetic triangles). We insist that the interiors of the seeds and the cover elements are pairwise disjoint, but they can touch. We call the contact graph of a cover a . (CCG). We are interested in two types of tasks: (a) deciding whether a given seed s

Obscure

Jyoti Kushwah,Vishal Singh Somvanshi the concept of such matched drawings, which are a relaxation of simultaneous geometric embeddings with mapping. We study which classes of graphs allow matched drawings and show that (.) two 3-connected planar graphs or a 3-connected planar graph and a tree may not be matched drawable, while (.) two

graphy

Merit del Rocío Mora-Ruiz,Carlos Díaz-Gilsent are the first algorithms achieving sub-quadratic area for these problems. Further, for upward order-preserving straight-line orthogonal drawings of binary trees and for order-preserving straight-line orthogonal drawings of ternary trees we provide .(..) area lower bounds, that we also prove to be tight.

Ancestor

triptans

Microbial Enzymes and Biotechniques of those hypergraphs which are representable by contact of segments in the plane, We propose some possible generalization directions and open problems, related to the order dimension of the incidence posets of hypergraphs.