Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings. - Michael J. Bannister; David Eppstein (GD, 2011)

Randomized Speedup of the Bellman-Ford Algorithm. - Michael J. Bannister; David Eppstein (ANALCO, 2012)

Force-Directed Graph Drawing Using Social Gravity and Scaling. - Michael J. Bannister; David Eppstein; Michael T. Goodrich; Lowell Trott (GD, 2012)

Inapproximability of Orthogonal Compaction. - Michael J. Bannister; David Eppstein; Joseph A. Simons (J. Graph Algorithms Appl., 2012)

Fixed Parameter Tractability of Crossing Minimization of Almost-Trees. - Michael J. Bannister; David Eppstein; Joseph A. Simons (GD, 2013)

Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges. - Michael J. Bannister; Christopher DuBois; David Eppstein; Padhraic Smyth (SODA, 2013)

Small Superpatterns for Dominance Drawing. - Michael J. Bannister; William E. Devanny; David Eppstein (ANALCO, 2014)

Windows into Geometric Events: Data Structures for Time-Windowed Querying of Temporal Point Sets. - Michael J. Bannister; William E. Devanny; Michael T. Goodrich; Joseph A. Simons; Lowell Trott (CCCG, 2014)

ERGMs are Hard. - Michael J. Bannister; William E. Devanny; David Eppstein (CoRR, 2014)

Superpatterns and Universal Point Sets. - Michael J. Bannister; Zhanpeng Cheng; William E. Devanny; David Eppstein (J. Graph Algorithms Appl., 2014)

Confluent Orthogonal Drawings of Syntax Diagrams. - Michael J. Bannister; David A. Brown; David Eppstein (GD, 2015)

The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. - Michael J. Bannister; William E. Devanny; David Eppstein; Michael T. Goodrich (J. Graph Algorithms Appl., 2015)

Lower Bounds and Fixed-Parameter Tractability of Drawing Graphs. - Michael J. Bannister (2015)

Track Layout Is Hard. - Michael J. Bannister; William E. Devanny; Vida Dujmovic; David Eppstein; David R. Wood (GD, 2016)

Parameterized Complexity of 1-Planarity. - Michael J. Bannister; Sergio Cabello; David Eppstein (J. Graph Algorithms Appl., 2018)

Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth. - Michael J. Bannister; David Eppstein (J. Graph Algorithms Appl., 2018)

Track Layouts, Layered Path Decompositions, and Leveled Planarity. - Michael J. Bannister; William E. Devanny; Vida Dujmovic; David Eppstein; David R. Wood (Algorithmica, 2019)