The following pages link to Michael J. Bannister (Q1739107):
Displaying 17 items.
- Track layouts, layered path decompositions, and leveled planarity (Q1739109) (← links)
- Parameterized Complexity of 1-Planarity (Q2842148) (← links)
- Superpatterns and Universal Point Sets (Q2867659) (← links)
- Fixed Parameter Tractability of Crossing Minimization of Almost-Trees (Q2867670) (← links)
- The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings (Q2936922) (← links)
- Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth (Q2936927) (← links)
- Track Layout Is Hard (Q2961541) (← links)
- Inapproximability of Orthogonal Compaction (Q3144115) (← links)
- Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings (Q3223969) (← links)
- The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings (Q3460399) (← links)
- Parameterized Complexity of 1-Planarity (Q4600735) (← links)
- Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth (Q4611385) (← links)
- Force-Directed Graph Drawing Using Social Gravity and Scaling (Q4912222) (← links)
- Randomized Speedup of the Bellman–Ford Algorithm (Q5194707) (← links)
- Small Superpatterns for Dominance Drawing (Q5194761) (← links)
- Superpatterns and Universal Point Sets (Q5417595) (← links)
- Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges (Q5741769) (← links)
