default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael J. Bannister
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j6]Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood
:
Track Layouts, Layered Path Decompositions, and Leveled Planarity. Algorithmica 81(4): 1561-1583 (2019)- 2018
- [j5]Michael J. Bannister, Sergio Cabello, David Eppstein:
Parameterized Complexity of 1-Planarity. J. Graph Algorithms Appl. 22(1): 23-49 (2018) - [j4]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): 577-606 (2018) - 2016
- [c13]Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood:
Track Layout Is Hard. GD 2016: 499-510 - 2015
- [b1]Michael J. Bannister:
Lower Bounds and Fixed-Parameter Tractability of Drawing Graphs. University of California, Irvine, USA, 2015 - [j3]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): 619-656 (2015) - [c12]Michael J. Bannister, David A. Brown, David Eppstein:
Confluent Orthogonal Drawings of Syntax Diagrams. GD 2015: 260-271 - [i14]Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood:
Track Layouts, Layered Path Decompositions, and Leveled Planarity. CoRR abs/1506.09145 (2015) - [i13]Michael J. Bannister, David A. Brown, David Eppstein:
Confluent Orthogonal Drawings of Syntax Diagrams. CoRR abs/1509.00818 (2015) - 2014
- [j2]Michael J. Bannister, Zhanpeng Cheng, William E. Devanny, David Eppstein:
Superpatterns and Universal Point Sets. J. Graph Algorithms Appl. 18(2): 177-209 (2014) - [c11]Michael J. Bannister, William E. Devanny, David Eppstein:
Small Superpatterns for Dominance Drawing. ANALCO 2014: 92-103 - [c10]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 - [c9]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. GD 2014: 149-161 - [c8]Michael J. Bannister, David Eppstein:
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth. GD 2014: 210-221 - [i12]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 abs/1408.1422 (2014) - [i11]Michael J. Bannister, David Eppstein:
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth. CoRR abs/1408.6321 (2014) - [i10]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 abs/1409.5452 (2014) - [i9]Michael J. Bannister, William E. Devanny, David Eppstein:
ERGMs are Hard. CoRR abs/1412.1787 (2014) - 2013
- [c7]Michael J. Bannister, Zhanpeng Cheng, William E. Devanny, David Eppstein:
Superpatterns and Universal Point Sets. GD 2013: 208-219 - [c6]Michael J. Bannister, David Eppstein, Joseph A. Simons:
Fixed Parameter Tractability of Crossing Minimization of Almost-Trees. GD 2013: 340-351 - [c5]Michael J. Bannister, Christopher DuBois, David Eppstein, Padhraic Smyth:
Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges. SODA 2013: 856-864 - [c4]Michael J. Bannister, Sergio Cabello, David Eppstein:
Parameterized Complexity of 1-Planarity. WADS 2013: 97-108 - [i8]Michael J. Bannister, Sergio Cabello, David Eppstein:
Parameterized Complexity of 1-Planarity. CoRR abs/1304.5591 (2013) - [i7]Michael J. Bannister, Zhanpeng Cheng, William E. Devanny, David Eppstein:
Superpatterns and Universal Point Sets. CoRR abs/1308.0403 (2013) - [i6]Michael J. Bannister, David Eppstein, Joseph A. Simons:
Fixed parameter tractability of crossing minimization of almost-trees. CoRR abs/1308.5741 (2013) - [i5]Michael J. Bannister, William E. Devanny, David Eppstein:
Small Superpatterns for Dominance Drawing. CoRR abs/1310.3770 (2013) - 2012
- [j1]Michael J. Bannister, David Eppstein, Joseph A. Simons:
Inapproximability of Orthogonal Compaction. J. Graph Algorithms Appl. 16(3): 651-673 (2012) - [c3]Michael J. Bannister, David Eppstein:
Randomized Speedup of the Bellman-Ford Algorithm. ANALCO 2012: 41-47 - [c2]Michael J. Bannister, David Eppstein, Michael T. Goodrich, Lowell Trott:
Force-Directed Graph Drawing Using Social Gravity and Scaling. GD 2012: 414-425 - [i4]Michael J. Bannister, David Eppstein, Michael T. Goodrich, Lowell Trott:
Force-Directed Graph Drawing Using Social Gravity and Scaling. CoRR abs/1209.0748 (2012) - [i3]Michael J. Bannister, Christopher DuBois, David Eppstein, Padhraic Smyth:
Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges. CoRR abs/1209.5791 (2012) - 2011
- [c1]Michael J. Bannister, David Eppstein:
Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings. GD 2011: 367-378 - [i2]Michael J. Bannister, David Eppstein:
Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings. CoRR abs/1108.4705 (2011) - [i1]Michael J. Bannister, David Eppstein:
Randomized Speedup of the Bellman-Ford Algorithm. CoRR abs/1111.5414 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
