Robert J. Cimikowski

According to our database, Robert J. Cimikowski authored at least 12 papers between 1990 and 2007.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2007

Approximating the fixed linear crossing number.

Robert J. Cimikowski, Brendan Mumey

Discret. Appl. Math., 2007

2006

An analysis of some linear graph layout heuristics.

Robert J. Cimikowski

J. Heuristics, 2006

2003

Improved Bounds for the Crossing Number of the Mesh of Trees.

Robert J. Cimikowski, Imrich Vrto

J. Interconnect. Networks, 2003

A simple factor-3 approximation for labeling points with circles.

Minghui Jiang, Jianbo Qian, Zhongping Qin, Binhai Zhu, Robert J. Cimikowski

Inf. Process. Lett., 2003

2002

Algorithms for the fixed linear crossing number problem.

Robert J. Cimikowski

Discret. Appl. Math., 2002

1996

A neural-network algorithm for a graph layout problem.

Robert J. Cimikowski, Paul Shope

IEEE Trans. Neural Networks, 1996

The sizes of maximal planar, outerplanar, and bipartite planar subgraphs.

Robert J. Cimikowski, Don Coppersmith

Discret. Math., 1996

1995

On Heuristics for Determining the Thickness of a Graph.

Robert J. Cimikowski

Inf. Sci., 1995

An Analysis of Some Heuristics for the Maximum Planar Subgraph Problem.

Robert J. Cimikowski

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

1993

On Certain Hamiltonian Inner Triangulations.

Robert J. Cimikowski

Discret. Appl. Math., 1993

1992

Properties of some Euclidean proximity graphs.

Robert J. Cimikowski

Pattern Recognit. Lett., 1992

1990

Finding Hamiltonian Cycles in Certain Planar Graphs.

Robert J. Cimikowski

Inf. Process. Lett., 1990