1. Drawability of complete graphs using a minimal slope set;Wade;Comput. J.,1994
2. On linear layouts of graphs;Dujmović;Discrete Math. Theor. Comput. Sci.,2004
3. Bounded-degree graphs have arbitrarily large geometric thickness;Barát;Electron. J. Comb.,2006
4. Bounded-degree graphs can have arbitrarily large slope numbers;Pach;Electron. J. Comb.,2006
5. Graph drawings with few slopes;Dujmović;Comput. Geom.,2007