Michael J. Bannister

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from VLDB 2026 / reviewers in the wild / expert

dblp:04/10044 · DBLP profile ↗

← Back

11ranked-venue papers

11as first author

0since 2021 · last 2019

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 11 · 11 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science

1 paper

Graph algorithms and graph theory · 67% Algorithms and data structures · 33%

Topics — the 2 heaviest of 3, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Graph algorithms and graph theory › graph connectivity connected components	0.2	1	2013	Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges · SODA 2013
Graph algorithms and graph theory › temporal graph temporal graph analysis	0.2	1	2013	Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges · SODA 2013

Methods — techniques the papers use, named apart from their topics

sublogarithmic query time · 0.2near-linear preprocessing · 0.2

Year	Publication	Venue	Position
2019	Track Layouts, Layered Path Decompositions, and Leveled Planarity Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood	Algorithmica	1
2016	Track Layout Is Hard Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood	GD	1
2015	Confluent Orthogonal Drawings of Syntax Diagrams Michael J. Bannister, David A. Brown, David Eppstein	GD	1
2014	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	GD	1
2014	Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth Michael J. Bannister, David Eppstein	GD	1
2013	Superpatterns and Universal Point Sets Michael J. Bannister, Zhanpeng Cheng, William E. Devanny, David Eppstein	GD	1
2013	Fixed Parameter Tractability of Crossing Minimization of Almost-Trees Michael J. Bannister, David Eppstein, Joseph A. Simons	GD	1
2013	Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges abstract We consider the problem of analyzing social network data sets in which the edges of the network have timestamps, and we wish to analyze the subgraphs formed from edges in contiguous subintervals of these timestamps. We provide data structures for these problems that use near-linear preprocessing time, linear space, and sublogarithmic query time to handle queries that ask for the number of connected components, number of components that contain cycles, number of vertices whose degree equals or is at most some predetermined value, number of vertices that can be reached from a starting set of vertices by time-increasing paths, and related queries. Michael J. Bannister, Christopher DuBois, David Eppstein, Padhraic Smyth	SODA	1
2013	Parameterized Complexity of 1-Planarity Michael J. Bannister, Sergio Cabello, David Eppstein	WADS	1
2012	Force-Directed Graph Drawing Using Social Gravity and Scaling Michael J. Bannister, David Eppstein, Michael T. Goodrich, Lowell Trott	GD	1
2011	Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings Michael J. Bannister, David Eppstein	GD	1