Michael J. Bannister

34 papers A* 1A 8B 1Journal 20Unranked 3

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