- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c4 |      | Michael J. Bannister, Christopher DuBois, David Eppstein, Padhraic Smyth: Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges. SODA 2013: 856-864 |
| i5 | | Michael J. Bannister, Sergio Cabello, David Eppstein: Parameterized Complexity of 1-Planarity. CoRR abs/1304.5591 (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. Graph Drawing 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. Graph Drawing 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) |
| 1 | Sergio Cabello | |
| 2 | Christopher DuBois | |
| 3 | David Eppstein | |
| 4 | Michael T. Goodrich | |
| 5 | Joseph A. Simons | |
| 6 | Padhraic Smyth | |
| 7 | Lowell Trott |
Data released under the ODC-BY 1.0 license — See also our legal information page