52 citations · 107 across the 10 of their papers we have counts for
11 papers
Confluent Orthogonal Drawings of Syntax Diagrams
Michael J. Bannister, David A. Brown, David Eppstein
We provide a pipeline for generating syntax diagrams (also called railroad diagrams) from context free grammars. Syntax diagrams are a graphical representation of a context free la…
Track Layouts, Layered Path Decompositions, and Leveled Planarity
Michael J. Bannister, William E. Devanny, Vida Dujmović +2
We investigate two types of graph layouts, track layouts and layered path decompositions, and the relations between their associated parameters track-number and layered pathwidth.…
ERGMs are Hard
Michael J. Bannister, William E. Devanny, David Eppstein
We investigate the computational complexity of the exponential random graph model (ERGM) commonly used in social network analysis. This model represents a probability distribution…
Windows into Geometric Events: Data Structures for Time-Windowed Querying of Temporal Point Sets
Michael J. Bannister, William E. Devanny, Michael T. Goodrich +2
We study geometric data structures for sets of point-based temporal events, answering time-windowed queries, i.e., given a contiguous time interval we answer common geometric queri…
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
Michael J. Bannister, David Eppstein
We investigate crossing minimization for 1-page and 2-page book drawings. We show that computing the 1-page crossing number is fixed-parameter tractable with respect to the number…
Small Superpatterns for Dominance Drawing
Michael J. Bannister, William E. Devanny, David Eppstein
We exploit the connection between dominance drawings of directed acyclic graphs and permutations, in both directions, to provide improved bounds on the size of universal point sets…