3 citations · 5 across the 6 of their papers we have counts for
6 papers
Optimal Monotone Drawings of Trees
Dayu He, Xin He
A monotone drawing of a graph G is a straight-line drawing of G such that, for every pair of vertices u,w in G, there exists abpath P_{uw} in G that is monotone in some direction l…
A Polynomial Time Algorithm for Finding Area-Universal Rectangular Layouts
Jiun-Jie Wang
A rectangular layout is a rectangle partitioned into disjoint smaller rectangles so that no four smaller rectangles meet at the same point. Rectangular layouts were o…
Common-Face Embeddings of Planar Graphs
Zhi-Zhong Chen, Xin He, Ming-Yang Kao
Given a planar graph G and a sequence C_1,...,C_q, where each C_i is a family of vertex subsets of G, we wish to find a plane embedding of G, if any exists, such that for each i in…
Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses
Richie Chih-Nan Chuang, Ashim Garg, Xin He +2
Let G be a plane graph of n nodes, m edges, f faces, and no self-loop. G need not be connected or simple (i.e., free of multiple edges). We give three sets of coding schemes for G…
Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
Xin He, Ming-Yang Kao, Hsueh-I Lu
Let G be an embedded planar undirected graph that has n vertices, m edges, and f faces but has no self-loop or multiple edge. If G is triangulated, we can encode it using {4/3}m-1…
A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
Xin He, Ming-Yang Kao, Hsueh-I Lu
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property pi is called a pi-graph. If pi satisfi…