Michael J. Bannister

According to our database, Michael J. Bannister authored at least 17 papers between 2011 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

Track Layouts, Layered Path Decompositions, and Leveled Planarity.

Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood

Algorithmica, 2019

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

Parameterized Complexity of 1-Planarity.

Michael J. Bannister, Sergio Cabello, David Eppstein

J. Graph Algorithms Appl., 2018

2016

Track Layout Is Hard.

Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

2015

Lower Bounds and Fixed-Parameter Tractability of Drawing Graphs.

Michael J. Bannister

PhD thesis, 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

Confluent Orthogonal Drawings of Syntax Diagrams.

Michael J. Bannister, David A. Brown, David Eppstein

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2014

Superpatterns and Universal Point Sets.

Michael J. Bannister, Zhanpeng Cheng, William E. Devanny, David Eppstein

J. Graph Algorithms Appl., 2014

ERGMs are Hard.

Michael J. Bannister, William E. Devanny, David Eppstein

CoRR, 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

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Small Superpatterns for Dominance Drawing.

Michael J. Bannister, William E. Devanny, David Eppstein

Proceedings of the 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics, 2014

2013

Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges.

Michael J. Bannister, Christopher DuBois, David Eppstein, Padhraic Smyth

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Fixed Parameter Tractability of Crossing Minimization of Almost-Trees.

Michael J. Bannister, David Eppstein, Joseph A. Simons

Proceedings of the Graph Drawing - 21st International Symposium, 2013

2012

Inapproximability of Orthogonal Compaction.

Michael J. Bannister, David Eppstein, Joseph A. Simons

J. Graph Algorithms Appl., 2012

Force-Directed Graph Drawing Using Social Gravity and Scaling.

Michael J. Bannister, David Eppstein, Michael T. Goodrich, Lowell Trott

Proceedings of the Graph Drawing - 20th International Symposium, 2012

Randomized Speedup of the Bellman-Ford Algorithm.

Michael J. Bannister, David Eppstein

Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics, 2012

2011

Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings.

Michael J. Bannister, David Eppstein

Proceedings of the Graph Drawing - 19th International Symposium, 2011