Michael J. Bannister

Available identifiers

zbMath Open bannister.michael-jMaRDI QIDQ1739107

List of research outcomes

Publication	Date of Publication	Type
Randomized Speedup of the Bellman–Ford Algorithm	2019-09-17	Paper
Small Superpatterns for Dominance Drawing	2019-09-17	Paper
Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges	2019-05-15	Paper
Track layouts, layered path decompositions, and leveled planarity	2019-04-25	Paper
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth	2019-01-18	Paper
Parameterized Complexity of 1-Planarity	2018-01-12	Paper
Track Layout Is Hard	2017-02-21	Paper
The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings	2016-01-07	Paper
The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings	2015-01-07	Paper
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth	2015-01-07	Paper
Superpatterns and Universal Point Sets	2014-05-22	Paper
Superpatterns and Universal Point Sets	2013-12-20	Paper
Fixed Parameter Tractability of Crossing Minimization of Almost-Trees	2013-12-20	Paper
Parameterized Complexity of 1-Planarity	2013-08-12	Paper
Force-Directed Graph Drawing Using Social Gravity and Scaling	2013-04-03	Paper
Inapproximability of Orthogonal Compaction	2012-12-07	Paper
Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings	2012-03-09	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Michael J. Bannister