On the thickness and arboricity of a graph

Geometric Thickness of Complete Graphs

GD '98 Proceedings of the 6th International Symposium on Graph Drawing

A simulated annealing algorithm for determining the thickness of a graph

Information Sciences—Informatics and Computer Science: An International Journal

Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method

Random Structures & Algorithms

Remarks on the thickness and outerthickness of a graph

Computers & Mathematics with Applications

A simulated annealing algorithm for determining the thickness of a graph

Information Sciences: an International Journal

Simple deterministic algorithms for fully dynamic maximal matching

Proceedings of the forty-fifth annual ACM symposium on Theory of computing