Finding Hamiltonian Cycles in Certain Planar Graphs. - Robert J. Cimikowski (Inf. Process. Lett., 1990)

Properties of some Euclidean proximity graphs. - Robert J. Cimikowski (Pattern Recognit. Lett., 1992)

On Certain Hamiltonian Inner Triangulations. - Robert J. Cimikowski (Discret. Appl. Math., 1993)

An Analysis of Some Heuristics for the Maximum Planar Subgraph Problem. - Robert J. Cimikowski (SODA, 1995)

On Heuristics for Determining the Thickness of a Graph. - Robert J. Cimikowski (Inf. Sci., 1995)

The sizes of maximal planar, outerplanar, and bipartite planar subgraphs. - Robert J. Cimikowski; Don Coppersmith (Discret. Math., 1996)

A neural-network algorithm for a graph layout problem. - Robert J. Cimikowski; Paul Shope (IEEE Trans. Neural Networks, 1996)

Algorithms for the fixed linear crossing number problem. - Robert J. Cimikowski (Discret. Appl. Math., 2002)

A simple factor-3 approximation for labeling points with circles. - Minghui Jiang 001; Jianbo Qian; Zhongping Qin; Binhai Zhu; Robert J. Cimikowski (Inf. Process. Lett., 2003)

Improved Bounds for the Crossing Number of the Mesh of Trees. - Robert J. Cimikowski; Imrich Vrto (J. Interconnect. Networks, 2003)

An analysis of some linear graph layout heuristics. - Robert J. Cimikowski (J. Heuristics, 2006)

Approximating the fixed linear crossing number. - Robert J. Cimikowski; Brendan Mumey (Discret. Appl. Math., 2007)