| 2016 | GD | Track Layout Is Hard. | Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood |
| 2015 | GD | Confluent Orthogonal Drawings of Syntax Diagrams. | Michael J. Bannister, David A. Brown, David Eppstein |
| 2014 | GD | 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 |
| 2014 | GD | Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth. | Michael J. Bannister, David Eppstein |
| 2013 | GD | Superpatterns and Universal Point Sets. | Michael J. Bannister, Zhanpeng Cheng, William E. Devanny, David Eppstein |
| 2013 | GD | Fixed Parameter Tractability of Crossing Minimization of Almost-Trees. | Michael J. Bannister, David Eppstein, Joseph A. Simons |
| 2013 | SODA | Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges. | Michael J. Bannister, Christopher DuBois, David Eppstein, Padhraic Smyth |
| 2013 | WADS | Parameterized Complexity of 1-Planarity. | Michael J. Bannister, Sergio Cabello, David Eppstein |
| 2012 | GD | Force-Directed Graph Drawing Using Social Gravity and Scaling. | Michael J. Bannister, David Eppstein, Michael T. Goodrich, Lowell Trott |
| 2011 | GD | Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings. | Michael J. Bannister, David Eppstein |