Michael J. Bannister

Publication Activity (10 Years)

Years Active: 2011-2019
Publications (10 Years): 4

Top Topics

Parameterized Complexity

Bounded Treewidth

Top Venues

J. Graph Algorithms Appl.

Publications

Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood
Track Layouts, Layered Path Decompositions, and Leveled Planarity. Algorithmica 81 (4) (2019)
Michael J. Bannister, Sergio Cabello, David Eppstein
Parameterized Complexity of 1-Planarity. J. Graph Algorithms Appl. 22 (1) (2018)
Michael J. Bannister, David Eppstein
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth. J. Graph Algorithms Appl. 22 (4) (2018)
Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood
Track Layout Is Hard. Graph Drawing (2016)
Michael J. Bannister, David A. Brown, David Eppstein
Confluent Orthogonal Drawings of Syntax Diagrams. Graph Drawing (2015)
Michael J. Bannister, David A. Brown, David Eppstein
Confluent Orthogonal Drawings of Syntax Diagrams. CoRR (2015)
Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood
Track Layouts, Layered Path Decompositions, and Leveled Planarity. CoRR (2015)
Michael J. Bannister, William E. Devanny, David Eppstein, Michael T. Goodrich
The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. J. Graph Algorithms Appl. 19 (2) (2015)
Michael J. Bannister, William E. Devanny, David Eppstein
Small Superpatterns for Dominance Drawing. ANALCO (2014)
Michael J. Bannister, William E. Devanny, David Eppstein, Michael T. Goodrich
The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. Graph Drawing (2014)
Michael J. Bannister, William E. Devanny, David Eppstein, Michael T. Goodrich
The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. CoRR (2014)
Michael J. Bannister, William E. Devanny, Michael T. Goodrich, Joseph A. Simons, Lowell Trott
Windows into Geometric Events: Data Structures for Time-Windowed Querying of Temporal Point Sets. CCCG (2014)
Michael J. Bannister, David Eppstein
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth. Graph Drawing (2014)
Michael J. Bannister, David Eppstein
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth. CoRR (2014)
Michael J. Bannister, William E. Devanny, Michael T. Goodrich, Joseph A. Simons, Lowell Trott
Windows into Geometric Events: Data Structures for Time-Windowed Querying of Temporal Point Sets. CoRR (2014)
Michael J. Bannister, Zhanpeng Cheng, William E. Devanny, David Eppstein
Superpatterns and Universal Point Sets. J. Graph Algorithms Appl. 18 (2) (2014)
Michael J. Bannister, William E. Devanny, David Eppstein
ERGMs are Hard. CoRR (2014)
Michael J. Bannister, Sergio Cabello, David Eppstein
Parameterized Complexity of 1-Planarity. WADS (2013)
Michael J. Bannister, Sergio Cabello, David Eppstein
Parameterized Complexity of 1-Planarity CoRR (2013)
Michael J. Bannister, Zhanpeng Cheng, William E. Devanny, David Eppstein
Superpatterns and Universal Point Sets. CoRR (2013)
Michael J. Bannister, David Eppstein, Joseph A. Simons
Fixed parameter tractability of crossing minimization of almost-trees. CoRR (2013)
Michael J. Bannister, David Eppstein, Joseph A. Simons
Fixed Parameter Tractability of Crossing Minimization of Almost-Trees. Graph Drawing (2013)
Michael J. Bannister, Zhanpeng Cheng, William E. Devanny, David Eppstein
Superpatterns and Universal Point Sets. Graph Drawing (2013)
Michael J. Bannister, William E. Devanny, David Eppstein
Small Superpatterns for Dominance Drawing. CoRR (2013)
Michael J. Bannister, Christopher DuBois, David Eppstein, Padhraic Smyth
Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges. SODA (2013)
Michael J. Bannister, David Eppstein, Joseph A. Simons
Inapproximability of Orthogonal Compaction. J. Graph Algorithms Appl. 16 (3) (2012)
Michael J. Bannister, David Eppstein
Randomized Speedup of the Bellman-Ford Algorithm. ANALCO (2012)
Michael J. Bannister, David Eppstein, Michael T. Goodrich, Lowell Trott
Force-Directed Graph Drawing Using Social Gravity and Scaling. Graph Drawing (2012)
Michael J. Bannister, David Eppstein, Michael T. Goodrich, Lowell Trott
Force-Directed Graph Drawing Using Social Gravity and Scaling CoRR (2012)
Michael J. Bannister, Christopher DuBois, David Eppstein, Padhraic Smyth
Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges CoRR (2012)
Michael J. Bannister, David Eppstein
Randomized Speedup of the Bellman-Ford Algorithm CoRR (2011)
Michael J. Bannister, David Eppstein
Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings CoRR (2011)
Michael J. Bannister, David Eppstein
Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings. Graph Drawing (2011)