Results 1  10
of
133
PLANE 3TREES: EMBEDDABILITY & APPROXIMATION
, 2013
"... We give an O(n log³ n)time linearspace algorithm that, given a plane 3tree G with n vertices and a set S of n points in the plane, determines whether G has a pointset embedding on S (i.e., a planar straightline drawing of G where each vertex is mapped to a distinct point of S), improving the O ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
the O(n4/3+ε)time O(n4/3)space algorithm of Moosa and Rahman (2011). Given an arbitrary plane graph G and a point set S, Kaufmann and Wiese (2002) gave an algorithm to compute 2bend pointset embeddings of G on S. Later, Di Giacomo and Liotta (2010) showed how such a drawing can be computed using O
Queue layouts, treewidth, and threedimensional graph drawing
 Proc. 22nd Foundations of Software Technology and Theoretical Computer Science (FST TCS '02
, 2002
"... Abstract. A threedimensional (straightline grid) drawing of a graph represents the vertices by points in Z 3 and the edges by noncrossing line segments. This research is motivated by the following open problem due to Felsner, Liotta, and Wismath [Graph Drawing ’01, Lecture Notes in Comput. Sci., ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
Abstract. A threedimensional (straightline grid) drawing of a graph represents the vertices by points in Z 3 and the edges by noncrossing line segments. This research is motivated by the following open problem due to Felsner, Liotta, and Wismath [Graph Drawing ’01, Lecture Notes in Comput. Sci
You ready B….Let’s go get ‘em
, 2005
"... for their tremendous guidance during my tenure at Georgia Tech. Chuck treats every group member as a friend and coworker from the day they walk in the door. He taught me everything I expected to learn about chemical engineering. Moreover, he allowed me to learn how to be a leader in the lab and to l ..."
Abstract
 Add to MetaCart
and to learn from my own mistakes. I am amazed at the things other than science that can be learned in a lab. Dr. Liotta’s energetic personality has been an inspiration from the beginning. I enjoyed his comedy more than most, and enjoyed his enthusiasm for research as much as anyone. His ideas got me out
Queue Layouts and ThreeDimensional StraightLine Grid Drawings
, 2002
"... A famous result due to de Fraysseix, Pach, and Pollack [Combinatorica, 1990] and Schnyder [Order, 1989] states that every nvertex planar graph has a (twodimensional) straightline grid drawing with O(n2) area. A threedimensional straightline grid drawing of a graph represents the vertices by gri ..."
Abstract
 Add to MetaCart
by gridpoints in 3space and the edges by noncrossing line segments. This research is motivated by the following question of Felsner, Liotta, and Wismath [Graph Drawing ’01, Lecture Notes in Comput. Sci., 2002]: does every planar graph have a threedimensional straightline grid drawing with O(n) volume
Selected Open Problems in Graph Drawing
"... In this manuscript, we present several challenging and interesting open problems in graph drawing. The goal of the listing in this paper is to stimulate future research in graph drawing. ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
In this manuscript, we present several challenging and interesting open problems in graph drawing. The goal of the listing in this paper is to stimulate future research in graph drawing.
Layout of Graphs with Bounded TreeWidth
 2002, SUBMITTED. STACKS, QUEUES AND TRACKS: LAYOUTS OF GRAPH SUBDIVISIONS 41
, 2004
"... A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum number of queues in a queue layout of a graph is its queuenumber. A threedimensional (straightline grid) drawing of a gra ..."
Abstract

Cited by 31 (23 self)
 Add to MetaCart
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum number of queues in a queue layout of a graph is its queuenumber. A threedimensional (straightline grid) drawing of a graph represents the vertices by points in Z and the edges by noncrossing linesegments. This paper contributes three main results: (1) It is proved that the minimum volume of a certain type of threedimensional drawing of a graph G is closely related to the queuenumber of G. In particular, if G is an nvertex member of a proper minorclosed family of graphs (such as a planar graph), then G has a O(1) O(1) O(n) drawing if and only if G has O(1) queuenumber.
Pathwidth and ThreeDimensional StraightLine Grid Drawings of Graphs
"... We prove that every nvertex graph G with pathwidth pw(G) has a threedimensional straightline grid drawing with O(pw(G) n) volume. Thus for ..."
Abstract

Cited by 23 (12 self)
 Add to MetaCart
We prove that every nvertex graph G with pathwidth pw(G) has a threedimensional straightline grid drawing with O(pw(G) n) volume. Thus for
Mobile Information Retrieval with Search Results Clustering: Prototypes and Evaluations
 Journal of American Society for Information Science and Technology (JASIST
, 2009
"... Web searches from mobile devices such as PDAs and cell phones are becoming increasingly popular. However, the traditional listbased search interface paradigm does not scale well to mobile devices due to their inherent limitations. In this article, we investigate the application of search results cl ..."
Abstract

Cited by 21 (8 self)
 Add to MetaCart
Web searches from mobile devices such as PDAs and cell phones are becoming increasingly popular. However, the traditional listbased search interface paradigm does not scale well to mobile devices due to their inherent limitations. In this article, we investigate the application of search results clustering, used with some success for desktop computer searches, to the mobile scenario. Building on CREDO (Conceptual Reorganization of Documents), a Web clustering engine based on concept lattices, we present its mobile versions Credino and SmartCREDO, for PDAs and cell phones, respectively. Next, we evaluate the retrieval performance of the three prototype systems. We measure the effectiveness of their clustered results compared to a ranked list of results on a subtopic retrieval task, by means of the deviceindependent notion of subtopic reach time together with a reusable test collection built from Wikipedia ambiguous entries. Then, we make a crosscomparison of methods (i.e., clustering and ranked list) and devices (i.e., desktop, PDA, and cell phone), using an interactive informationfinding task performed by external participants. The main finding is that clustering engines are a viable complementary approach to plain search engines both for desktop and mobile searches especially, but not only, for multitopic informational queries.
Drawing SeriesParallel Graphs on a Box
 The University of Lethbridge
, 1997
"... A box is a restricted portion of the threedimensional integer grid consisting of four parallel lines of in nite length placed one grid unit apart. A boxdrawing of a graph is a straightline crossingfree drawing where vertices are located at integer grid points along the four lines. It is known t ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
A box is a restricted portion of the threedimensional integer grid consisting of four parallel lines of in nite length placed one grid unit apart. A boxdrawing of a graph is a straightline crossingfree drawing where vertices are located at integer grid points along the four lines. It is known that some planar graphs with triconnected components do not admit a boxdrawing. This paper shows that even structurally simpler planar graphs, namely seriesparallel graphs, are not boxdrawable in general. On the positive side, it is proved that every seriesparallel graph whose vertices have maximum degree at most three is boxdrawable. A drawing algorithm is presented that computes a box drawing of a 3planar seriesparallel graph in optimal time and with optimal volume.
Results 1  10
of
133