1 citations · 2 across the 4 of their papers we have counts for
7 papers
Taming the Knight's Tour: Minimizing Turns and Crossings
Juan Jose Besa, Timothy Johnson, Nil Mamano +2
We introduce two new metrics of "simplicity" for knight's tours: the number of turns and the number of crossings. We give a novel algorithm that produces tours with tu…
Low Ply Drawings of Trees and 2-Trees
Michael T. Goodrich, Timothy Johnson
Ply number is a recently developed graph drawing metric inspired by studying road networks. Informally, for each vertex v, which is associated with a point in the plane, a disk is…
Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data
Juan Jose Besa, William E. Devanny, David Eppstein +2
We empirically study sorting in the evolving data model. In this model, a sorting algorithm maintains an approximation to the sorted order of a list of data items while simultaneou…
Optimally Sorting Evolving Data
Juan Jose Besa, William E. Devanny, David Eppstein +2
We give optimal sorting algorithms in the evolving data framework, where an algorithm's input data is changing while the algorithm is executing. In this framework, instead of produ…
Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs
Giordano Da Lozzo, William E. Devanny, David Eppstein +1
A square-contact representation of a planar graph maps vertices in to interior-disjoint axis-aligned squares in the plane and edges in to adjacencies between the…
J-Viz: Sibling-First Recursive Graph Drawing for Visualizing Java Bytecode
Md. Jawaherul Alam, Michael T. Goodrich, Timothy Johnson
We describe a graph visualization tool for visualizing Java bytecode. Our tool, which we call J-Viz, visualizes connected directed graphs according to a canonical node ordering, wh…