Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Bannister, Michael J."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
Lecture Notes in Computer Science
8871
, 2014, pp. 149-161
Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
Michael J. Bannister
,
David Eppstein
Lecture Notes in Computer Science
8871
, 2014, pp. 210-221
Parameterized complexity of 1-planarity
Michael J. Bannister
,
Sergio Cabello
,
David Eppstein
Lecture Notes in Computer Science
8037
, 2013, pp. 97-108
Superpatterns and universal point sets
Michael J. Bannister
,
Zhanpeng Cheng
,
William E. Devanny
,
David Eppstein
Lecture Notes in Computer Science
8242
, 2013, pp. 208-219
Force-directed graph drawing using social gravity and scaling
Michael J. Bannister
,
David Eppstein
,
Michael T. Goodrich
,
Lowell Trott
Lecture Notes in Computer Science
7704
, 2013, pp. 414-425
Fixed parameter tractability of crossing minimization of almost-trees
Michael J. Bannister
,
David Eppstein
,
Joseph A. Simons
Lecture Notes in Computer Science
8242
, 2013, pp. 340-351
Hardness of approximate compaction for nonplanar orthogonal graph drawings
Michael J. Bannister
,
David Eppstein
Lecture Notes in Computer Science
7034
, 2012, pp. 367-378